Author of the publication

A lower bound for the breakpoint phylogeny problem

. J. Discrete Algorithms, 2 (2): 229--255 (2004)

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 general comparison of relaxed molecular clock models., , , and . Mol Biol Evol, 24 (12): 2669--2680 (September 2007)Neighbor-net: an agglomerative method for the construction of phylogenetic networks., and . Mol Biol Evol, 21 (2): 255--265 (2004)Optimal agreement supertrees. Computational biology, volume 2066 of Lecture Notes in Comput. Sci., Springer, Berlin, (2001)Constructing optimal trees from quartets, and . J. Algorithms, 38 (1): 237--259 (2001)Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999).Algorithmic aspects of tree amalgamation, , , and . J. Algorithms, 37 (2): 522--537 (2000)NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks., and . WABI, volume 2452 of Lecture Notes in Computer Science, page 375-391. Springer, (2002)Faster reliable phylogenetic analysis., and . RECOMB, page 59-68. ACM, (1999)An O(n log n) time Algorithm for computing the Path-length Distance between Trees., and . CoRR, (2018)A classification of consensus methods for phylogenetics.. Bioconsensus, volume 61 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 163-183. DIMACS/AMS, (2001)The size of a maximum agreement subtree for random binary trees, , and . Bioconsensus (Piscataway, NJ, 2000/2001), volume 61 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI, (2003)