Inferring evolutionary trees with strong combinatorial evidence
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53860 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1256739 (Why is no real title available?)
- scientific article; zbMATH DE number 1088265 (Why is no real title available?)
- scientific article; zbMATH DE number 850224 (Why is no real title available?)
- scientific article; zbMATH DE number 871934 (Why is no real title available?)
- A canonical decomposition theory for metrics on a finite set
- A note on the metric properties of trees
- A polynomial time algorithm for constructing the refined Buneman tree
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Constructing big trees from short sequences
- Efficient algorithms for inferring evolutionary trees
- Probability Inequalities for Sums of Bounded Random Variables
- Reconstructing the shape of a tree from observed dissimilarity data
- Retractions of finite distance functions onto tree metrics
- Taxonomy with confidence
- The complexity of reconstructing trees from qualitative characters and subtrees
- The probabilities of rooted tree-shapes generated by random bifurcation
- Tree structures for proximity data
- \(l_\infty\)-approximation via subdominants.
Cited in
(23)- Integer linear programming as a tool for constructing trees from quartet data
- Testing consistency of quartet topologies: a parameterized approach
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- Minimum tree cost quartet puzzling
- Adaptation of the closest tree method for a two state quartet to Jukes-Cantor tripod trees
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- On the maximum quartet distance between phylogenetic trees
- A `stochastic safety radius' for distance-based tree reconstruction
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- Cache oblivious algorithms for computing the triplet distance between trees
- A structured family of clustering and tree construction methods
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- A fixed-parameter algorithm for minimum quartet inconsistency
- Maximal sub-triangulation in pre-processing phylogenetic data
- A combinatorial description of the closest tree algorithm for finding evolutionary trees
- Encoding phylogenetic trees in terms of weighted quartets
- Reconstructing a phylogenetic level-1 network from quartets
- The large-sample asymptotic behaviour of quartet-based summary methods for species tree inference
- A property tester for tree-likeness of quartet topologies
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets
- scientific article; zbMATH DE number 637307 (Why is no real title available?)
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- scientific article; zbMATH DE number 5003290 (Why is no real title available?)
This page was built for publication: Inferring evolutionary trees with strong combinatorial evidence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575435)
