Inferring evolutionary trees with strong combinatorial evidence
From MaRDI portal
Publication:1575435
DOI10.1016/S0304-3975(99)00235-2zbMath0945.68101MaRDI QIDQ1575435
Vincent Berry, Olivier Gascuel
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
exact polynomial algorithmquartet methodexperimental studyphylogeny reconstructioncombinatorial techniquepartially resolved treeworst-case convergence rate
Related Items
A fixed-parameter algorithm for minimum quartet inconsistency ⋮ A `stochastic safety radius' for distance-based tree reconstruction ⋮ A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors ⋮ Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance between Trees ⋮ A property tester for tree-likeness of quartet topologies ⋮ Testing consistency of quartet topologies: a parameterized approach ⋮ Reconstructing a phylogenetic level-1 network from quartets ⋮ Encoding phylogenetic trees in terms of weighted quartets ⋮ Integer linear programming as a tool for constructing trees from quartet data ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Consistency of the QNet algorithm for generating planar split networks from weighted quartets ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees ⋮ A structured family of clustering and tree construction methods ⋮ Minimum tree cost quartet puzzling
Uses Software
Cites Work
- Reconstructing the shape of a tree from observed dissimilarity data
- Computational complexity of inferring phylogenies from dissimilarity matrices
- A canonical decomposition theory for metrics on a finite set
- The complexity of reconstructing trees from qualitative characters and subtrees
- Taxonomy with confidence
- Retractions of finite distance functions onto tree metrics
- \(l_\infty\)-approximation via subdominants.
- A polynomial time algorithm for constructing the refined Buneman tree
- A note on the metric properties of trees
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
- Tree structures for proximity data
- Constructing big trees from short sequences
- Probability Inequalities for Sums of Bounded Random Variables
- The probabilities of rooted tree-shapes generated by random bifurcation
- Efficient algorithms for inferring evolutionary trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
