A hidden Markov model for progressive multiple alignment (original) (raw)
Journal Article
Unit of Evolutionary Genetics, Free University of Brussels (ULB), cp 300, Institute of Molecular Biology and Medicine, rue Jeener & Brachet 12, B-6041 Gosselies, Belgium
Search for other works by this author on:
Unit of Evolutionary Genetics, Free University of Brussels (ULB), cp 300, Institute of Molecular Biology and Medicine, rue Jeener & Brachet 12, B-6041 Gosselies, Belgium
Search for other works by this author on:
Received:
15 November 2002
Revision received:
11 February 2003
Accepted:
21 February 2003
Published:
12 August 2003
PDF Navbar Search Filter Mobile Enter search term Search
Abstract
Motivation: Progressive algorithms are widely used heuristics for the production of alignments among multiple nucleic-acid or protein sequences. Probabilistic approaches providing measures of global and/or local reliability of individual solutions would constitute valuable developments.
Results: We present here a new method for multiple sequence alignment that combines an HMM approach, a progressive alignment algorithm, and a probabilistic evolution model describing the character substitution process. Our method works by iterating pairwise alignments according to a guide tree and defining each ancestral sequence from the pairwise alignment of its child nodes, thus, progressively constructing a multiple alignment. Our method allows for the computation of each column minimum posterior probability and we show that this value correlates with the correctness of the result, hence, providing an efficient mean by which unreliably aligned columns can be filtered out from a multiple alignment.
Availability: The software is freely available http://www.ulb.ac.be/sciences/ueg/
Contact: [email protected]; [email protected].
*
To whom correspondence should be addressed.
This content is only available as a PDF.
© Oxford University Press 2003