Super pairwise alignment (SPA): an efficient approach to global alignment for homologous sequences.
Sequence analysis is the basis of bioinformatics, while sequence alignment is a fundamental task for sequence analysis. The widely used alignment algorithm, Dynamic Programming, though generating optimal alignment, takes too much time due to its high computation complexity O(N(2)). In order to reduce computation complexity without sacrificing too much accuracy, we have developed a new approach to align two homologous sequences. The new approach presented here, adopting our novel algorithm which combines the methods of probabilistic and combinatorial analysis, reduces the computation complexity to as low as O(N). The computation speed by our program is at least 15 times faster than traditional pairwise alignment algorithms without a loss of much accuracy. We hence named the algorithm Super Pairwise Alignment (SPA). The pairwise alignment execution program based on SPA and the detailed results of the aligned sequences discussed in this article are available upon request.
Shen
Shi-Yi
SY
School of Mathematical Sciences, Nankai University and LiuHui Center for Applied Mathematics, Tianjin 300071, P.R.China.
Yang
Jun
J
Yao
Adam
A
Hwang
Pei-Ing
PI
D000465:Algorithms; D000818:Animals; D003198:Computer Simulation; D006801:Humans; D008962:Models, Theoretical; D016415:Sequence Alignment / Q000379:methods* / Q000706:statistics & numerical data; D017385:Sequence Homology; D012984:Software; D013997:Time Factors