Author of the publication

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

A Few Logs Suffice to Build (Almost) All Trees (I), , , and . Random Struct. Alg., (1999)Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining., , , and . SODA, page 196-205. ACM/SIAM, (2001)A few logs suffice to build (almost) all trees (I)., , , and . Random Struct. Algorithms, 14 (2): 153-184 (1999)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)Enhancing Searches for Optimal Trees Using SIESTA., and . RECOMB-CG, volume 10562 of Lecture Notes in Computer Science, page 232-255. Springer, (2017)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)Misunderstood parameter of NCBI BLAST impacts the correctness of bioinformatics workflows., , , and . Bioinform., 35 (9): 1613-1614 (2019)DACTAL: divide-and-conquer trees (almost) without alignments., , , , and . Bioinform., 28 (12): 274-282 (2012)The Accuracy of Fast Phylogenetic Methods for Large Datasets., , , , , and . Pacific Symposium on Biocomputing, page 211-222. (2002)