Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
William R. Taylor (Thu,) studied this question.
www.synapsesocial.com/papers/6a0deb7dfb8c7be8ffba88e6 — DOI: https://doi.org/10.1093/bioinformatics/3.2.81
William R. Taylor
Computer applications in the biosciences
Birkbeck, University of London
Building similarity graph...
Analyzing shared references across papers
Loading...