序列比对分析：启发式算法
An analysis of sequence alignment: heuristic algorithms.
作者信息
Bucak I Ö, Uslan V
机构信息
Computer Engineering Department, Fatih University, B.Cekmece, Istanbul, Turkey.
出版信息
Annu Int Conf IEEE Eng Med Biol Soc. 2010;2010:1824-7. doi: 10.1109/IEMBS.2010.5626428.
PMID:21096142
Abstract
Sequence alignment becomes challenging with an increase in size and number of sequences. Finding optimal or near optimal solutions for sequence alignment is one of the most important operations in bioinformatics. This study aims to survey heuristics applied for the sequence alignment problem summarized in a time line.
摘要
随着序列大小和数量的增加，序列比对变得具有挑战性。寻找序列比对的最优或近似最优解是生物信息学中最重要的操作之一。本研究旨在调查按时间线总结的应用于序列比对问题的启发式算法。
Zotero 插件