Author of the publication

Fast and Accurate Species Trees from Weighted Internode Distances.

, and . WABI, volume 242 of LIPIcs, page 8:1-8:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

Enhancing Searches for Optimal Trees Using SIESTA., and . RECOMB-CG, volume 10562 of Lecture Notes in Computer Science, page 232-255. Springer, (2017)Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics., and . Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, page 163-180. Springer, (2000)Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time., and . WABI, volume 2149 of Lecture Notes in Computer Science, page 156-163. Springer, (2001)Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction., , and . J. Comput. Biol., 6 (3/4): 369-386 (1999)Gene tree parsimony for incomplete gene trees: addressing true biological loss., and . Algorithms Mol. Biol., 13 (1): 1:1-1:12 (2018)The Accuracy of Fast Phylogenetic Methods for Large Datasets., , , , , and . Pacific Symposium on Biocomputing, page 211-222. (2002)Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods., , , , , and . Pacific Symposium on Biocomputing, page 315-326. (2003)DACTAL: divide-and-conquer trees (almost) without alignments., , , , and . Bioinform., 28 (12): 274-282 (2012)Misunderstood parameter of NCBI BLAST impacts the correctness of bioinformatics workflows., , , and . Bioinform., 35 (9): 1613-1614 (2019)Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining., , , and . SODA, page 196-205. ACM/SIAM, (2001)