Taylor W R
Dept. of Crystallography, Birkbeck College, London, UK.
Comput Appl Biosci. 1987 Jun;3(2):81-7. doi: 10.1093/bioinformatics/3.2.81.
An algorithm is described that processes the results of a conventional pairwise sequence alignment program to automatically produce an unambiguous multiple alignment of many sequences. Unlike other, more complex, multiple alignment programs, the method described here is fast enough to be used on almost any multiple sequence alignment problem.
本文描述了一种算法,该算法处理传统的成对序列比对程序的结果,以自动生成多个序列的明确多重比对。与其他更复杂的多重比对程序不同,这里描述的方法速度足够快,几乎可以用于任何多重序列比对问题。