Dan Gusfield
#49,390
Most Influential Person Now
American Computational Biologist
Dan Gusfield's AcademicInfluence.com Rankings
Dan Gusfieldcomputer-science Degrees
Computer Science
#2763
World Rank
#2891
Historical Rank
Database
#1936
World Rank
#2031
Historical Rank
Dan Gusfieldbiology Degrees
Biology
#2685
World Rank
#4236
Historical Rank
Computational Biology
#51
World Rank
#51
Historical Rank
Bioinformatics
#60
World Rank
#61
Historical Rank
Download Badge
Computer Science Biology
Dan Gusfield's Degrees
- PhD Computer Science Stanford University
- Bachelors Mathematics Stanford University
Similar Degrees You Can Earn
Why Is Dan Gusfield Influential?
(Suggest an Edit or Addition)According to Wikipedia, Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Dan Gusfield's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology (1997) (4163)
- Algorithms on strings, trees, and sequences (1997) (1966)
- The Stable marriage problem - structure and algorithms (1989) (1168)
- Efficient algorithms for inferring evolutionary trees (1991) (376)
- An efficient algorithm for the “optimal” stable marriage (1987) (284)
- Haplotyping as perfect phylogeny: conceptual framework and efficient solutions (2002) (224)
- Efficient methods for multiple sequence alignment with guaranteed error bounds (1993) (221)
- Haplotype Inference by Pure Parsimony (2003) (218)
- Algorithms on Strings, Trees, and Sequences: Contents (1997) (203)
- Very Simple Methods for All Pairs Network Flow Analysis (1990) (189)
- Three Fast Algorithms for Four Problems in Stable Marriage (1987) (189)
- Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination (2004) (188)
- Partition-distance: A problem and class of perfect graphs arising in clustering (2002) (176)
- Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms (2001) (172)
- Linear time algorithms for finding and representing all the tandem repeats in a string (2004) (163)
- Haplotyping as Perfect Phylogeny: A Direct Approach (2003) (132)
- Connectivity and Edge-Disjoint Spanning Trees (1983) (131)
- Parametric optimization of sequence alignment (1992) (121)
- A fast algorithm for optimally increasing the edge-connectivity (1990) (117)
- Simple and flexible detection of contiguous repeats using a suffix tree (1998) (116)
- Algorithms on strings (1997) (107)
- ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks (2014) (106)
- A Graph Theoretic Approach to Statistical Data Security (1988) (102)
- Efficient reconstruction of phylogenetic networks with constrained recombination (2003) (95)
- A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem (2005) (82)
- A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters (2005) (79)
- An Efficient Algorithm for the All Pairs Suffix-Prefix Problem (1992) (79)
- Parametric Combinatorial Computing and a Problem of Program Module Distribution (1983) (78)
- Improved Approximation Algorithms for Tree Alignment (1996) (74)
- The Fine Structure of Galls in Phylogenetic Networks (2004) (74)
- Reconstructing a history of recombinations from a set of sequences (1994) (71)
- Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology (1997) (68)
- Fast Algorithms for Bipartite Network Flow (1987) (62)
- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data (2007) (60)
- An Overview of Combinatorial Methods for Haplotype Inference (2002) (58)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (2005) (55)
- Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution (2005) (54)
- A more efficient approximation scheme for tree alignment (1997) (53)
- Algorithms in Bioinformatics (2002) (51)
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments (1988) (49)
- Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines (1984) (48)
- String barcoding: uncovering optimal virus signatures (2002) (46)
- A Decomposition Theory for Phylogenetic Networks and Incompatible Characters (2007) (45)
- Sensitivity analysis for combinatorial optimization (1980) (44)
- Analysis and exploration of the use of rule-based algorithms and consensus methods for the inferral of haplotypes. (2003) (43)
- The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory (2009) (42)
- A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations (2000) (41)
- Parametric and inverse-parametric sequence alignment with XPARAL. (1996) (37)
- Untangling Tanglegrams: Comparing Trees by Their Drawings (2009) (37)
- Perfect phylogeny haplotyper: haplotype inferral using a tree model (2003) (36)
- A bounded approximation for the minimum cost 2-sat problem (1992) (36)
- A Note on Efficient Computation of Haplotypes via Perfect Phylogeny (2004) (36)
- Computing the Strength of a Graph (1991) (36)
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study (2007) (35)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (1987) (34)
- The Structure and Complexity of Sports Elimination Numbers (2001) (33)
- Optimal Mixed Graph Augmentation (1987) (32)
- On the Complexity of Fundamental Computational Problems in Pedigree Analysis (2003) (32)
- Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event (2005) (28)
- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations (2006) (27)
- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers (2003) (24)
- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants (2007) (24)
- A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup (2010) (23)
- A fast algorithm for the generalized parametric minimum cut problem and applications (1992) (23)
- A note on Arc tolerances in sparse shortest-path and network flow problems (1983) (21)
- Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test (1993) (21)
- A simple, practical and complete O(n³/log n)-time algorithm for RNA folding using the four-Russians speedup (2009) (19)
- Efficient algorithms for generalized cut trees (1991) (19)
- Faster algorithms for RNA-folding using the Four-Russians method (2013) (18)
- A Fast Parallel Quicksort Algorithm (1989) (18)
- Algorithms on Strings, Trees, and Sequences: Multiple String Comparison – The Holy Grail (1997) (16)
- A faster parametric minimum-cut algorithm (1994) (16)
- Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters (2009) (16)
- Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem (1998) (15)
- Extracting maximal information about sets of minimum cuts (1993) (14)
- Integer Linear Programming in Computational and Systems Biology (2019) (14)
- A little knowledge goes a long way: faster detection of compromised data in 2-D tables (1990) (12)
- Faster Implementation of a Shortest Superstring Approximation (1994) (12)
- A new recombination lower bound and the minimum perfect phylogenetic forest problem (2007) (12)
- Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem (2011) (12)
- Proceedings of the eighth annual international conference on Research in computational molecular biology (2004) (12)
- Matroid optimization with the interleaving of two ordered sets (1984) (12)
- Persistent phylogeny: a galled-tree and integer linear programming approach (2015) (12)
- Suffix trees (and relatives) come of age in bioinformatics (2002) (11)
- An efficient algorithm for the 8.8`Optimal stable marriage (1987) (10)
- Parametric Stable Marriage and Minimum Cuts (1989) (9)
- Introduction to the IEEE/ACM Transactions on Computational Biology and Bioinformatics (2004) (8)
- A Simple, Practical and Complete O(\fracn3 logn)O(\frac{n^3}{ \log n})-Time Algorithm for RNA Folding Using the Four-Russians Speedup (2009) (8)
- Constructing perfect phylogenies and proper triangulations for three-state characters (2011) (8)
- Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs (2012) (8)
- Simple Construction for Multi-Terminal Network Flow Synthesis (1983) (7)
- A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea (2010) (7)
- Algorithms on Strings, Trees, and Sequences: Linear-Time Construction of Suffix Trees (1997) (7)
- Algorithms on Strings, Trees, and Sequences: Introduction to Suffix Trees (1997) (7)
- Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data (2010) (6)
- New uses for uniform lifted alignments (1998) (6)
- Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters (2009) (6)
- Algorithms on Strings, Trees, and Sequences: More Applications of Suffix Trees (1997) (6)
- Equivalent Approximation Algorithms for Node Cover (1986) (6)
- Minimum Average Distance Clique Trees (2015) (6)
- Efficient computation of minimum recombination with genotypes (not haplotypes). (2007) (5)
- Neuroanatomical term generation and comparison between two terminologies (2003) (5)
- Algorithms on Strings, Trees, and Sequences: The Importance of (Sub)sequence Comparison in Molecular Biology (1997) (5)
- Book review: Potokovye Algoritmy (Flow Algorithms) by G. M. Adel''son-Vel''ski, E. A. Dinic, and A. V. Karzanov. (1990) (5)
- The Three-state Perfect Phylogeny Problem Reduces to 2-SAT (2009) (5)
- Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem (2010) (5)
- Constructing Additive Trees When the Error Is Small (1998) (4)
- Chapter 8 Design (with analysis) of efficient algorithms (1992) (4)
- Haplotyping as Perfect Phylogeny (2002) (4)
- Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method (2012) (4)
- Strings algorithms and machine learning applications for computational biology (1997) (4)
- Algorithms on Strings, Trees, and Sequences: First Applications of Suffix Trees (1997) (4)
- Algorithms on Strings, Trees, and Sequences: Extending the Core Problems (1997) (3)
- Triangulation heuristics for maximum character compatibility (2013) (3)
- Efficient Computation of Minimum Recombination with genotypes (not Haplotypes) (2007) (3)
- State of the Journal (2007) (3)
- A Resolution of the Static Formulation Question for the Problem of Computing the History Bound (2017) (2)
- Algorithms on Strings, Trees, and Sequences: Three Short Topics (1997) (2)
- Analytical and Algorithmic Methods for Haplotype Frequency Inference: What do they Tell Us? (2007) (2)
- Construction, enumeration, and optimization of perfect phylogenies on multi-state data (2015) (2)
- Combinatorial Pattern Matching: 5th Annual Symposium, Cpm 94 Asilomar, Ca, Usa, June 5-8, 1994 : Proceedings (1994) (2)
- Final, Five-Year End, Editorial (2009) (2)
- Gödel for Goldilocks: A Rigorous, Streamlined Proof of (a variant of) Gödel's First Incompleteness Theorem (2014) (2)
- Algorithms on Strings, Trees, and Sequences: Core String Edits, Alignments, and Dynamic Programming (1997) (2)
- Editorial (2009) (2)
- Algorithms on Strings, Trees, and Sequences: Inexact Matching, Sequence Alignment, Dynamic Programming (1997) (2)
- Integer Linear Programming in Computational Biology: Overview of ILP, and New Results for Traveling Salesman Problems in Biology (2019) (2)
- Algorithms on Strings, Trees, and Sequences: Bibliography (1997) (2)
- Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem (1996) (2)
- An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs (2003) (2)
- An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding (2016) (2)
- Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology (2020) (1)
- RECOMB 2004 : proceedings of the eighth Annual International Conference on Research in Computational Molecular Biology, March 27-31, 2004, San Diego, California, USA (2004) (1)
- Algorithms on Strings, Trees, and Sequences: Preface (1997) (1)
- Algorithms on Strings, Trees, and Sequences: Strings and Evolutionary Trees (1997) (1)
- Tresholds for Sports Elimination Numbers Algorithms and Complexity (1999) (1)
- Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004 (2004) (1)
- Constructing perfect phylogenies and proper triangulations for three-state characters (2012) (1)
- CSE-2005 On the Full-Decomposition Optimality Conjecture for Phylogenetic Networks (2005) (1)
- Algorithms on Strings, Trees, and Sequences: Exact Matching: Classical Comparison-Based Methods (1997) (1)
- Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programming (2015) (1)
- Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85 (1985) (1)
- Algorithms on Strings, Trees, and Sequences: Epilogue – where next? (1997) (1)
- Faster algorithms for RNA-folding using the Four-Russians method (2014) (1)
- Combinatorial Approaches to Haplotype Inference (2002) (0)
- noToKosaze AJI ~ OPHTMM ( Flow Algorithms ) (1998) (0)
- Generalizing Tanglegrams (2018) (0)
- Phylogenetic networks with constrained and unconstrained recombination (2004) (0)
- Algorithms on Strings, Trees, and Sequences: Refining Core String Edits and Alignments (1997) (0)
- Algorithms on Strings, Trees, and Sequences: Exact Matching: A Deeper Look at Classical Methods (1997) (0)
- Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination (2004) (0)
- Algorithms on Strings, Trees, and Sequences: Models of Genome-Level Mutations (1997) (0)
- Editorial-State of the Transaction (2005) (0)
- Algorithms on Strings, Trees, and Sequences: Exact String Matching: The Fundamental String Problem (1997) (0)
- Algorithms on Strings, Trees, and Sequences: Sequence Databases and Their Uses – The Mother Lode (1997) (0)
- Algorithms on Strings, Trees, and Sequences: Constant-Time Lowest Common Ancestor Retrieval (1997) (0)
- Message from the Poster Chairs (2007) (0)
- State of the transaction [IEEE/ACM Transactions on Computational Biology and Bioinformatics] (2005) (0)
- Algorithms on Strings, Trees, and Sequences: Maps, Mapping, Sequencing, and Superstrings (1997) (0)
- Molecular Bioinformatics (Dagstuhl Seminar 9528) (1995) (0)
- Algorithms on Strings, Trees, and Sequences: Glossary (1997) (0)
- Introduction of New Associate Editors (2006) (0)
- An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding (2016) (0)
- Algorithms for inferring recombination and association mapping in populations (2007) (0)
- Guest Editors' Foreword (1999) (0)
- Algorithms on Strings, Trees, and Sequences: Exact Matching: Fundamental Preprocessing and First Algorithms (1997) (0)
- Efficient and Practical Algorithms for Deducing the History of Recombination in Populations : (Keynote Talk Abstract) (2006) (0)
- Hot Hands, Streaks and Coin-flips: Numerical Nonsense in the New York Times (2015) (0)
- The History Bound (on the number of recombinations needed) now has a static definition, but does it help? (2017) (0)
- Algorithms in bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002 : proceedings (2002) (0)
- Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized (2021) (0)
- Suffix Trees and Their Uses (1997) (0)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (2008) (0)
- Proceedings of the Second International Workshop on Algorithms in Bioinformatics (2002) (0)
- Proceedings of the 2002 Uc Davis Student Workshop on Computing Proceedings of the 2002 Uc Davis Student Workshop on Computing Program Committee: Faculty Advisor: Administrative Assistants: Mary Brown 2002 Uc Davis Student Workshop on Computing -visualization of Mulitdimensional, Multivariate Volume (2002) (0)
- Associate Editor Appreciation and Welcome (2007) (0)
- Introduction of New Associate Editors (2004) (0)
- Associate Editor Appreciation and Welcome (2007) (0)
- A Sparsified Four-Russian Algorithm for RNA Folding (2015) (0)
- Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics (2009) (0)
- Author Index (2002) (0)
- ISCB/SPRINGER series in computational biology (2014) (0)
- EIC Editorial (2008) (0)
- SPECIAL SECTION ON THE WORKSHOP ON ALGORITHMS IN BIOINFORMATICS 1 Guest Editorial: WABI Special Section Part II (2005) (0)
- Preface: Special RECOMB 2004 Issue (2005) (0)
- Efficient solution of the matroid product problem (1989) (0)
- 19th International Workshop on Algorithms in Bioinformatics, WABI 2019, September 8-10, 2019, Niagara Falls, NY, USA (2019) (0)
- 1 Haplotype Inference (2005) (0)
- Combinatorial Optimization in Computational Biology (2008) (0)
- Algorithms on Strings, Trees, and Sequences: Currents, Cousins, and Cameos (1997) (0)
- Algorithms on Strings, Trees, and Sequences: Seminumerical String Matching (1997) (0)
- Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background (2014) (0)
- Efficient algorithms and data structures in support of DNA mapping and sequence analysis. Progress report, February 1991--February 1992 (1992) (0)
- Efficient and Practical Algorithms for Deducing the History of Recombination in Populations (2006) (0)
- State of the Journal (2006) (0)
- Integer Linear Programming in Computational and Systems Biology: Tutorial (2019) (0)
This paper list is powered by the following services:
Other Resources About Dan Gusfield
What Schools Are Affiliated With Dan Gusfield?
Dan Gusfield is affiliated with the following schools:
