DNA coding sequence optimization method based on hybrid bat algorithm with non-dominated sorting
A technology of non-dominated sorting and bat algorithm, applied in DNA computer, calculation, calculation model and other directions, can solve problems such as incorrect calculation, achieve the effect of fast convergence speed and good global search ability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0039] The embodiments of the present invention are implemented on the premise of the technical solutions of the present invention, and detailed implementation methods and specific operation processes are given, but the protection scope of the present invention is not limited to the following embodiments. In the example, the DNA coding length is equal to 20, and the continuity constraints, hairpin structure constraints, H-measure constraints, similarity constraints, melting temperature constraints, and GC content constraints are as described above.
[0040] Step 1: Initialize the population to generate 20 DNA coding sequences with a length of 20 dimensions, as shown in Table 1. For the relevant parameters required by the initialization algorithm, the bat emission frequency r is set to 0.5, the loudness A is set to 0.25, the pulse frequency increase coefficient is 0.9, and the attenuation coefficient is 0.99.
[0041] Table 1:
[0042]
[0043] Step 2: Use the particle swar...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com