| Literature DB >> 3453222 |
Abstract
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.Mesh:
Substances:
Year: 1987 PMID: 3453222 DOI: 10.1093/bioinformatics/3.2.81
Source DB: PubMed Journal: Comput Appl Biosci ISSN: 0266-7061