Gusfield Publications of Dan Gusfield     Order by:   Type | Year
Associated keywords
2020
1
photo
Hannah Brown, Lei Zuo and Dan Gusfield. Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology. In AlCoB2020, Vol. 12099:63-76 of LNCS, Springer, 2020.
Keywords: from binary characters, History bound, integer linear programming, minimum number, phylogeny, SAT.
Note: https://doi.org/10.1007/978-3-030-42266-0_6.
       

2017
2
photophotophotophotophoto
Julia Matsieva, Steven Kelk, Celine Scornavacca, Chris Whidden and Dan Gusfield. A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. In TCBB, Vol. 14(2):404-417, 2017.
Keywords: ARG, explicit network, from sequences, minimum number, phylogenetic network, phylogeny.
       

2015
3
photo
Dan Gusfield. Persistent Phylogeny: A Galled-Tree and Integer Linear Programming Approach. In BCB15, Pages 443-451, 2015.
Keywords: explicit network, from binary characters, galled tree, integer linear programming, phylogenetic network, phylogeny, reconstruction.
Note: http://arxiv.org/abs/1506.00678.
       

2014
4
photo
Dan Gusfield. ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks. MIT Press, 2014.
Keywords: ARG, explicit network, phylogenetic network, phylogeny, survey.
Note: http://mitpress.mit.edu/books/recombinatorics.
       

2007
5
photophotophoto
Dan Gusfield, Dean Hickerson and Satish Eddhu. An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. In DAM, Vol. 155(6-7):806-830, 2007.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/cclowerbound.pdf.
       
Toggle abstract
6
photophoto
Yufeng Wu and Dan Gusfield. A new recombination lower bound and the minimum perfect phylogenetic forest problem. In COCOON07, Vol. 4598:16-26 of LNCS, springer, 2007.
Keywords: perfect, phylogenetic network, phylogeny.
Note: http://dx.doi.org/10.1007/978-3-540-73545-8_5.
       

7
photophoto
Yufeng Wu and Dan Gusfield. Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. In CPM07, Vol. 4580:150-161 of LNCS, springer, 2007.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/CPM2007mosaic.pdf.
       

8
photophoto
Yufeng Wu and Dan Gusfield. Efficient Computation of Minimum Recombination with Genotypes (not Haplotypes) In JBCB, Vol. 5(2(a)):181-200, 2007.
Note: http://dx.doi.org/10.1142/S0219720007002631.
       

9
photophotophotophoto
Dan Gusfield, Vikas Bansal, Vineet Bafna and Yun S. Song. A Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In JCB, Vol. 14(10):1247-1272, 2007.
Keywords: explicit network, from sequences, galled tree, phylogenetic network, phylogeny, Program Beagle, Program GalledTree, recombination, reconstruction, software.
Note: http://www.eecs.berkeley.edu/~yss/Pub/decomposition.pdf.
       

10
photophotophotophotophoto
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles Langley and Yufeng Wu. Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. In JCB, Vol. 14(10):1273-1286, 2007.
Keywords: ARG, from sequences, phylogenetic network, phylogeny, Program SHRUB, reconstruction.
Note: http://dx.doi.org/10.1089/cmb.2007.0096.
       
Toggle abstract
2006
11
photophoto
Yufeng Wu and Dan Gusfield. Efficient Computation of Minimum Recombination with Genotypes (not Haplotypes) In CSB06, Pages 147-156, 2006.
Note: http://www.lifesciencessociety.org/CSB2006/Papers/131_Wu.pdf.
       

2005
12
photophoto
Dan Gusfield and Vikas Bansal. A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In RECOMB05, Vol. 3500:217-232 of LNCS, springer, 2005.
Keywords: explicit network, from sequences, phylogenetic network, phylogeny, polynomial, recombination, reconstruction.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/gusfieldrecomb.pdf.
       

13
photo
Dan Gusfield. On the Full-Decomposition Optimality Conjecture for Phylogenetic Networks. 2005.
Keywords: characterization, explicit network, from sequences, phylogenetic network, reconstruction.
Note: UC Davis Computer Science Technical Report CSE-2005, http://wwwcsif.cs.ucdavis.edu/~gusfield/fullydecomp.pdf.
       

14
photophotophoto
Yun S. Song, Yufeng Wu and Dan Gusfield. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. In ISMB05, Vol. 21:i413-i422 of BIO, 2005.
Keywords: integer linear programming, minimum number, Program HapBound, Program SHRUB, recombination.
Note: http://dx.doi.org/10.1093/bioinformatics/bti1033.
       
Toggle abstract
2004
15
photophoto
Dan Gusfield and Dean Hickerson. A Fundamental, Efficiently-Computed Lower Bound on the Number of Recombinations Needed in Phylogenetic Networks. 2004.
Note: UC Davis Computer Science Technical Report.
       

16
photophotophoto
Dan Gusfield, Satish Eddhu and Charles Langley. The fine structure of galls in phylogenetic networks. In INCOMP, Vol. 16(4):459-469, 2004.
Keywords: explicit network, from sequences, galled tree, phylogenetic network, phylogeny, reconstruction.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/informs.pdf.
       
Toggle abstract
17
photophotophoto
Dan Gusfield, Satish Eddhu and Charles Langley. Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. In JBCB, Vol. 2(1):173-213, 2004.
Keywords: explicit network, from sequences, galled tree, phylogenetic network, phylogeny, recombination, reconstruction.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/exfinalrec.pdf.
       
Toggle abstract
2003
18
photophotophoto
Dan Gusfield, Satish Eddhu and Charles Langley. Efficient reconstruction of phylogenetic networks with constrained recombination. In CSB03, Pages 363-374, 2003.
Keywords: explicit network, from sequences, galled tree, phylogenetic network, phylogeny, recombination, reconstruction.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/ieeefinal.pdf.
       

2002
19
photo
Dan Gusfield. Haplotyping as Perfect Phylogeny: Conceptual Framework and Efficient Solutions. In RECOMB02, 2002.
Keywords: haplotyping, perfect, phylogeny.
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/acmhapre.pdf .
       

1998
20
photophoto
John Kececioglu and Dan Gusfield. Reconstructing a history of recombinations from a set of sequences. In DAM, Pages 239-260, 1998.
Keywords: from sequences, NP complete, polynomial, recombination, reconstruction.
Note: http://citeseer.ist.psu.edu/76600.html.
       

1994
21
photophoto
John Kececioglu and Dan Gusfield. Reconstructing a history of recombinations from a set of sequences. In SODA94, Pages 471-480, 1994.
Keywords: from sequences, NP complete, polynomial, recombination, reconstruction.
Note: http://portal.acm.org/citation.cfm?id=314626#.