Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree

DOI10.1137/1.9781611973105.130zbMath1422.68337OpenAlexW4246354033MaRDI QIDQ5741840

Thomas Mailund, Christian N. S. Pedersen, Andreas Sand, Rolf Fagerberg, Gerth Stølting Brodal

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.130

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Data structures (68P05)

Related Items (7)

Fast algorithms for the rooted triplet distance between caterpillars ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance between Trees ⋮ Building a small and informative phylogenetic supertree ⋮ Computing the rooted triplet distance between galled trees by counting triangles ⋮ Unnamed Item ⋮ Computing the rooted triplet distance between phylogenetic networks ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees

This page was built for publication: Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree