Cache Oblivious Algorithms for Computing the Triplet Distance between Trees

DOI10.1145/3433651zbMath1499.68075OpenAlexW3160262327MaRDI QIDQ5102045

Gerth Stølting Brodal, Konstantinos Mampentzidis

Publication date: 6 September 2022

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3433651

zbMATH Keywords

phylogenetic treetriplet distancecache-oblivious algorithmtree comparison

Mathematics Subject Classification ID

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

Related Items (1)

Building a small and informative phylogenetic supertree

Cites Work

• Unnamed Item
• Comparing and aggregating partially resolved trees
• Optimal algorithms for comparing trees with labeled leaves
• Comparison of phylogenetic trees
• Inferring evolutionary trees with strong combinatorial evidence
• An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
• Engineering a cache-oblivious sorting algorithm
• First draft of a report on the EDVAC
• Computing quartet distance is equivalent to counting 4-cycles
• 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