Author of the publication

Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.

, and . ESA, volume 87 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Building a small and informative phylogenetic supertree., , and . Inf. Comput., (October 2023)Computing the Rooted Triplet Distance Between Phylogenetic Networks., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 290-303. Springer, (2019)Building a Small and Informative Phylogenetic Supertree., , and . WABI, volume 143 of LIPIcs, page 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees., and . ESA, volume 87 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Computing the Rooted Triplet Distance Between Phylogenetic Networks., , , and . Algorithmica, 83 (6): 1786-1828 (2021)Cache Oblivious Algorithms for Computing the Triplet Distance between Trees., and . ACM J. Exp. Algorithmics, (2021)