• Publications
  • Influence
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Part I. Exact String Matching: The Fundamental String Problem: 1. Exact matching: fundamental preprocessing and first algorithms 2. Exact matching: classical comparison-based methods 3. ExactExpand
  • 2,772
  • 151
  • Open Access
The Stable marriage problem - structure and algorithms
This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the design and analysis of efficient algorithms. It covers the most recentExpand
  • 666
  • 78
  • Open Access
Algorithms on strings, trees, and sequences
Linear-Time Construction of Suffix Trees We will present two methods for constructing suffix trees in detail, Ukkonen’s method and Weiner’s method. Weiner was the first to show that suffix trees canExpand
  • 1,667
  • 61
  • Open Access
Algorithms on strings
  • 255
  • 51
Haplotype Inference by Pure Parsimony
The next high-priority phase of human genomics will involve the development and use of a full Haplotype Map of the human genome [7]. A critical, perhaps dominating, problem in all such efforts is theExpand
  • 185
  • 34
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
  • D. Gusfield
  • Computer Science, Mathematics
  • RECOMB '02
  • 18 April 2002
The next high-priority phase of human genomics will involve the development of a full Haplotype Map of the human genome [12]. It will be used in large-scale screens of populations to associateExpand
  • 230
  • 29
  • Open Access
Efficient algorithms for inferring evolutionary trees
In this paper, we examine two related problems of inferring the evolutionary history of n objects, either from present characters of the objects or from several partial estimates of theirExpand
  • 378
  • 28
An efficient algorithm for the “optimal” stable marriage
In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order of preference. A stable matching is a complete matching of men andExpand
  • 224
  • 24
Three Fast Algorithms for Four Problems in Stable Marriage
  • D. Gusfield
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 February 1987
The stable marriage problem is a well-known problem of matching n men to n women to achieve a certain type of “stability;” the $O(n^2 )$ time Gale-Shapley [GS] algorithm for finding two particular,Expand
  • 149
  • 20
  • Open Access