ABS：通过扫描进行序列比对。

ABS: Sequence alignment by scanning.

作者信息

Bonny Talal, Salama Khaled N

机构信息

Electrical Engineering Program, King Abdullah University of Science and Technology, Thuwal, Kingdom of Saudi Arabia.

出版信息

Annu Int Conf IEEE Eng Med Biol Soc. 2011;2011:928-31. doi: 10.1109/IEMBS.2011.6090209.

DOI:10.1109/IEMBS.2011.6090209

PMID:22254463

Abstract

Sequence alignment is an essential tool in almost any computational biology research. It processes large database sequences and considered to be high consumers of computation time. Heuristic algorithms are used to get approximate but fast results. We introduce fast alignment algorithm, called 'Alignment By Scanning' (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the well-known alignment algorithms, the 'FASTA' (which is heuristic) and the 'Needleman-Wunsch' (which is optimal). The proposed algorithm achieves up to 76% enhancement in alignment score when it is compared with the FASTA Algorithm. The evaluations are conducted using different lengths of DNA sequences.

摘要

序列比对几乎是所有计算生物学研究中的一项重要工具。它处理大型数据库序列，被认为是计算时间的高消耗者。启发式算法用于获得近似但快速的结果。我们引入了一种名为“扫描比对”（ABS）的快速比对算法，以提供两条DNA序列的近似比对。我们将我们的算法与著名的比对算法“FASTA”（启发式）和“Needleman-Wunsch”（最优）进行了比较。与FASTA算法相比，所提出的算法在比对得分上提高了高达76%。评估是使用不同长度的DNA序列进行的。