A high quartet distance construction

DOI10.1007/s00026-018-0411-3zbMath1414.05077arXiv1606.02641OpenAlexW2963476467MaRDI QIDQ2421310

Yonatan Komornik, Benny Chor, Péter L. Erdős

Publication date: 14 June 2019

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.02641

zbMATH Keywords

phylogenetic treesquartet distanceprefix and suffix orders

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Combinatorics on words (68R15) Distance in graphs (05C12)

Related Items (1)

On the quartet distance given partial information

Uses Software

• Quartets MaxCut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• The complexity of reconstructing trees from qualitative characters and subtrees
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• On the Maximum Quartet Distance between Phylogenetic Trees
• On the Compatibility of Quartet Trees

This page was built for publication: A high quartet distance construction