Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

DOI10.1002/RSA.20372zbMATH Open1238.05055OpenAlexW2037055526MaRDI QIDQ2884008FDOQ2884008

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

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

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)

Cites Work

• Comparison of phylogenetic trees
• Title not available (Why is that?)
• A fast algorithm for constructing trees from distance matrices
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Taxonomy with confidence
• Optimal phylogenetic reconstruction
• A few logs suffice to build (almost) all trees (I)
• Phylogenies without branch bounds: contracting the short, pruning the deep
• A few logs suffice to build (almost) all trees. II
• Title not available (Why is that?)
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
• Phase transitions in phylogeny
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
• Towards optimal distance functions for stochastic substitution models
• Maximal Accurate Forests from Distance Matrices
• Special issue: 10th annual ACM-SIAM symposium on discrete algorithms (SODA), Baltimore, MD, USA, January 17--19, 1999

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
• Circular Networks from Distorted Metrics
• Fast phylogeny reconstruction through learning of ancestral sequences
• 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)