Author of the publication

Algorithms on strings, trees, and sequences : computer science and computational biology

. Cambridge Univ. Press, (Jan 15, 2007)

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

Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test., and . SIAM J. Discret. Math., 6 (3): 460-476 (1993)A Faster Parametric Minimum-Cut Algorithm., and . Algorithmica, 11 (3): 278-290 (1994)Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines.. J. Algorithms, 5 (1): 1-6 (1984)Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background.. CoRR, (2014)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)Haplotyping as perfect phylogeny: conceptual framework and efficient solutions.. RECOMB, page 166-175. ACM, (2002)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)Haplotype Inference by Pure Parsimony.. CPM, volume 2676 of Lecture Notes in Computer Science, page 144-155. Springer, (2003)Every finite distributive lattice is a set of stable matchings for a small stable marriage instance., , , and . J. Comb. Theory, Ser. A, 44 (2): 304-309 (1987)Haplotyping as Perfect Phylogeny: A Direct Approach., , , and . J. Comput. Biol., 10 (3/4): 323-340 (2003)