( en | de | ru )

 

Disambiguation of "Warnow, Tandy J."

Author of the publication

copydeleteadd this publication to your clipboard
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed.

, and . SODA, page 595-603. ACM/SIAM, (1995)

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.

Susan Tandy

Dirk Warnow

Hans-Ulrich Warnow

Heinrich J J Mieschendahl

Norbert J J Bock

 

Other publications of authors with the same name

A Few Logs Suffice to Build (Almost) All Trees (I), , , and . Random Struct. Alg., (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)Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods., , , , , and . Pacific Symposium on Biocomputing, page 315-326. (2003)Inferring Evolutionary History from DNA Sequences (Extended Abstract), and . FOCS, page 362-371. IEEE Computer Society, (1990)Hybrid Tree Reconstruction Methods., , , , and . WAE, page 179-192. Max-Planck-Institut für Informatik, (1998)Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages., , , and . Mathematical Hierarchies and Biology, volume 37 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 43-56. DIMACS/AMS, (1996)New Divide-and-Conquer Techniques for Large-Scale Phylogenetic Estimation.. AlCoB, volume 11488 of Lecture Notes in Computer Science, page 3-21. Springer, (2019)A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed., and . SODA, page 595-603. ACM/SIAM, (1995)