A few logs suffice to build (almost) all trees (I)
From MaRDI portal
Publication:4238440
DOI<153::AID-RSA3>3.0.CO;2-R 10.1002/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-RzbMath0945.60004OpenAlexW160062981MaRDI QIDQ4238440
László A. Székely, Péter L. Erdős, Tandy J. Warnow, Mike A. Steel
Publication date: 24 September 2000
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199903)14:2<153::aid-rsa3>3.0.co;2-r
Trees (05C05) Problems related to evolution (92D15) Combinatorial probability (60C05) Protein sequences, DNA sequences (92D20)
Related Items (48)
Combining polynomial running time and fast convergence for the disk-covering method. ⋮ Circular Networks from Distorted Metrics ⋮ Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges ⋮ Phylogenetic information complexity: is testing a tree easier than finding it? ⋮ Towards optimal distance functions for stochastic substitution models ⋮ A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements ⋮ A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors ⋮ Closure operations in phylogenetics ⋮ Comparing evolutionary distances via adaptive distance functions ⋮ On the variational distance of two trees ⋮ Learning loopy graphical models with latent variables: efficient methods and guarantees ⋮ Analytic solutions for three taxon ML trees with variable rates across sites ⋮ Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies ⋮ A tutorial on the balanced minimum evolution problem ⋮ Consistency and convergence rate of phylogenetic inference via regularization ⋮ Optimizing phylogenetic supertrees using answer set programming ⋮ New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem ⋮ Combinatorial statistics and the sciences ⋮ Reconstructing pedigrees: a combinatorial perspective ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ Fast phylogeny reconstruction through learning of ancestral sequences ⋮ On the inference of large phylogenies with long branches: how long is too long? ⋮ New fixed-parameter algorithms for the minimum quartet inconsistency problem ⋮ A few logs suffice to build (almost) all trees. II ⋮ A property tester for tree-likeness of quartet topologies ⋮ Testing consistency of quartet topologies: a parameterized approach ⋮ A phase transition for a random cluster model on phylogenetic trees. ⋮ Inverting random functions. III: Discrete MLE revisited ⋮ Reconstructing a phylogenetic level-1 network from quartets ⋮ On the hardness of inferring phylogenies from triplet-dissimilarities ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Phase transition in the sample complexity of likelihood-based phylogeny inference ⋮ Learning nonsingular phylogenies and hidden Markov models ⋮ The `Butterfly effect' in Cayley graphs with applications to genomics. ⋮ Invertibility of the TKF model of sequence evolution ⋮ A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences ⋮ Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture ⋮ Unnamed Item ⋮ Fast neighbor joining ⋮ Why neighbor-joining works ⋮ Phase transitions in phylogeny ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ On the balanced minimum evolution polytope ⋮ Spectral Neighbor Joining for Reconstruction of Latent Tree Models ⋮ Patching up \(X\)-trees ⋮ Inverting random functions ⋮ An impossibility result for phylogeny reconstruction from \(k\)-mer counts ⋮ Ancestral state reconstruction with large numbers of sequences and edge-length estimation
Cites Work
This page was built for publication: A few logs suffice to build (almost) all trees (I)
