| Autor: |
Paruchuri, Tirumala, Kancharla, Gangadhara Rao, Dara, Suresh, Yadav, Rohit Kumar, Jadav, Surender Singh, Dhamercherla, Swetha, Vidyarthi, Ankit |
| Zdroj: |
Archives of Computational Methods in Engineering; Nov2022, Vol. 29 Issue 7, p5237-5258, 22p |
| Abstrakt: |
Multiple Sequence Alignment (MSA) problem is considered an NP-hard problem due to its nature of alignment of more than three or more biological sequences like protein or nucleic acid. Many sequence alignment tools are used to identify regions of similarity that may indicate functional, structural, and/or evolutionary relationships between sequences. Many evolutionary computation techniques have successfully been applied for solving MSA problem. This article presented a state of art review about nature-inspired algorithms, furthermore implemented a few algorithms such as GA, PSO, GSA, BBO, and CRO which are used to solve MSA problem, and in addition to presenting their experimental results along with analysis. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink