.png){kind=icon}
返回
AlineaGA-a genetic algorithm with local search optimization for multiple sequence alignment
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-009-0189-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The alignment and comparison of DNA, RNA and Protein sequences is one of the most common and important tasks in Bioinformatics. However, due to the size and complexity of the search space involved, the search for the best possible alignment for a set of sequences is not trivial. Genetic Algorithms have a predisposition for optimizing general combinatorial problems and therefore are serious candidates for solving multiple sequence alignment tasks. Local search optimization can be used to refine the solutions explored by Genetic Algorithms. We have designed a Genetic Algorithm which incorporates local search for this purpose: AlineaGA. We have tested AlineaGA with representative sequence sets of the globin family. We also compare the achieved results with the results provided by T-COFFEE.
Keyword:
Multiple sequence alignments
Genetic algorithms
Local search
Optimization
Hybridization
Bioinformatics
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Laser-Induced Breakdown Spectroscopy (LIBS) Analysis of Calcium Ions Dissolved in Water Using Filter Paper Substrates: An Ideal Internal Standard for Precision Improvement使用滤纸基底对溶解在水中的钙离子进行激光诱导击穿光谱 (LIBS) 分析: 提高精度的理想内标
PREAI
分享收藏
查看更多内容