We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Multiple alignment by sequence annealing.
- Authors
Ariel S. Schwartz; Lior Pachter
- Abstract
Motivation: We introduce a novel approach to multiple alignment that is based on an algorithm for rapidly checking whether single matches are consistent with a partial multiple alignment. This leads to a sequence annealing algorithm, which is an incremental method for building multiple sequence alignments one match at a time. Our approach improves significantly on the standard progressive alignment approach to multiple alignment.Results: The sequence annealing algorithm performs well on benchmark test sets of protein sequences. It is not only sensitive, but also specific, drastically reducing the number of incorrectly aligned residues in comparison to other programs. The method allows for adjustment of the sensitivity/specificity tradeoff and can be used to reliably identify homologous regions among protein sequences.Availability: An implementation of the sequence annealing algorithm is available at http://bio.math.berkeley.edu/amap/Contact: sariel@cs.berkeley.edu
- Publication
Bioinformatics, 2007, Vol 23, Issue 2, pe24
- ISSN
1367-4803
- Publication type
Academic Journal
- DOI
10.1093/bioinformatics/btl311