Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Random Struct. Algorithms

• Publication date

  2012-05-01

• Fields of study

  Biology, Mathematics, Computer Science

• Identifiers
  DOI 10.1002/rsa.20372
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Towards optimal distance functions for stochastic substitution models.

  2009cited by this paper
• Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier

  2008cited by this paper
• Fast and reliable reconstruction of phylogenetic trees with very short edges

  2008cited by this paper
• Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep

  2008cited by this paper
• Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences

  2008cited by this paper
• Maximal Accurate Forests from Distance Matrices

  2006cited by this paper
• A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences.

  2006cited by this paper
• Optimal phylogenetic reconstruction

  2005cited by this paper
• Distorted Metrics on Trees and Phylogenetic Forests

  2004cited by this paper
• All of Statistics

  2004cited by this paper
• How much can evolved characters tell us about the tree that generated them?

  2004cited by this paper
• Inferring Phylogenies.—Joseph Felsenstein. 2003. Sinauer Associates, Sunderland, Massachusetts.

  2004cited by this paper
• On the complexity of distance-based evolutionary tree reconstruction

  2003cited by this paper
• Phase transitions in phylogeny

  2003cited by this paper
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications

  2002cited by this paper
• Fast Recovery of Evolutionary Trees with Thousands of Nodes

  2001cited by this paper
• Introduction to Algorithms, 2nd edition.

  2001cited by this paper
• Absolute convergence: true trees from short sequences

  2001cited by this paper
• The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction

  1999cited by this paper
• A few logs suffice to build (almost) all trees (I)

  1999influential reference
• Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction

  1999cited by this paper
• A few logs suffice to build (almost) all trees

  1999cited by this paper
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model

  1998cited by this paper
• A few logs suffice to build (almost) all trees (l): part I

  1997cited by this paper
• A Fast Algorithm for Constructing Trees from Distance Matrices

  1989influential reference
• The neighbor-joining method: a new method for reconstructing phylogenetic trees.

  1987cited by this paper
• Comparison of phylogenetic trees

  1981cited by this paper
• A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences

  1980cited by this paper
• Evolution of Protein Molecules

  1979cited by this paper
• Taxonomy with confidence

  1978cited by this paper
• Additive evolutionary trees.

  1977cited by this paper
• A Probability Model for Inferring Evolutionary Trees

  1973cited by this paper
• The Recovery of Trees from Measures of Dissimilarity

  1971cited by this paper
• MOLECULAR STUDIES OF EVOLUTION: A SOURCE OF NOVEL STATISTICAL PROBLEMS*

  1971cited by this paper
• CHAPTER 24 – Evolution of Protein Molecules

  1969cited by this paper

• Are theoretical advances in distance-based tree learning practical for phylogenetic inference?

  2026influential citation
• Learning latent tree models with small query complexity

  2024cites this paper
• Hierarchical Entity Resolution using an Oracle

  2022cites this paper
• On the quartet distance given partial information

  2021cites this paper
• Accuracy in near-perfect virus phylogenies

  2021cites this paper
• Comparing evolutionary distances via adaptive distance functions.

  2018cites this paper
• Adaptive methods for computing and comparing evolutionary distances

  2017cites this paper
• Circular Networks from Distorted Metrics

  2017cites this paper
• Coalescent-based species tree estimation: a stochastic Farris transform

  2017cites this paper
• Phase transition in the sample complexity of likelihood-based phylogeny inference

  2017cites this paper
• Consistency and convergence rate of phylogenetic inference via regularization.

  2016cites this paper
• Phase transition in the sample complexity of likelihood-based phylogeny inference

  2015cites this paper
• ASTRID: Accurate Species TRees from Internode Distances

  2015cites this paper
• On the Compatibility of Quartet Trees

  2014cites this paper
• Estimating Optimal Species Trees from Incomplete Gene Trees Under Deep Coalescence

  2012cites this paper