Searching for authors named Dan Gusfield – sorted by Relevance.
-
An Overview of Combinatorial Methods for Haplotype Inference
- An Overview of Combinatorial Methods for Haplotype Inference Dan Gusfield 1 Department of Computer
- Cited by 16 (2 self) – Add To MetaCart
-
On the decomposition optimality conjecture for phylogenetic networks
- Conjecture for Phylogenetic Networks Dan Gusfield January 25, 2005 1 On the Full-Decomposition Optimality
- Cited by 1 (1 self) – Add To MetaCart
-
A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters
- A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters Dan
- Cited by 24 (1 self) – Add To MetaCart
-
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
- - Copyright c 2000, American Association for Arti cial Intelligence (www.aaai.org). All rights reserved. Dan
- Cited by 19 (0 self) – Add To MetaCart
-
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- -Unknown Phylogenetic Networks with Constrained and Structured Recombination 1 Dan Gusfield November 25, 2004 1
- Cited by 13 (6 self) – Add To MetaCart
-
EFFICIENT COMPUTATION OF MINIMUM RECOMBINATION WITH GENOTYPES (NOT HAPLOTYPES)
- EFFICIENT COMPUTATION OF MINIMUM RECOMBINATION WITH GENOTYPES (NOT HAPLOTYPES) Yufeng Wu ∗ and Dan
- Add To MetaCart
-
The Structure and Complexity of Sports Elimination Numbers
- The Structure and Complexity of Sports Elimination Numbers 1 Dan Gusfield and Chip Martel
- Cited by 2 (0 self) – Add To MetaCart
-
On the complexity of fundamental computational problems in pedigree analysis
- Piccolboni and Dan Gusfield Computer Science Department University of California, Davis. Technical Report
- Cited by 2 (0 self) – Add To MetaCart
-
D.: Improved algorithms for inferring the minimum mosaic of a set of recombinants
- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants Yufeng Wu and Dan
- Cited by 1 (0 self) – Add To MetaCart
-
Linear Time Algorithms for Finding and Representing all Tandem Repeats in a String
- Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String Dan Gusfield z
- Cited by 22 (2 self) – Add To MetaCart

