Dan Gusfield

	2011
108		Rob Gysel, Fumei Lam, Dan Gusfield: Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters. WABI 2011: 104-115
107		Rob Gysel, Dan Gusfield: Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 912-917 (2011)
106		Fumei Lam, Dan Gusfield, Srinath Sridhar: Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters. SIAM J. Discrete Math. 25(3): 1144-1175 (2011)
	2010
105		Rob Gysel, Dan Gusfield: Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem. ISBRA 2010: 52-60
104		Yelena Frid, Dan Gusfield: A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea. WABI 2010: 1-12
103		Kristian Stevens, Dan Gusfield: Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. WABI 2010: 274-287
102		Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield: Untangling Tanglegrams: Comparing Trees by Their Drawings. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 588-597 (2010)
	2009
101		Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield: Untangling Tanglegrams: Comparing Trees by Their Drawings. ISBRA 2009: 88-99
100		Dan Gusfield: The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory. RECOMB 2009: 236-252
99		Fumei Lam, Dan Gusfield, Srinath Sridhar: Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters. WABI 2009: 206-219
98		Yelena Frid, Dan Gusfield: A Simple, Practical and Complete O(\fracn3 logn)O(\frac{n^3}{ \log n})-Time Algorithm for RNA Folding Using the Four-Russians Speedup. WABI 2009: 97-107
97		Dan Gusfield, Anna Tramontano: Editorial. Bioinformatics 25(12): (2009)
96		Dan Gusfield: Final, Five-Year End, Editorial. IEEE/ACM Trans. Comput. Biology Bioinform. 6(1): 1-2 (2009)
95		Dan Gusfield: Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics. IEEE/ACM Trans. Comput. Biology Bioinform. 6(1): 96 (2009)
	2008
94		Dan Gusfield: ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. CPM 2008: 1-2
93		Dan Gusfield: EIC Editorial. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 481 (2008)
92		Yufeng Wu, Dan Gusfield: A new recombination lower bound and the minimum perfect phylogenetic forest problem. J. Comb. Optim. 16(3): 229-247 (2008)
	2007
91		Yufeng Wu, Dan Gusfield: A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. COCOON 2007: 16-26
90		Dan Gusfield, Yelena Frid, Daniel G. Brown: Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. COCOON 2007: 51-64
89		Yufeng Wu, Dan Gusfield: Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. CPM 2007: 150-161
88		Dan Gusfield, Dean Hickerson, Satish Eddhu: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. Discrete Applied Mathematics 155(6-7): 806-830 (2007)
87		Dan Gusfield: State of the Journal. IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 1 (2007)
86		Dan Gusfield: Associate Editor Appreciation and Welcome. IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 2 (2007)
85		Dan Gusfield: Associate Editor Appreciation and Welcome. IEEE/ACM Trans. Comput. Biology Bioinform. 4(3): 321 (2007)
84		Yufeng Wu, Dan Gusfield: Efficient Computation of Minimum Recombination with genotypes (not Haplotypes). J. Bioinformatics and Computational Biology 5(2a): 181-200 (2007)
83		Dan Gusfield, Vikas Bansal, Vineet Bafna, Yun S. Song: A Decomposition Theory for Phylogenetic Networks and Incompatible Characters. Journal of Computational Biology 14(10): 1247-1272 (2007)
82		Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu: Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. Journal of Computational Biology 14(10): 1273-1286 (2007)
	2006
81		Dan Gusfield: Efficient and Practical Algorithms for Deducing the History of Recombination in Populations. International Conference on Computational Science (2) 2006: 618-619
80		Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu: Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. RECOMB 2006: 231-245
79		Dan Gusfield: State of the Journal. IEEE/ACM Trans. Comput. Biology Bioinform. 3(1): 1 (2006)
78		Dan Gusfield: Introduction of New Associate Editors. IEEE/ACM Trans. Comput. Biology Bioinform. 3(2): 97 (2006)
77		Zhihong Ding, Vladimir Filkov, Dan Gusfield: A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. Journal of Computational Biology 13(2): 522-553 (2006)
	2005
76		Yun S. Song, Yufeng Wu, Dan Gusfield: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. ISMB (Supplement of Bioinformatics) 2005: 413-422
75		Dan Gusfield, Vikas Bansal: A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. RECOMB 2005: 217-232
74		Zhihong Ding, Vladimir Filkov, Dan Gusfield: A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. RECOMB 2005: 585-600
73		Yun S. Song, Yufeng Wu, Dan Gusfield: Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. WABI 2005: 152-164
72		Dan Gusfield: Editorial-State of the Transaction. IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 39 (2005)
71		Dan Gusfield: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. J. Comput. Syst. Sci. 70(3): 381-398 (2005)
70		Dan Gusfield: Preface: Special RECOMB 2004 Issue. Journal of Computational Biology 12(6): 567-568 (2005)
	2004
69		Philip E. Bourne, Dan Gusfield: Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004 ACM 2004
68		Dan Gusfield: Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination. German Conference on Bioinformatics 2004: 1-2
67		Dan Gusfield: Introduction of New Associate Editors. IEEE/ACM Trans. Comput. Biology Bioinform. 1(3): 97 (2004)
66		Dan Gusfield, Satish Eddhu, Charles H. Langley: The Fine Structure of Galls in Phylogenetic Networks. INFORMS Journal on Computing 16(4): 459-469 (2004)
65		Dan Gusfield, Satish Eddhu, Charles H. Langley: Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. J. Bioinformatics and Computational Biology 2(1): 173-214 (2004)
64		Dan Gusfield, Jens Stoye: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4): 525-546 (2004)
63		Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, Shibu Yooseph: A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. Journal of Computational Biology 11(5): 858-866 (2004)
	2003
62		Ren Hua Chung, Dan Gusfield: Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. COCOON 2003: 5-19
61		Dan Gusfield: Haplotype Inference by Pure Parsimony. CPM 2003: 144-155
60		Dan Gusfield, Satish Eddhu, Charles H. Langley: Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. CSB 2003: 363-374
59		Dan Gusfield: An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs. ICTAI 2003
58		Ren Hua Chung, Dan Gusfield: Perfect phylogeny haplotyper: haplotype inferral using a tree model. Bioinformatics 19(6): 780-781 (2003)
57		Vineet Bafna, Dan Gusfield, Giuseppe Lancia, Shibu Yooseph: Haplotyping as Perfect Phylogeny: A Direct Approach. Journal of Computational Biology 10(3/4): 323-340 (2003)
56		Antonio Piccolboni, Dan Gusfield: On the Complexity of Fundamental Computational Problems in Pedigree Analysis. Journal of Computational Biology 10(5): 763-773 (2003)
	2002
55		Roderic Guigó, Dan Gusfield: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings Springer 2002
54		Dan Gusfield: Suffix Trees (and Relatives) Come of Age in Bioinformatics. CSB 2002: 3
53		Dan Gusfield: An Overview of Combinatorial Methods for Haplotype Inference. Computational Methods for SNPs and Haplotype Inference 2002: 9-25
52		Dan Gusfield: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. RECOMB 2002: 166-175
51		Sam Rash, Dan Gusfield: String barcoding: uncovering optimal virus signatures. RECOMB 2002: 254-261
50		Dan Gusfield, Charles U. Martel: The Structure and Complexity of Sports Elimination Numbers. Algorithmica 32(1): 73-86 (2002)
49		Dan Gusfield: Partition-distance: A problem and class of perfect graphs arising in clustering. Inf. Process. Lett. 82(3): 159-164 (2002)
48		Jens Stoye, Dan Gusfield: Simple and flexible detection of contiguous repeats using a suffix tree. Theor. Comput. Sci. 270(1-2): 843-856 (2002)
	2001
47		Dan Gusfield: Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. Journal of Computational Biology 8(3): 305-323 (2001)
	2000
46		Dan Gusfield: A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations. ISMB 2000: 183-189
45		Lusheng Wang, Tao Jiang, Dan Gusfield: A More Efficient Approximation Scheme for Tree Alignment. SIAM J. Comput. 30(1): 283-299 (2000)
	1999
44		Dan Gusfield, Charles U. Martel: Tresholds for Sports Elimination Numbers Algorithms and Complexity. WADS 1999: 330-341
43		Dan Gusfield, Ming-Yang Kao: Guest Editors' Foreword. Algorithmica 25(2-3): 141 (1999)
	1998
42		Jens Stoye, Dan Gusfield: Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). CPM 1998: 140-152
41		Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling: Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discrete Applied Mathematics 88(1-3): 167-180 (1998)
40		John D. Kececioglu, Dan Gusfield: Reconstructing a History of Recombinations From a Set of Sequences. Discrete Applied Mathematics 88(1-3): 239-260 (1998)
39		Lusheng Wang, Dan Gusfield: Constructing Additive Trees When the Error Is Small. Journal of Computational Biology 5(1): 137-134 (1998)
	1997
38		Dan Gusfield: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology Cambridge University Press 1997
37		Lusheng Wang, Tao Jiang, Dan Gusfield: A more efficient approximation scheme for tree alignment. RECOMB 1997: 310-319
36		Lusheng Wang, Dan Gusfield: Improved Approximation Algorithms for Tree Alignment. J. Algorithms 25(2): 255-273 (1997)
35		Dalit Naor, Dan Gusfield, Charles U. Martel: A Fast Algorithm for Optimally Increasing the Edge Connectivity. SIAM J. Comput. 26(4): 1139-1165 (1997)
34		Dan Gusfield: Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology. SIGACT News 28(4): 41-60 (1997)
	1996
33		Lusheng Wang, Dan Gusfield: Improved Approximation Algorithms for Tree Alignment. CPM 1996: 220-233
32		Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling: Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM 1996: 304-319
	1994
31		Maxime Crochemore, Dan Gusfield: Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings Springer 1994
30		John D. Kececioglu, Dan Gusfield: Reconstructing a History of Recombinations from a Set of Sequences. SODA 1994: 471-480
29		Dan Gusfield, Éva Tardos: A Faster Parametric Minimum-Cut Algorithm. Algorithmica 11(3): 278-290 (1994)
28		Dan Gusfield, K. Balasubramanian, Dalit Naor: Parametric Optimization of Sequence Alignment. Algorithmica 12(4/5): 312-326 (1994)
27		Dan Gusfield: Faster Implementation of a Shortest Superstring Approximation. Inf. Process. Lett. 51(5): 271-274 (1994)
	1993
26		Dan Gusfield, Dalit Naor: Extracting Maximal Information About Sets of Minimum Cuts. Algorithmica 10(1): 64-89 (1993)
25		Ming-Yang Kao, Dan Gusfield: Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. SIAM J. Discrete Math. 6(3): 460-476 (1993)
	1992
24		Dan Gusfield, K. Balasubramanian, Dalit Naor: Parametric Optimization of Sequence Alignment. SODA 1992: 432-439
23		Dan Gusfield, Charles U. Martel: A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. Algorithmica 7(5&6): 499-519 (1992)
22		Dan Gusfield, Leonard Pitt: A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica 8(2): 103-117 (1992)
21		Dan Gusfield, Gad M. Landau, Baruch Schieber: An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Inf. Process. Lett. 41(4): 181-185 (1992)
	1991
20		Dan Gusfield: Computing the Strength of a Graph. SIAM J. Comput. 20(4): 639-654 (1991)
	1990
19		Dalit Naor, Dan Gusfield, Charles U. Martel: A Fast Algorithm for Optimally Increasing the Edge-Connectivity FOCS 1990: 698-707
18		Dan Gusfield: A Little Knowledge Goes a Long Way: Faster Detection of Compromised Data in 2-D Tables. IEEE Symposium on Security and Privacy 1990: 86-94
17		Dan Gusfield, Dalit Naor: Efficient Algorithms for Generalized Cut Trees. SODA 1990: 422-433
16		Dan Gusfield: Very Simple Methods for All Pairs Network Flow Analysis. SIAM J. Comput. 19(1): 143-155 (1990)
	1989
15		Dan Gusfield, Robert W. Irving: The Stable marriage problem - structure and algorithms. MIT Press 1989: I-XVII, 1-240
14		Charles U. Martel, Dan Gusfield: A Fast Parallel Quicksort Algorithm. Inf. Process. Lett. 30(2): 97-102 (1989)
13		Dan Gusfield, Robert W. Irving: Parametric Stable Marriage and Minimum Cuts. Inf. Process. Lett. 30(5): 255-259 (1989)
	1988
12		Dan Gusfield: A Graph Theoretic Approach to Statistical Data Security. SIAM J. Comput. 17(3): 552-571 (1988)
11		Dan Gusfield: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments. SIAM J. Comput. 17(4): 742-769 (1988)
	1987
10		Robert W. Irving, Paul Leather, Dan Gusfield: An efficient algorithm for the ``optimal'' stable marriage. J. ACM 34(3): 532-543 (1987)
9		Dan Gusfield, Robert W. Irving, Paul Leather, Michael E. Saks: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. J. Comb. Theory, Ser. A 44(2): 304-309 (1987)
8		Dan Gusfield: Three Fast Algorithms for Four Problems in Stable Marriage. SIAM J. Comput. 16(1): 111-128 (1987)
7		Dan Gusfield, Charles U. Martel, David Fernández-Baca: Fast Algorithms for Bipartite Network Flow. SIAM J. Comput. 16(2): 237-251 (1987)
6		Dan Gusfield: Optimal Mixed Graph Augmentation. SIAM J. Comput. 16(4): 599-612 (1987)
	1986
5		Dan Gusfield, Leonard Pitt: Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. 22(6): 291-294 (1986)
	1984
4		Dan Gusfield: Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. J. Algorithms 5(1): 1-6 (1984)
	1983
3		Dan Gusfield: Connectivity and Edge-Disjoint Spanning Trees. Inf. Process. Lett. 16(2): 87-89 (1983)
2		Dan Gusfield: Parametric Combinatorial Computing and a Problem of Program Module Distribution J. ACM 30(3): 551-563 (1983)
1		Dan Gusfield: Simple Construction for Multi-Terminal Network Flow Synthesis. SIAM J. Comput. 12(1): 157-165 (1983)

Coauthor Index

1	Jim Apple	[101] [102]
2	Vineet Bafna	[57] [63] [83]
3	K. Balasubramanian	[24] [28]
4	Vikas Bansal	[75] [83]
5	Philip E. Bourne	[69]
6	Daniel G. Brown (Daniel Gregory Brown)	[90]
7	Ren Hua Chung	[58] [62]
8	Maxime Crochemore	[31]
9	Zhihong Ding	[74] [77] [80] [82]
10	Satish Eddhu	[60] [65] [66] [88]
11	David Fernández-Baca	[7]
12	Vladimir Filkov	[74] [77]
13	Yelena Frid	[90] [98] [104]
14	Roderic Guigó	[55]
15	Rob Gysel	[105] [107] [108]
16	Sridhar Hannenhalli	[63]
17	Dean Hickerson	[88]
18	Robert W. Irving	[9] [10] [13] [15]
19	Tao Jiang	[37] [45]
20	Katherine St. John	[101] [102]
21	Ming-Yang Kao	[25] [43]
22	Richard M. Karp	[32] [41]
23	John D. Kececioglu	[30] [40]
24	Fumei Lam	[99] [106] [108]
25	Giuseppe Lancia	[57]
26	Gad M. Landau	[21]
27	Charles H. Langley	[60] [65] [66] [80] [82]
28	Paul Leather	[9] [10]
29	Charles U. Martel	[7] [14] [19] [23] [35] [44] [50]
30	Dalit Naor	[17] [19] [24] [26] [28] [35]
31	Antonio Piccolboni	[56]
32	Leonard Pitt	[5] [22]
33	Sam Rash	[51]
34	Michael E. Saks (Michael Saks)	[9]
35	Baruch Schieber	[21]
36	Yun S. Song	[73] [76] [80] [82] [83]
37	Srinath Sridhar	[99] [106]
38	Paul Stelling	[32] [41]
39	Kristian Stevens	[103]
40	Jens Stoye	[42] [48] [64]
41	Éva Tardos	[29]
42	Anna Tramontano	[97]
43	Balaji Venkatachalam	[101] [102]
44	Lusheng Wang	[32] [33] [36] [37] [39] [41] [45]
45	Yufeng Wu	[73] [76] [80] [82] [84] [89] [91] [92]
46	Shibu Yooseph	[57] [63]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page