Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees

DOI10.4230/LIPIcs.ESA.2017.21zbMath1442.68289arXiv1706.10284OpenAlexW2963351835MaRDI QIDQ5111707

Konstantinos Mampentzidis, Gerth Stølting Brodal

Publication date: 27 May 2020

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

zbMATH Keywords

phylogenetic treetriplet distancecache-oblivious algorithmtree comparison

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Problems related to evolution (92D15) Data structures (68P05)

Related Items (4)

Fast algorithms for the rooted triplet distance between caterpillars ⋮ Unnamed Item ⋮ Computing the rooted triplet distance between phylogenetic networks ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees

Uses Software

• tqDist

Cites Work

• Unnamed Item
• Comparing and aggregating partially resolved trees
• Comparison of phylogenetic trees
• Inferring evolutionary trees with strong combinatorial evidence
• An efficient algorithm for the rooted triplet distance between galled trees
• Cache-Oblivious Algorithms
• Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
• On the Scalability of Computing Triplet and Quartet Distances
• Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree

This page was built for publication: Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees