World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
19965
World Ranking
5479
National Ranking
2501

Research.com Recognitions

  • 2017 - ACM Fellow For contributions to combinatorial optimization and to algorithmic computational biology
  • 2016 - Fellow of the International Society for Computational Biology
  • 2015 - IEEE Fellow For contributions to combinatorial optimization and computational biology

Overview

Dan Gusfield is affiliated with the University of California, Davis, in the United States. Their research spans multiple fields with a primary focus on biochemistry, genetics, molecular biology, and computer science.

The researcher has contributed to various subfields, including:

  • Genetics
  • Molecular Biology
  • Artificial Intelligence
  • Computer Graphics and Computer-Aided Design
  • Computational Theory and Mathematics

The main topics in their work cover a range of computational and biological themes such as:

  • Genome Rearrangement Algorithms
  • DNA and Biological Computing
  • Algorithms and Data Compression
  • Computational Geometry and Mesh Generation
  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Genomics and Phylogenetic Studies

One of Dan Gusfield's recent papers is titled Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized, published in 2021 in arXiv (Cornell University).

Their frequent coauthors include:

  • Hannah Brown
  • Lei Zuo
  • Thong Le

Dan Gusfield has a book publication with Cambridge University Press:

  • Proven Impossible, published in 2024

The researcher has been recognized with several awards:

  • ACM Fellow (2017) for contributions to combinatorial optimization and to algorithmic computational biology
  • Fellow of the International Society for Computational Biology (2016)
  • IEEE Fellow (2015) for contributions to combinatorial optimization and computational biology

Best Publications

  • Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology

    Dan Gusfield

  • Algorithms on strings, trees, and sequences

    Dan Gusfield

  • The Stable Marriage Problem: Structure and Algorithms

    Dan Gusfield;Robert W. Irving

  • Efficient algorithms for inferring evolutionary trees

    Dan Gusfield

  • An efficient algorithm for the “optimal” stable marriage

    Robert W. Irving;Paul Leather;Dan Gusfield

  • Efficient methods for multiple sequence alignment with guaranteed error bounds

    Dan Gusfield

  • Haplotyping as perfect phylogeny: conceptual framework and efficient solutions

    Dan Gusfield

  • A Fast Algorithm for Optimally Increasing the Edge Connectivity

    Dalit Naor;Dan Gusfield;Charles Martel

  • Very simple methods for all pairs network flow analysis

    Dan Gusfield

  • Haplotype inference by pure Parsimony

    Dan Gusfield

  • Inference of haplotypes from samples of diploid populations: complexity and algorithms.

    Dan Gusfield

  • Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology

    Susan P. Holmes;Dan Gusfield

  • Efficient methods for multiple sequence alignment with guaranteed error bounds

    Unknown

  • OPTIMAL, EFFICIENT RECONSTRUCTION OF PHYLOGENETIC NETWORKS WITH CONSTRAINED RECOMBINATION

    Dan Gusfield;Satish Eddhu;Charles H. Langley

  • Three fast algorithms for four problems in stable marriage

    Dan Gusfield

  • Partition-distance: A problem and class of perfect graphs arising in clustering

    Dan Gusfield

  • Haplotyping as Perfect Phylogeny: A Direct Approach

    Vineet Bafna;Dan Gusfield;Giuseppe Lancia;Shibu Yooseph

  • Connectivity and edge-disjoint spanning trees

    Dan Gusfield

  • Linear time algorithms for finding and representing all the tandem repeats in a string

    Dan Gusfield;Jens Stoye

  • Parametric optimization of sequence alignment

    D. Gusfield;K. Balasubramanian;D. Naor

  • Algorithms in Bioinformatics

    Roderic Guigó;Dan Gusfield

  • Algorithms in bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002 : proceedings

    Roderic Guigó;Dan Gusfield

Frequent Co-Authors

Lusheng Wang
Lusheng Wang City University of Hong Kong
Charles U. Martel
Charles U. Martel University of California, Davis
Robert W. Irving
Robert W. Irving University of Glasgow
Charles H. Langley
Charles H. Langley University of California, Davis
Jens Stoye
Jens Stoye Bielefeld University
Vineet Bafna
Vineet Bafna University of California, San Diego
Shibu Yooseph
Shibu Yooseph University of Central Florida
Roderic Guigó
Roderic Guigó Pompeu Fabra University
Maxime Crochemore
Maxime Crochemore King's College London
Richard M. Karp
Richard M. Karp University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens up a world of flexible online degree options and dynamic career pathways. Many students consider which programs align with the best college majors for the future to ensure strong job prospects in a rapidly evolving tech landscape.

For those interested in advancing quickly, some look for what is the easiest masters degree to pursue, striking a balance between skill building and manageable course loads.

Doctoral studies are also becoming more accessible. There are most affordable doctoral programs in computer science and related fields, helping reduce financial pressure for ambitious students.

Professionals looking for leadership roles in education technology may opt for edd online programs that offer fast-track pathways to advanced credentials, often entirely online. With so many choices, it’s essential to weigh program quality, career alignment, flexibility, and affordability.

Best Scientists Citing Dan Gusfield

Trending Scientists