Fast algorithms for the rooted triplet distance between caterpillars

DOI10.1007/978-3-030-86593-1_23OpenAlexW3199049052MaRDI QIDQ2140512

Jesper Jansson, Wing Lik Lee

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_23

zbMATH Keywords

caterpillarphylogenetic treeorthogonal range countingrooted triplet distancedynamic rank-select data structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Comparing and aggregating partially resolved trees
• Optimal algorithms for comparing trees with labeled leaves
• Comparison of phylogenetic trees
• Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
• Comparison of labeled trees with valency three
• Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast algorithms for the rooted triplet distance between caterpillars