Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

DOI10.1002/rsa.20372zbMath1238.05055OpenAlexW2037055526MaRDI QIDQ2884008

Sagi Snir, Shlomo Moran, Ilan Gronau

Publication date: 14 May 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20372

zbMATH Keywords

phylogenetic reconstructionadaptive fast convergingfast convergingoptimal time algorithms

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Circular Networks from Distorted Metrics ⋮ Comparing evolutionary distances via adaptive distance functions ⋮ Consistency and convergence rate of phylogenetic inference via regularization ⋮ On the quartet distance given partial information ⋮ Phase transition in the sample complexity of likelihood-based phylogeny inference

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for constructing trees from distance matrices
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Comparison of phylogenetic trees
• Taxonomy with confidence
• Towards optimal distance functions for stochastic substitution models
• A few logs suffice to build (almost) all trees. II
• A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
• Papers to Appear in Forthcoming Issues
• Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
• Optimal phylogenetic reconstruction
• Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
• Maximal Accurate Forests from Distance Matrices
• A few logs suffice to build (almost) all trees (I)
• Phase transitions in phylogeny
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications

This page was built for publication: Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges