| Algorithms on stings, trees, and sequences: Computer science and computational biology D Gusfield Acm Sigact News 28 (4), 41-60, 1997 | 8115 | 1997 |
| The stable marriage problem: structure and algorithms D Gusfield, RW Irving MIT press, 1989 | 1524 | 1989 |
| Efficient algorithms for inferring evolutionary trees D Gusfield Networks 21 (1), 19-28, 1991 | 493 | 1991 |
| An efficient algorithm for the “optimal” stable marriage RW Irving, P Leather, D Gusfield Journal of the ACM (JACM) 34 (3), 532-543, 1987 | 365 | 1987 |
| Efficient methods for multiple sequence alignment with guaranteed error bounds D Gusfield Bulletin of mathematical biology 55 (1), 141-154, 1993 | 327 | 1993 |
| Haplotyping as perfect phylogeny: conceptual framework and efficient solutions D Gusfield Proceedings of the sixth annual international conference on Computational …, 2002 | 279 | 2002 |
| Haplotype inference by pure parsimony D Gusfield Annual symposium on combinatorial pattern matching, 144-155, 2003 | 245 | 2003 |
| Very simple methods for all pairs network flow analysis D Gusfield SIAM Journal on Computing 19 (1), 143-155, 1990 | 241 | 1990 |
| Three fast algorithms for four problems in stable marriage D Gusfield SIAM Journal on Computing 16 (1), 111-128, 1987 | 221 | 1987 |
| Inference of haplotypes from samples of diploid populations: complexity and algorithms D Gusfield Journal of computational biology 8 (3), 305-323, 2001 | 215 | 2001 |
| Partition-distance: A problem and class of perfect graphs arising in clustering D Gusfield Information Processing Letters 82 (3), 159-164, 2002 | 207 | 2002 |
| Optimal, efficient reconstruction of phylogenetic networks with constrained recombination D Gusfield, S Eddhu, C Langley Journal of bioinformatics and computational biology 2 (01), 173-213, 2004 | 200 | 2004 |
| Linear time algorithms for finding and representing all the tandem repeats in a string D Gusfield, J Stoye Journal of Computer and System Sciences 69 (4), 525-546, 2004 | 193* | 2004 |
| A fast algorithm for optimally increasing the edge connectivity D Naor, D Gusfield, C Martel SIAM Journal on Computing 26 (4), 1139-1165, 1997 | 185 | 1997 |
| Haplotyping as perfect phylogeny: A direct approach V Bafna, D Gusfield, G Lancia, S Yooseph Journal of Computational Biology 10 (3-4), 323-340, 2003 | 182 | 2003 |
| Connectivity and edge-disjoint spanning trees D Gusfield Information Processing Letters 16 (2), 87-89, 1983 | 164 | 1983 |
| ReCombinatorics: the algorithmics of ancestral recombination graphs and explicit phylogenetic networks D Gusfield MIT press, 2014 | 143 | 2014 |
| An overview of combinatorial methods for haplotype inference D Gusfield RECOMB Workshop on Computational Methods for SNPs and Haplotype Inference, 9-25, 2002 | 142* | 2002 |
| Parametric optimization of sequence alignment D Gusfield, K Balasubramanian, D Naor Algorithmica 12 (4), 312-326, 1994 | 142 | 1994 |
| A graph theoretic approach to statistical data security D Gusfield SIAM Journal on Computing 17 (3), 552-571, 1988 | 139 | 1988 |
