Author of the publication

Untangling Tanglegrams: Comparing Trees by Their Drawings.

, , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 7 (4): 588-597 (2010)

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

The Performance of Phylogenetic Methods on Trees of Bounded Diameter., , , , and . WABI, volume 2149 of Lecture Notes in Computer Science, page 214-226. Springer, (2001)The Tenacity of Zero-One Laws., and . Electron. J. Comb., (2001)Designing fast converging phylogenetic methods., , , , and . ISMB (Supplement of Bioinformatics), page 190-198. (2001)Untangling Tanglegrams: Comparing Trees by Their Drawings., , , and . ISBRA, volume 5542 of Lecture Notes in Computer Science, page 88-99. Springer, (2009)Efficiently Calculating Evolutionary Tree Measures Using SAT., and . SAT, volume 5584 of Lecture Notes in Computer Science, page 4-17. Springer, (2009)The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 9 (1): 273-285 (2012)Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining., , , and . SODA, page 196-205. ACM/SIAM, (2001)Random Sparse Bit Strings at the Threshold of Adjacency., and . STACS, volume 1373 of Lecture Notes in Computer Science, page 94-104. Springer, (1998)A Linear-Time Majority Tree Algorithm., , and . WABI, volume 2812 of Lecture Notes in Computer Science, page 216-227. Springer, (2003)The Accuracy of Fast Phylogenetic Methods for Large Datasets., , , , , and . Pacific Symposium on Biocomputing, page 211-222. (2002)