title: Multiple alignment by sequence annealing.
abstract: BACKGROUND
  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.
  
  
  BACKGROUND
  An implementation of the sequence annealing algorithm is available at http://bio.math.berkeley.edu/amap/
authors.affiliation: EECS, Computer Science Division, University of California Berkeley, CA 94720, USA. sariel@cs.berkeley.edu
authors.forename: Ariel S
authors.initials: AS
authors.lastname: Schwartz
authors.forename: Lior
authors.initials: L
authors.lastname: Pachter
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D008969:Molecular Sequence Data; D011506:Proteins / Q000737:chemistry*; D016415:Sequence Alignment / Q000379:methods*; D020539:Sequence Analysis, Protein / Q000379:methods*
chemical_list: D011506:Proteins