Display Settings:

Format

Send to:

Choose Destination
See comment in PubMed Commons below
Bioinformatics. 2007 Jan 15;23(2):e24-9.

Multiple alignment by sequence annealing.

Author information

  • 1EECS, Computer Science Division, University of California Berkeley, CA 94720, USA. sariel@cs.berkeley.edu

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/

PMID:
17237099
[PubMed - indexed for MEDLINE]
Free full text
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Icon for HighWire
    Loading ...
    Write to the Help Desk