An efficient algorithm for the rooted triplet distance between galled trees

DOI10.1007/978-3-319-58163-7_8zbMath1367.92085OpenAlexW3205767969MaRDI QIDQ2364900

Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung

Publication date: 25 July 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58163-7_8

zbMATH Keywords

algorithmcomputational complexityrooted tripletgalled treephylogenetic network comparison

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

An efficient algorithm for the rooted triplet distance between galled trees ⋮ Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees

Cites Work

• Unnamed Item
• On encodings of phylogenetic networks of bounded level
• Comparing and aggregating partially resolved trees
• Fixed topology alignment with recombination
• An efficient algorithm for the rooted triplet distance between galled trees
• Computing the rooted triplet distance between galled trees by counting triangles

This page was built for publication: An efficient algorithm for the rooted triplet distance between galled trees