A few logs suffice to build (almost) all trees (I)
From MaRDI portal
(Redirected from A few logs suffice to build (almost) all trees (I))
Recommendations
Cites work
Cited in
(56)- Fast neighbor joining
- Why neighbor-joining works
- Patching up \(X\)-trees
- Inverting random functions
- A phase transition for a random cluster model on phylogenetic trees.
- Phylogenetic information complexity: is testing a tree easier than finding it?
- Towards optimal distance functions for stochastic substitution models
- Comparing evolutionary distances via adaptive distance functions
- The matroid structure of representative triple sets and triple-closure computation
- Combining polynomial running time and fast convergence for the disk-covering method.
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- Fast phylogeny reconstruction through learning of ancestral sequences
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- A few logs suffice to build (almost) all trees. II
- An impossibility result for phylogeny reconstruction from \(k\)-mer counts
- Ancestral state reconstruction with large numbers of sequences and edge-length estimation
- A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements
- Reconstructing pedigrees: a combinatorial perspective
- Closure operations in phylogenetics
- Consistency and convergence rate of phylogenetic inference via regularization
- Testing consistency of quartet topologies: a parameterized approach
- On the hardness of inferring phylogenies from triplet-dissimilarities
- Invertibility of the TKF model of sequence evolution
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- A tutorial on the balanced minimum evolution problem
- Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences
- Absolute convergence: True trees from short sequences
- Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies
- scientific article; zbMATH DE number 1945175 (Why is no real title available?)
- Phase transitions in phylogeny
- Optimizing phylogenetic supertrees using answer set programming
- Reconstructing a phylogenetic level-1 network from quartets
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
- Spectral neighbor joining for reconstruction of latent tree models
- New absolute fast converging phylogeny estimation methods with improved scalability and accuracy
- Teasing Apart Two Trees
- Research in Computational Molecular Biology
- Circular Networks from Distorted Metrics
- Combinatorial statistics and the sciences
- On the inference of large phylogenies with long branches: how long is too long?
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
- A property tester for tree-likeness of quartet topologies
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
- Inverting random functions. III: Discrete MLE revisited
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- Lower bounds on the sample complexity of species tree estimation when substitution rates vary across loci
- The `Butterfly effect' in Cayley graphs with applications to genomics.
- Reconstructing ultrametric trees from noisy experiments
- Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
- On the balanced minimum evolution polytope
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- On the variational distance of two trees
- Analytic solutions for three taxon ML trees with variable rates across sites
This page was built for publication: A few logs suffice to build (almost) all trees (I)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238440)
