( en | de | ru )

 

Disambiguation of "Gusfield, Dan"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Dan Tidten

Dan Bauer

Dan Brüllmann

Marius Dan

Dan Wang

 

Other publications of authors with the same name

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)Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines.. J. Algorithms, 5 (1): 1-6 (1984)Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination., , and . J. Bioinform. Comput. Biol., 2 (1): 173-214 (2004)Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test., and . SIAM J. Discret. Math., 6 (3): 460-476 (1993)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)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)Haplotyping as Perfect Phylogeny: A Direct Approach., , , and . J. Comput. Biol., 10 (3/4): 323-340 (2003)