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

Haplotype Inference by Pure Parsimony.. CPM, volume 2676 of Lecture Notes in Computer Science, page 144-155. Springer, (2003)Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event., , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 152-164. Springer, (2005)Haplotyping as perfect phylogeny: conceptual framework and efficient solutions.. RECOMB, page 166-175. ACM, (2002)Efficient and Practical Algorithms for Deducing the History of Recombination in Populations.. International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 618-619. Springer, (2006)A Fast Algorithm for Optimally Increasing the Edge-Connectivity, , and . FOCS, page 698-707. IEEE Computer Society, (1990)0-8186-2082-X.An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs.. ICTAI, IEEE Computer Society, (2003)A new recombination lower bound and the minimum perfect phylogenetic forest problem., and . J. Comb. Optim., 16 (3): 229-247 (2008)A Faster Parametric Minimum-Cut Algorithm., and . Algorithmica, 11 (3): 278-290 (1994)Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination., , and . J. Bioinform. Comput. Biol., 2 (1): 173-214 (2004)Triangulation heuristics for maximum character compatibility., , and . ICCABS, page 1-2. IEEE Computer Society, (2013)