Absolute convergence: True trees from short sequences

MaRDI QIDQ2768289zbMATH OpenFDO

Authors Bernard M. E. Moret, Katherine St. John, Tandy J. Warnow

Publication date 8 April 2002

zbMATH Keywords

absolute fast convergencegeneral Markov modelphylogenetic reconstructionphylogenetic treesshort quartet support methodSQS

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of mathematical programming (90C90) Problems related to evolution (92D15)

Recommendations

• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Fast phylogeny reconstruction through learning of ancestral sequences
• Constructing big trees from short sequences
• A few logs suffice to build (almost) all trees (I)
• The Performance of Phylogenetic Methods on Trees of Bounded Diameter

Cited in

(8)

• Combining polynomial running time and fast convergence for the disk-covering method.
• Fast and accurate branch support calculation for distance-based phylogenetic placements
• Consistency and convergence rate of phylogenetic inference via regularization
• A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
• Reconstruction of large phylogenetic trees: a parallel approach
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• New absolute fast converging phylogeny estimation methods with improved scalability and accuracy

This page was built for publication: Absolute convergence: True trees from short sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768289)