| Standard Needleman-Wunsch dynamic programming algorithm || Protein || Global || Y Zhang || 2012
|-
| mAlign
| modelling alignment; models the information content of the sequences || Nucleotide || Both || D. Powell, L. Allison and T. I. Dix<ref>{{Cite journal |last=Powell |first=David R. |last2=Allison |first2=Lloyd |last3=Dix |first3=Trevor I. |date=2005 |editor-last=Webb |editor-first=Geoffrey I. |editor2-last=Yu |editor2-first=Xinghuo |title=Modelling-Alignment for Non-random Sequences |url=https://link.springer.com/chapter/10.1007/978-3-540-30549-1_19 |journal=AI 2004: Advances in Artificial Intelligence |language=en |___location=Berlin, Heidelberg |publisher=Springer |pages=203–214 |doi=10.1007/978-3-540-30549-1_19 |isbn=978-3-540-30549-1}}</ref>|| 2004
|-
| matcher
Line 305 ⟶ 302:
| [[AMAP]]
| Sequence annealing || Both || Global || A. Schwartz and [[Lior Pachter|L. Pachter]] || 2006 ||
|-
| anon.
| fast, optimal alignment of three sequences using linear gap costs || Nucleotides || Global || D. Powell, L. Allison and T. I. Dix<ref>{{Cite journal |last=Powell |first=DAVID R. |last2=Allison |first2=LLOYD |last3=Dix |first3=TREVOR I. |date=2000-12-07 |title=Fast, Optimal Alignment of Three Sequences Using Linear Gap Costs |url=https://www.sciencedirect.com/science/article/pii/S0022519300921775 |journal=Journal of Theoretical Biology |volume=207 |issue=3 |pages=325–336 |doi=10.1006/jtbi.2000.2177 |issn=0022-5193}}</ref>|| 2000 ||
