Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

DOI10.1002/RSA.20372MaRDI QIDQ2884008zbMATH OpenOpenAlexFDO

Authors Ilan Gronau, Shlomo Moran, Sagi Snir

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

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

Recommendations

• Fast phylogeny reconstruction through learning of ancestral sequences
• Phylogenies without branch bounds: contracting the short, pruning the deep
• Absolute convergence: True trees from short sequences
• Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
• Optimal phylogenetic reconstruction

Cites work

• scientific article; zbMATH DE number 5764888 (Why is no real title available?)
• scientific article; zbMATH DE number 2038320 (Why is no real title available?)
• A fast algorithm for constructing trees from distance matrices
• A few logs suffice to build (almost) all trees (I)
• 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
• Comparison of phylogenetic trees
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Maximal Accurate Forests from Distance Matrices
• Optimal phylogenetic reconstruction
• Phase transitions in phylogeny
• Phylogenies without branch bounds: contracting the short, pruning the deep
• Special issue: 10th annual ACM-SIAM symposium on discrete algorithms (SODA), Baltimore, MD, USA, January 17--19, 1999
• Taxonomy with confidence
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Towards optimal distance functions for stochastic substitution models

Cited in

(9)

• Edge lengths of trees from sequence data
• Phylogenies without branch bounds: contracting the short, pruning the deep
• Consistency and convergence rate of phylogenetic inference via regularization
• Fast phylogeny reconstruction through learning of ancestral sequences
• Circular Networks from Distorted Metrics
• Absolute convergence: True trees from short sequences
• Comparing evolutionary distances via adaptive distance functions
• On the quartet distance given partial information
• Phase transition in the sample complexity of likelihood-based phylogeny inference

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

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