☰

Daniel M. Gusfield - Publications

Affiliations: 
Computer Science University of California, Davis, Davis, CA 
Area:
Computer Science, Bioinformatics Biology
Tree Info Similar researchers PubMed Report error

65 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Matsieva J, Kelk S, Scornavacca C, Whidden C, Gusfield D. A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. Ieee/Acm Transactions On Computational Biology and Bioinformatics. 14: 404-417. PMID 26887004 DOI: 10.1109/Tcbb.2016.2527645  0.41
2016 Frid Y, Gusfield D. An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding. Algorithms For Molecular Biology : Amb. 11: 22. PMID 27499801 DOI: 10.1186/S13015-016-0081-9  0.397
2015 Xu SJ, Gysel R, Gusfield D. Minimum average distance clique trees Siam Journal On Discrete Mathematics. 29: 1706-1734. DOI: 10.1137/15M1021052  0.411
2014 Venkatachalam B, Gusfield D, Frid Y. Faster algorithms for RNA-folding using the Four-Russians method. Algorithms For Molecular Biology : Amb. 9: 5. PMID 24602450 DOI: 10.1186/1748-7188-9-5  0.402
2012 Gysel R, Lam F, Gusfield D. Constructing perfect phylogenies and proper triangulations for three-state characters. Algorithms For Molecular Biology : Amb. 7: 26. PMID 23006612 DOI: 10.1186/1748-7188-7-26  0.399
2011 Gysel R, Gusfield D. Extensions and improvements to the chordal graph approach to the multistate perfect phylogeny problem. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 8: 912-7. PMID 21301033 DOI: 10.1109/Tcbb.2011.27  0.454
2011 Lam F, Gusfield D, Sridhar S. Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters Siam Journal On Discrete Mathematics. 25: 1144-1175. DOI: 10.1137/090776305  0.35
2010 Venkatachalam B, Apple J, St John K, Gusfield D. Untangling tanglegrams: comparing trees by their drawings. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 7: 588-97. PMID 20530818 DOI: 10.1109/Tcbb.2010.57  0.499
2010 Gusfield D. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 17: 383-99. PMID 20377452 DOI: 10.1089/Cmb.2009.0200  0.422
2010 Frid Y, Gusfield D. A simple, practical and complete O(n3/log n)-time algorithm for RNA folding using the Four-Russians speedup. Algorithms For Molecular Biology : Amb. 5: 13. PMID 20047670 DOI: 10.1186/1748-7188-5-13  0.357
2009 Gusfield D, Wu Y. The Three-state Perfect Phylogeny Problem Reduces to 2-SAT Communications in Information and Systems. 9: 295-302. DOI: 10.4310/Cis.2009.V9.N4.A1  0.393
2008 Wu Y, Gusfield D. A new recombination lower bound and the minimum perfect phylogenetic forest problem Journal of Combinatorial Optimization. 16: 229-247. DOI: 10.1007/S10878-007-9129-6  0.413
2007 Gusfield D, Bansal V, Bafna V, Song YS. A decomposition theory for phylogenetic networks and incompatible characters. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 1247-72. PMID 18047426 DOI: 10.1089/Cmb.2006.0137  0.446
2007 Song YS, Ding Z, Gusfield D, Langley CH, Wu Y. Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 1273-86. PMID 18047424 DOI: 10.1089/Cmb.2007.0096  0.407
2007 Wu Y, Gusfield D. Efficient computation of minimum recombination with genotypes (not haplotypes). Journal of Bioinformatics and Computational Biology. 5: 181-200. PMID 17589959 DOI: 10.1142/S0219720007002631  0.344
2007 Gusfield D, Hickerson D, Eddhu S. An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study Discrete Applied Mathematics. 155: 806-830. DOI: 10.1016/J.Dam.2005.05.044  0.424
2006 Ding Z, Filkov V, Gusfield D. A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 13: 522-53. PMID 16597255 DOI: 10.1089/Cmb.2006.13.522  0.444
2005 Song YS, Wu Y, Gusfield D. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Bioinformatics (Oxford, England). 21: i413-22. PMID 15961486 DOI: 10.1093/Bioinformatics/Bti1033  0.41
2005 Gusfield D. Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination Journal of Computer and System Sciences. 70: 381-398. DOI: 10.1016/J.Jcss.2004.12.009  0.472
2004 Bafna V, Gusfield D, Hannenhalli S, Yooseph S. A note on efficient computation of haplotypes via perfect phylogeny. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 858-66. PMID 15700406 DOI: 10.1089/Cmb.2004.11.858  0.396
2004 Gusfield D, Eddhu S, Langley C. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology. 2: 173-213. PMID 15272438 DOI: 10.1142/S0219720004000521  0.458
2004 Gusfield D, Eddhu S, Langley C. The fine structure of galls in phylogenetic networks Informs Journal On Computing. 16: 459-469. DOI: 10.1287/Ijoc.1040.0099  0.416
2004 Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string Journal of Computer and System Sciences. 69: 525-546. DOI: 10.1016/J.Jcss.2004.03.004  0.354
2003 Piccolboni A, Gusfield D. On the complexity of fundamental computational problems in pedigree analysis. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 10: 763-73. PMID 14633398 DOI: 10.1089/106652703322539088  0.376
2003 Bafna V, Gusfield D, Lancia G, Yooseph S. Haplotyping as perfect phylogeny: a direct approach. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 10: 323-40. PMID 12935331 DOI: 10.1089/10665270360688048  0.468
2002 Stoye J, Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree Theoretical Computer Science. 270: 843-856. DOI: 10.1016/S0304-3975(01)00121-9  0.397
2002 Gusfield D. Partition-distance: A problem and class of perfect graphs arising in clustering Information Processing Letters. 82: 159-164. DOI: 10.1016/S0020-0190(01)00263-0  0.357
2002 Gusfield D, Martel C. The structure and complexity of sports elimination numbers Algorithmica (New York). 32: 73-86. DOI: 10.1007/S00453-001-0074-Y  0.402
2001 Gusfield D. Inference of haplotypes from samples of diploid populations: Complexity and algorithms Journal of Computational Biology. 8: 305-323. PMID 11535178 DOI: 10.1089/10665270152530863  0.368
2000 Wang L, Jiang T, Gusfield D. A more efficient approximation scheme for tree alignment Siam Journal On Computing. 30: 283-299. DOI: 10.1137/S0097539796313507  0.405
1999 Holmes SP, Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology Journal of the American Statistical Association. 94: 989. DOI: 10.2307/2670026  0.393
1998 Wang L, Gusfield D. Constructing additive trees when the error is small Journal of Computational Biology. 5: 127-133. PMID 9541876 DOI: 10.1089/Cmb.1998.5.127  0.348
1998 Kececioglu J, Gusfield D. Reconstructing a history of recombinations from a set of sequences Discrete Applied Mathematics. 88: 239-260. DOI: 10.1016/S0166-218X(98)00074-2  0.38
1998 Gusfield D, Karp R, Wang L, Stelling P. Graph traversals, genes and matroids: An efficient case of the travelling salesman problem Discrete Applied Mathematics. 88: 167-180. DOI: 10.1016/S0166-218X(98)00071-7  0.436
1997 Naor D, Gusfield D, Martel C. A Fast Algorithm for Optimally Increasing the Edge Connectivity Siam Journal On Computing. 26: 1139-1165. DOI: 10.1137/S0097539792234226  0.448
1997 Wang L, Gusfield D. Improved Approximation Algorithms for Tree Alignment Journal of Algorithms. 25: 255-273. DOI: 10.1006/Jagm.1997.0882  0.436
1994 Gusfield D. Faster implementation of a shortest superstring approximation Information Processing Letters. 51: 271-274. DOI: 10.1016/0020-0190(94)00097-2  0.425
1994 Gusfield D, Tardos E. A faster parametric minimum-cut algorithm Algorithmica. 11: 278-290. DOI: 10.1007/Bf01240737  0.405
1993 Gusfield D. Efficient methods for multiple sequence alignment with guaranteed error bounds Bulletin of Mathematical Biology. 55: 141-154. PMID 7680269 DOI: 10.1007/Bf02460299  0.358
1993 Kao M, Gusfield D. Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test Siam Journal On Discrete Mathematics. 6: 460-476. DOI: 10.1137/0406037  0.381
1993 Gusfield D, Naor D. Extracting maximal information about sets of minimum cuts Algorithmica. 10: 64-89. DOI: 10.1007/Bf01908632  0.379
1992 Gusfield D, M. Landau G, Schieber B. An efficient algorithm for the All Pairs Suffix-Prefix Problem Information Processing Letters. 41: 181-185. DOI: 10.1016/0020-0190(92)90176-V  0.374
1992 Gusfield D, Pitt L. A bounded approximation for the minimum cost 2-sat problem Algorithmica. 8: 103-117. DOI: 10.1007/Bf01758838  0.451
1992 Gusfield D, Martel C. A fast algorithm for the generalized parametric minimum cut problem and applications Algorithmica. 7: 499-519. DOI: 10.1007/Bf01758775  0.445
1991 Gusfield D. Computing the Strength of a Graph Siam Journal On Computing. 20: 639-654. DOI: 10.1137/0220040  0.406
1991 Gusfield D, Naor D. Efficient algorithms for generalized cut-trees Networks. 21: 505-520. DOI: 10.1002/Net.3230210503  0.419
1991 Gusfield D. Efficient algorithms for inferring evolutionary trees Networks. 21: 19-28. DOI: 10.1002/Net.3230210104  0.468
1990 Gusfield D. Very Simple Methods for All Pairs Network Flow Analysis Siam Journal On Computing. 19: 143-155. DOI: 10.1137/0219009  0.378
1989 Gusfield D. Efficient solution of the matroid product problem Operations Research Letters. 8: 257-259. DOI: 10.1016/0167-6377(89)90050-3  0.356
1989 Gusfield D, Irving RW. Parametric stable marriage and minimum cuts Information Processing Letters. 30: 255-259. DOI: 10.1016/0020-0190(89)90204-4  0.385
1989 Martel CU, Gusfield D. A fast parallel quicksort algorithm Information Processing Letters. 30: 97-102. DOI: 10.1016/0020-0190(89)90116-6  0.366
1988 Gusfield D. The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments Siam Journal On Computing. 17: 742-769. DOI: 10.1137/0217048  0.456
1988 Gusfield D. A Graph Theoretic Approach to Statistical Data Security Siam Journal On Computing. 17: 552-571. DOI: 10.1137/0217034  0.408
1987 Irving RW, Leather P, Gusfield D. An efficient algorithm for the “optimal” stable marriage Journal of the Acm (Jacm). 34: 532-543. DOI: 10.1145/28869.28871  0.415
1987 Gusfield D. Optimal Mixed Graph Augmentation Siam Journal On Computing. 16: 599-612. DOI: 10.1137/0216041  0.441
1987 Gusfield D, Martel C, Fernandez-Baca D. Fast Algorithms for Bipartite Network Flow Siam Journal On Computing. 16: 237-251. DOI: 10.1137/0216020  0.388
1987 Gusfield D. Three Fast Algorithms for Four Problems in Stable Marriage Siam Journal On Computing. 16: 111-128. DOI: 10.1137/0216010  0.415
1986 Gusfield D, Pitt L. Equivalent approximation algorithms for node cover Information Processing Letters. 22: 291-294. DOI: 10.1016/0020-0190(86)90068-2  0.336
1985 Gusfield D. Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85 Networks. 15: 137-138. DOI: 10.1002/Net.3230150111  0.313
1984 Gusfield D. Bounds for naive multiple machine scheduling with release times and deadlines Journal of Algorithms. 5: 1-6. DOI: 10.1016/0196-6774(84)90035-X  0.353
1984 Gusfield D. Matroid optimization with the interleaving of two ordered sets Discrete Applied Mathematics. 8: 41-50. DOI: 10.1016/0166-218X(84)90077-5  0.324
1983 Gusfield D. Parametric Combinatorial Computing and a Problem of Program Module Distribution Journal of the Acm (Jacm). 30: 551-563. DOI: 10.1145/2402.322391  0.389
1983 Gusfield D. Simple Constructions for Multiterminal Network Flow Synthesis Siam Journal On Computing. 12: 157-165. DOI: 10.1137/0212010  0.385
1983 Gusfield D. Connectivity and edge-disjoint spanning trees Information Processing Letters. 16: 87-89. DOI: 10.1016/0020-0190(83)90031-5  0.32
1983 Gusfield D. A note on Arc tolerances in sparse shortest-path and network flow problems Networks. 13: 191-196. DOI: 10.1002/Net.3230130204  0.356
Show low-probability matches.