.png){kind=icon}
返回
Nature Inspired Algorithms for Solving Multiple Sequence Alignment Problem: A Review
.png){kind=icon}
PRE
AI
DOI：10.1007/s11831-022-09769-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiple Sequence Assignment (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.
Keyword:
GENETIC ALGORITHM
SECONDARY STRUCTURE
SEARCH
OPTIMIZATION
DEFINITION
期刊
IF:
12.1
论文数:
1.8K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmarkBAliBASE 3.0: 多序列比对基准的最新进展
PREAI
分享收藏
查看更多内容