Dan Gusfield

发表

State of the Journal

Dan Gusfield, D. Gusfield, 2007, TCBB.

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

Jens Stoye, Dan Gusfield, J. Stoye, 2004, J. Comput. Syst. Sci..

Suffix trees (and relatives) come of age in bioinformatics

Dan Gusfield, 2002, Proceedings. IEEE Computer Society Bioinformatics Conference.

Constructing Additive Trees When the Error Is Small

Lusheng Wang, Dan Gusfield, D. Gusfield, 1998, J. Comput. Biol..

A simple, practical and complete O(n³/log n)-time algorithm for RNA folding using the four-Russians speedup

Dan Gusfield, Yelena Frid, D. Gusfield, 2009, WABI 2009.

The Stable marriage problem - structure and algorithms

Robert W. Irving, Dan Gusfield, D. Gusfield, 1989, Foundations of computing series.

Constructing perfect phylogenies and proper triangulations for three-state characters

Dan Gusfield, Rob Gysel, Fumei Lam, 2011, Algorithms for Molecular Biology.

The Structure and Complexity of Sports Elimination Numbers

Charles U. Martel, Dan Gusfield, D. Gusfield, 2001, Algorithmica.

Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

Dan Gusfield, D. Gusfield, 2005, J. Comput. Syst. Sci..

Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics

Dan Gusfield, D. Gusfield, 2009, TCBB.

A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations

Dan Gusfield, D. Gusfield, 2000, ISMB.

Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004

Philip E. Bourne, Dan Gusfield, D. Gusfield, 2004, RECOMB.

Introduction of New Associate Editors

Dan Gusfield, 2004, TCBB.

Computing the Strength of a Graph

Dan Gusfield, D. Gusfield, 1991, SIAM J. Comput..

A more efficient approximation scheme for tree alignment

Tao Jiang, Lusheng Wang, Dan Gusfield, 1997, RECOMB '97.

Haplotype Inference by Pure Parsimony

Dan Gusfield, D. Gusfield, 2003, CPM.

Matroid optimization with the interleaving of two ordered sets

Dan Gusfield, D. Gusfield, 1984, Discret. Appl. Math..

Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method

Dan Gusfield, Yelena Frid, D. Gusfield, 2012, COCOA.

Faster algorithms for RNA-folding using the Four-Russians method

Dan Gusfield, Yelena Frid, Balaji Venkatachalam, 2013, Algorithms for Molecular Biology.

The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

Dan Gusfield, D. Gusfield, 1988, SIAM J. Comput..

Final, Five-Year End, Editorial

Dan Gusfield, D. Gusfield, 2009, TCBB.

An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding

Dan Gusfield, Yelena Frid, 2016, Algorithms for Molecular Biology.

Efficient algorithms for inferring evolutionary trees

Dan Gusfield, D. Gusfield, 1991, Networks.

An efficient algorithm for the “optimal” stable marriage

Robert W. Irving, Dan Gusfield, Paul Leather, 1987, JACM.

Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem

Lusheng Wang, Richard M. Karp, Dan Gusfield, 1998, Discret. Appl. Math..

A Decomposition Theory for Phylogenetic Networks and Incompatible Characters

Yun S. Song, Vineet Bafna, Dan Gusfield, 2007, J. Comput. Biol..

Parametric optimization of sequence alignment

Dan Gusfield, Dalit Naor, K. Balasubramanian, 1992, SODA '92.

Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants

Dan Gusfield, Yufeng Wu, D. Gusfield, 2007, CPM.

Strings algorithms and machine learning applications for computational biology

John Canny, Dan Gusfield, Paul Brice Horton, 1997 .

Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters

Dan Gusfield, Fumei Lam, Srinath Sridhar, 2009, SIAM J. Discret. Math..

Associate Editor Appreciation and Welcome

Dan Gusfield, D. Gusfield, 2007, TCBB.

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution

Yun S. Song, Dan Gusfield, Yufeng Wu, 2005, ISMB.

A new recombination lower bound and the minimum perfect phylogenetic forest problem

Dan Gusfield, Yufeng Wu, 2008, J. Comb. Optim..

Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem

Dan Gusfield, Rob Gysel, 2010, ISBRA.

A bounded approximation for the minimum cost 2-sat problem

Leonard Pitt, Dan Gusfield, L. Pitt, 1992, Algorithmica.

Algorithms on Strings, Trees, and Sequences: The Importance of (Sub)sequence Comparison in Molecular Biology

Dan Gusfield, D. Gusfield, 1997 .

An Efficient Algorithm for the All Pairs Suffix-Prefix Problem

Gad M. Landau, Baruch Schieber, Dan Gusfield, 1992, Inf. Process. Lett..

Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov)

Andrew V. Goldberg, Dan Gusfield, A. V. Goldberg, 1991, SIAM Rev..

Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

Dan Gusfield, 1997 .

Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data

Daniel G. Brown, Dan Gusfield, Yelena Frid, 2007, COCOON.

Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs

Dan Gusfield, Rob Gysel, Kristian Stevens, 2012, WABI.

Faster Implementation of a Shortest Superstring Approximation

Dan Gusfield, 1994, Inf. Process. Lett..

A fast algorithm for the generalized parametric minimum cut problem and applications

Charles U. Martel, Dan Gusfield, 2005, Algorithmica.

Simple Construction for Multi-Terminal Network Flow Synthesis

Dan Gusfield, 1983, SIAM J. Comput..

The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory

Dan Gusfield, D. Gusfield, 2009, RECOMB.

Algorithms on strings

Dan Gusfield, D. Gusfield, 1997 .

Algorithms in Bioinformatics

Dan Gusfield, Roderic Guigó, R. Guigó, 2002, Lecture Notes in Computer Science.

State of the Journal

Dan Gusfield, 2006, TCBB.

ISCB/SPRINGER series in computational biology

Thomas Lengauer, David Sankoff, Samuel Karlin, 2014, Bioinform..

Efficient Computation of Minimum Recombination with genotypes (not Haplotypes)

Dan Gusfield, Yufeng Wu, 2007, J. Bioinform. Comput. Biol..

The Fine Structure of Galls in Phylogenetic Networks

Dan Gusfield, Charles H. Langley, Satish Eddhu, 2004, INFORMS J. Comput..

A Note on Efficient Computation of Haplotypes via Perfect Phylogeny

Shibu Yooseph, Vineet Bafna, Dan Gusfield, 2004, J. Comput. Biol..

Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem

Lusheng Wang, Richard M. Karp, Dan Gusfield, 1996, CPM.

Chapter 8 Design (with analysis) of efficient algorithms

Dan Gusfield, D. Gusfield, 1992 .

A Fast Algorithm for Optimally Increasing the Edge Connectivity

Charles U. Martel, Dan Gusfield, Dalit Naor, 1997, SIAM J. Comput..

Editorial-State of the Transaction

Dan Gusfield, D. Gusfield, 2005, TCBB.

Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations

Yun S. Song, Dan Gusfield, Yufeng Wu, 2006, RECOMB.

Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology

Dan Gusfield, Lei Zuo, Hannah Brown, 2020, AlCoB.

Parametric Combinatorial Computing and a Problem of Program Module Distribution

Dan Gusfield, D. Gusfield, 1983, JACM.

Associate Editor Appreciation and Welcome

Dan Gusfield, D. Gusfield, 2007, TCBB.

New uses for uniform lifted alignments

Lusheng Wang, Dan Gusfield, 1998, Mathematical Support for Molecular Biology.

Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem

Dan Gusfield, Rob Gysel, D. Gusfield, 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea

Dan Gusfield, Yelena Frid, D. Gusfield, 2010, WABI.

Gödel for Goldilocks: A Rigorous, Streamlined Proof of (a variant of) Gödel's First Incompleteness Theorem

Dan Gusfield, 2014 .

A note on Arc tolerances in sparse shortest-path and network flow problems

Dan Gusfield, D. Gusfield, 1983, Networks.

The Three-state Perfect Phylogeny Problem Reduces to 2-SAT

Dan Gusfield, Yufeng Wu, 2009, Commun. Inf. Syst..

Final, Five-Year End, Editorial

Dan Gusfield, 2009, TCBB.

Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters

Dan Gusfield, Rob Gysel, Fumei Lam, 2011, WABI.

Haplotyping as perfect phylogeny: conceptual framework and efficient solutions

Dan Gusfield, D. Gusfield, 2002, RECOMB '02.

A Sparsified Four-Russian Algorithm for RNA Folding

Dan Gusfield, Yelena Frid, D. Gusfield, 2015, WABI.

Suffix Trees and Their Uses

Dan Gusfield, D. Gusfield, 1997 .

19th International Workshop on Algorithms in Bioinformatics, WABI 2019, September 8-10, 2019, Niagara Falls, NY, USA

Katharina T. Huber, Dan Gusfield, Jesper Jansson, 2019, WABI.

A little knowledge goes a long way: faster detection of compromised data in 2-D tables

Dan Gusfield, D. Gusfield, 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

Connectivity and Edge-Disjoint Spanning Trees

Dan Gusfield, D. Gusfield, 1983, Information Processing Letters.

Algorithms on Strings, Trees, and Sequences: Glossary

Dan Gusfield, D. Gusfield, 1997 .

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

Dan Gusfield, D. Gusfield, 2002, Inf. Process. Lett..

Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers

Dan Gusfield, Ren Hua Chung, 2003, COCOON.

Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms

Dan Gusfield, D. Gusfield, 2001, J. Comput. Biol..

Introduction of New Associate Editors

Dan Gusfield, D. Gusfield, 2004, TCBB.

A Simple, Practical and Complete O(\fracn3 logn)O(\frac{n^3}{ \log n})-Time Algorithm for RNA Folding Using the Four-Russians Speedup

Dan Gusfield, Yelena Frid, D. Gusfield, 2009, WABI.

Algorithms on Strings, Trees, and Sequences: Three Short Topics

Dan Gusfield, D. Gusfield, 1997 .

A faster parametric minimum-cut algorithm

Éva Tardos, Dan Gusfield, D. Gusfield, 1994, Algorithmica.

Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data

Dan Gusfield, Kristian Stevens, 2010, WABI.

Untangling Tanglegrams: Comparing Trees by Their Drawings

Katherine St. John, Dan Gusfield, Balaji Venkatachalam, 2009, ISBRA.

Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event

Yun S. Song, Dan Gusfield, Yufeng Wu, 2005, WABI.

Equivalent Approximation Algorithms for Node Cover

Leonard Pitt, Dan Gusfield, L. Pitt, 1986, Inf. Process. Lett..

Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology

Dan Gusfield, 1997, SIGACT News.

Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85

Dan Gusfield, 1985, Networks.

Simple and flexible detection of contiguous repeats using a suffix tree

Jens Stoye, Dan Gusfield, J. Stoye, 1998, Theor. Comput. Sci..

Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters

Dan Gusfield, Fumei Lam, Srinath Sridhar, 2009, WABI.

Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

Michael E. Saks, Robert W. Irving, Dan Gusfield, 1987, J. Comb. Theory, Ser. A.

Algorithms on Strings, Trees, and Sequences: Bibliography

Dan Gusfield, D. Gusfield, 1997 .

Untangling Tanglegrams: Comparing Trees by Their Drawings

Katherine St. John, Dan Gusfield, Balaji Venkatachalam, 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Haplotyping as Perfect Phylogeny: A Direct Approach

Shibu Yooseph, Giuseppe Lancia, Vineet Bafna, 2003, J. Comput. Biol..

Algorithms on Strings, Trees, and Sequences: Contents

Dan Gusfield, D. Gusfield, 1997 .

Efficient algorithms for generalized cut trees

Dan Gusfield, Dalit Naor, D. Gusfield, 1991, SODA '90.

Extracting maximal information about sets of minimum cuts

Dan Gusfield, Dalit Naor, D. Gusfield, 1993, Algorithmica.

Efficient and Practical Algorithms for Deducing the History of Recombination in Populations

Dan Gusfield, 2006, International Conference on Computational Science.

ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations

Dan Gusfield, 2008, CPM.

A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem

Dan Gusfield, Yufeng Wu, 2007, COCOON.

Algorithms on Strings, Trees, and Sequences: Epilogue – where next?

Dan Gusfield, 1997 .

A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup

Dan Gusfield, Yelena Frid, D. Gusfield, 2010, Algorithms for Molecular Biology.

Parametric Stable Marriage and Minimum Cuts

Robert W. Irving, Dan Gusfield, 1989, Inf. Process. Lett..

Tresholds for Sports Elimination Numbers Algorithms and Complexity

Charles U. Martel, Dan Gusfield, 1999, WADS.

Improved Approximation Algorithms for Tree Alignment

Lusheng Wang, Dan Gusfield, D. Gusfield, 1996, J. Algorithms.

Efficient and Practical Algorithms for Deducing the History of Recombination in Populations : (Keynote Talk Abstract)

Dan Gusfield, 2006 .

Faster Algorithms for RNA-Folding Using the Four-Russians Method

Dan Gusfield, Yelena Frid, Balaji Venkatachalam, 2013, WABI.

Algorithms on Strings, Trees, and Sequences: Suffix Trees and Their Uses

Dan Gusfield, 1997 .

Guest Editors' Foreword

Ming-Yang Kao, Dan Gusfield, 1999, Algorithmica.

Optimal Mixed Graph Augmentation

Dan Gusfield, D. Gusfield, 1987, SIAM J. Comput..

A More Efficient Approximation Scheme for Tree Alignment

Tao Jiang, Lusheng Wang, Dan Gusfield, 2000, SIAM J. Comput..

Improved Approximation Algorithms for Tree Alignment

Lusheng Wang, Dan Gusfield, 1996, CPM.

Dan Gusfield, Anna Tramontano, D. Gusfield, 2009, Bioinform..

Perfect phylogeny haplotyper: haplotype inferral using a tree model

Dan Gusfield, Ren Hua Chung, D. Gusfield, 2003, Bioinform..

Introduction to the IEEE/ACM Transactions on Computational Biology and Bioinformatics

Dan Gusfield, 2004, TCBB.

Simple and flexible detection of contiguous repeats using a suffix tree

Jens Stoye, Dan Gusfield, 2002, Theor. Comput. Sci..

Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations

Yun S. Song, Dan Gusfield, Yufeng Wu, 2006, RECOMB.

A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem

Dan Gusfield, Vladimir Filkov, Zhihong Ding, 2005, RECOMB.

A fast algorithm for optimally increasing the edge-connectivity

Charles U. Martel, Dan Gusfield, Dalit Naor, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

String barcoding: uncovering optimal virus signatures

Dan Gusfield, Sam Rash, D. Gusfield, 2002, RECOMB '02.

Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines

Dan Gusfield, D. Gusfield, 1984, J. Algorithms.

Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

Dan Gusfield, D. Gusfield, 1997 .

An Overview of Combinatorial Methods for Haplotype Inference

Dan Gusfield, D. Gusfield, 2002, Computational Methods for SNPs and Haplotype Inference.

An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs

Dan Gusfield, 2003, ICTAI.

Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination

Dan Gusfield, 2004, German Conference on Bioinformatics.

A Resolution of the Static Formulation Question for the Problem of Computing the History Bound

Steven Kelk, Dan Gusfield, Céline Scornavacca, 2017, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

A Fast Parallel Quicksort Algorithm

Charles U. Martel, Dan Gusfield, 1989, Inf. Process. Lett..

A Graph Theoretic Approach to Statistical Data Security

Dan Gusfield, D. Gusfield, 1988, SIAM J. Comput..

Algorithms on Strings, Trees, and Sequences: Preface

Dan Gusfield, 1997 .

Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test

Ming-Yang Kao, Dan Gusfield, D. Gusfield, 1993, SIAM J. Discret. Math..

Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

Dan Gusfield, D. Gusfield, 1997 .

A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem

Dan Gusfield, Vladimir Filkov, Zhihong Ding, 2005, RECOMB.

State of the Journal

Dan Gusfield, D. Gusfield, 2006, TCBB.

Efficient algorithms and data structures in support of DNA mapping and sequence analysis. Progress report, February 1991--February 1992

Dan Gusfield, Dalit Naor, E. L. Lawler, 1992 .

Associate Editor Appreciation and Welcome

Dan Gusfield, D. Gusfield, 2007, TCBB.

Very Simple Methods for All Pairs Network Flow Analysis

Dan Gusfield, D. Gusfield, 1990, SIAM J. Comput..

Minimum Average Distance Clique Trees

Dan Gusfield, Rob Gysel, Shou-Jun Xu, 2015, SIAM J. Discret. Math..

Persistent phylogeny: a galled-tree and integer linear programming approach

Dan Gusfield, D. Gusfield, 2015, BCB.

Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programming

Dan Gusfield, Rasmus Nielsen, R. Nielsen, 2015, WABI.

Fast Algorithms for Bipartite Network Flow

Charles U. Martel, David Fernández-Baca, Dan Gusfield, 1987, SIAM J. Comput..

Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

Dan Gusfield, Charles H. Langley, Satish Eddhu, 2004, J. Bioinform. Comput. Biol..

Reconstructing a history of recombinations from a set of sequences

John D. Kececioglu, Dan Gusfield, D. Gusfield, 1994, SODA '94.

Efficient reconstruction of phylogenetic networks with constrained recombination

Dan Gusfield, Charles H. Langley, Satish Eddhu, 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

Integer Linear Programming in Computational and Systems Biology: Tutorial

Dan Gusfield, 2019, BCB.

Proceedings of the Second International Workshop on Algorithms in Bioinformatics

Dan Gusfield, Roderic Guigó, 2002 .

An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study

Dan Gusfield, Satish Eddhu, Dean Hickerson, 2007, Discret. Appl. Math..

The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory

Dan Gusfield, 2010, J. Comput. Biol..

Three Fast Algorithms for Four Problems in Stable Marriage

Dan Gusfield, D. Gusfield, 1987, SIAM J. Comput..

Preface: Special RECOMB 2004 Issue

Dan Gusfield, 2005, J. Comput. Biol..

Dan Gusfield, 2008, IEEE ACM Trans. Comput. Biol. Bioinform..

Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background pdf

Dan Gusfield, 2014, ArXiv.

Proceedings of the eighth annual international conference on Research in computational molecular biology

Philip E. Bourne, Dan Gusfield, D. Gusfield, 2004, RECOMB 2004.

Triangulation heuristics for maximum character compatibility

Dan Gusfield, Rob Gysel, Kristian Stevens, 2013, 2013 IEEE 3rd International Conference on Computational Advances in Bio and medical Sciences (ICCABS).

State of the transaction [IEEE/ACM Transactions on Computational Biology and Bioinformatics]

Dan Gusfield, 2005 .

A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters

Dan Gusfield, Vikas Bansal, V. Bansal, 2005, RECOMB.

On the Complexity of Fundamental Computational Problems in Pedigree Analysis

Dan Gusfield, Antonio Piccolboni, D. Gusfield, 2003, J. Comput. Biol..

Construction, enumeration, and optimization of perfect phylogenies on multi-state data

Dan Gusfield, Kristian Stevens, Michael Coulombe, 2015, 2015 IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS).

Molecular Bioinformatics (Dagstuhl Seminar 9528)

Thomas Lengauer, Dan Gusfield, Chris Sander, 1995 .

Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized pdf

Dan Gusfield, Thong Le, 2021, ArXiv.

Algorithms on Strings, Trees, and Sequences: Strings and Evolutionary Trees

Dan Gusfield, D. Gusfield, 1997 .

Algorithms on Strings, Trees, and Sequences: Inexact Matching, Sequence Alignment, Dynamic Programming

Dan Gusfield, 1997 .

Algorithms on Strings, Trees, and Sequences: First Applications of Suffix Trees

Dan Gusfield, 1997 .

Efficient computation of minimum recombination with genotypes (not haplotypes).

Dan Gusfield, Yufeng Wu, 2007, Journal of bioinformatics and computational biology.

Algorithms on Strings, Trees, and Sequences: Core String Edits, Alignments, and Dynamic Programming

Dan Gusfield, D. Gusfield, 1997 .

Algorithms on Strings, Trees, and Sequences: Linear-Time Construction of Suffix Trees

Dan Gusfield, 1997 .

ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks

Dan Gusfield, D. Gusfield, 2014 .

Algorithms on Strings, Trees, and Sequences: Multiple String Comparison – The Holy Grail

Dan Gusfield, D. Gusfield, 1997 .

Haplotyping as Perfect Phylogeny

Shibu Yooseph, Giuseppe Lancia, Vineet Bafna, 2002, RECOMB 2002.

Algorithms on Strings, Trees, and Sequences: Extending the Core Problems

Dan Gusfield, D. Gusfield, 1997 .

An efficient algorithm for the 8.8`Optimal stable marriage

Robert W. Irving, Dan Gusfield, Paul Leather, 1987 .

Algorithms on Strings, Trees, and Sequences: More Applications of Suffix Trees

Dan Gusfield, 1997 .

RECOMB 2004 : proceedings of the eighth Annual International Conference on Research in Computational Molecular Biology, March 27-31, 2004, San Diego, California, USA

Dan Gusfield, 2004 .