Premium
An ant colony pairwise alignment based on the dot plots
Author(s) -
Chen Weiyang,
Liao Bo,
Zhu Wen,
Liu Hao,
Zeng Qingguang
Publication year - 2008
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.21039
Subject(s) - pairwise comparison , matching (statistics) , computer science , position (finance) , multiple sequence alignment , ant colony optimization algorithms , process (computing) , sequence (biology) , matrix (chemical analysis) , artificial intelligence , algorithm , data mining , mathematics , sequence alignment , statistics , biology , chemistry , biochemistry , genetics , peptide sequence , finance , chromatography , economics , gene , operating system
Sequence alignment is one of the most important operations in bioinformatics. In this article, we introduced a new method for pairwise alignment. We associated the process of aligning with the plan by the modified dot plots. The next position will be selected by the number of pheromone and the matching score of the candidates. The presented algorithm can be used to find the best aligning result without calculating the scoring matrix. Superiority of the presented algorithm has been proved in several experiments. © 2008 Wiley Periodicals, Inc. J Comput Chem 2009