Title | ||
---|---|---|
Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences |
Abstract | ||
---|---|---|
The reconstruction of evolutionary trees (phylogenies) from DNA sequence data is a central problem in biology. We describe simple sufficient conditions for two tree reconstruction methods (maximum parsimony and maximum compatibility) to correctly reconstruct a tree when applied to sufficiently many sequence sites generated under a simple stochastic model. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1137/S0895480198343571 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
sequence site,tree reconstruction method,sufficiently long sequences,maximum compatibility,evolutionary tree,simple stochastic model,simple sufficient condition,dna sequence data,stochastic models,tree reconstruction techniques,sufficient conditions,genetic sequences,central problem,maximum parsimony,maximum parsimony method,trees,dna sequence,evolutionary trees,stochastic model,genetics | Graph theory,Convergence of random variables,Combinatorics,Maximum parsimony,Phylogenetic tree,Tree (graph theory),Tree rearrangement,Algorithm,Probability distribution,Stochastic modelling,Mathematics | Journal |
Volume | Issue | ISSN |
14 | 1 | 0895-4801 |
Citations | PageRank | References |
2 | 0.44 | 0 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mike Steel | 1 | 270 | 41.87 |