Source:http://linkedlifedata.com/resource/pubmed/id/14980015
Switch to
Predicate | Object |
---|---|
rdf:type | |
lifeskim:mentions | |
pubmed:issue |
6
|
pubmed:dateCreated |
2004-2-24
|
pubmed:abstractText |
We present an efficient algorithm for statistical multiple alignment based on the TKF91 model of Thorne, Kishino, and Felsenstein (1991) on an arbitrary k-leaved phylogenetic tree. The existing algorithms use a hidden Markov model approach, which requires at least O( radical 5(k)) states and leads to a time complexity of O(5(k)L(k)), where L is the geometric mean sequence length. Using a combinatorial technique reminiscent of inclusion/exclusion, we are able to sum away the states, thus improving the time complexity to O(2(k)L(k)) and considerably reducing memory requirements. This makes statistical multiple alignment under the TKF91 model a definite practical possibility in the case of a phylogenetic tree with a modest number of leaves.
|
pubmed:language |
eng
|
pubmed:journal | |
pubmed:citationSubset |
IM
|
pubmed:status |
MEDLINE
|
pubmed:issn |
1066-5277
|
pubmed:author | |
pubmed:issnType |
Print
|
pubmed:volume |
10
|
pubmed:owner |
NLM
|
pubmed:authorsComplete |
Y
|
pubmed:pagination |
869-89
|
pubmed:dateRevised |
2006-11-15
|
pubmed:meshHeading |
pubmed-meshheading:14980015-Algorithms,
pubmed-meshheading:14980015-Amino Acid Sequence,
pubmed-meshheading:14980015-Base Sequence,
pubmed-meshheading:14980015-Computational Biology,
pubmed-meshheading:14980015-Evolution, Molecular,
pubmed-meshheading:14980015-Markov Chains,
pubmed-meshheading:14980015-Phylogeny,
pubmed-meshheading:14980015-Sequence Alignment,
pubmed-meshheading:14980015-Stochastic Processes
|
pubmed:year |
2003
|
pubmed:articleTitle |
An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees.
|
pubmed:affiliation |
Department of Statistics, University of Oxford, Oxford, OX1 3TG, UK. lunter@stats.ox.ac.uk
|
pubmed:publicationType |
Journal Article,
Research Support, Non-U.S. Gov't
|