On the Maximum Quartet Distance between Phylogenetic Trees
From MaRDI portal
Publication:2800184
DOI10.1137/15M1041754zbMath1338.92084OpenAlexW2338023615MaRDI QIDQ2800184
Humberto Naves, Noga Alon, Benjamin Sudakov
Publication date: 15 April 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1041754
Problems related to evolution (92D15) Combinatorics in computer science (68R05) Extremal combinatorics (05D99)
Related Items (4)
A high quartet distance construction ⋮ On the quartet distance given partial information ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Semidefinite Programming and Ramsey Numbers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- A problem of Erdős and Sós on 3-graphs
- A problem of Erdős on the minimum number of \(k\)-cliques
- The complexity of reconstructing trees from qualitative characters and subtrees
- Inferring evolutionary trees with strong combinatorial evidence
- On the number of pentagons in triangle-free graphs
- On the Compatibility of Quartet Trees
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- On the Minimal Density of Triangles in Graphs
- Tree structures for proximity data
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Reconstructing Approximate Phylogenetic Trees from Quartet Samples
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Flag algebras
This page was built for publication: On the Maximum Quartet Distance between Phylogenetic Trees
