Dan Gusfield - RankMe

138 papers A* 4A 1B 17C 13Misc 4Journal 82Unranked 15

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized. CoRR Thong Le, Dan Gusfield
2021	—	`conf`	Unified SAT-Solving for Hard Problems of Phylogenetic Network Construction. ICCABS Dan Gusfield, Hannah Brown
2020	—	`conf`	Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology. AlCoB Hannah Brown, Lei Zuo, Dan Gusfield
2019	C	`ed.`	19th International Workshop on Algorithms in Bioinformatics, WABI 2019, Niagara Falls, NY, USA, September 8-10, 2019 WABI Katharina T. Huber, Dan Gusfield
2019	—	`conf`	Integer Linear Programming in Computational and Systems Biology: Tutorial. BCB Dan Gusfield
2017	J	`jnl`	A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. IEEE ACM Trans. Comput. Biol. Bioinform. Julia Matsieva, Steven Kelk, Céline Scornavacca, Chris Whidden, Dan Gusfield
2016	J	`jnl`	An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding. Algorithms Mol. Biol. Yelena Frid, Dan Gusfield
2015	C	`conf`	A Sparsified Four-Russian Algorithm for RNA Folding. WABI Yelena Frid, Dan Gusfield
2015	C	`conf`	Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programming. WABI Dan Gusfield, Rasmus Nielsen
2015	—	`conf`	Construction, enumeration, and optimization of perfect phylogenies on multi-state data. ICCABS Michael J. Coulombe, Kristian Stevens, Dan Gusfield
2015	J	`jnl`	Minimum Average Distance Clique Trees. SIAM J. Discret. Math. Shou-Jun Xu, Rob Gysel, Dan Gusfield
2015	—	`conf`	Persistent phylogeny: a galled-tree and integer linear programming approach. BCB Dan Gusfield
2014	J	`jnl`	Faster algorithms for RNA-folding using the Four-Russians method. Algorithms Mol. Biol. Balaji Venkatachalam, Dan Gusfield, Yelena Frid
2014	J	`jnl`	Gödel for Goldilocks: A Rigorous, Streamlined Proof of Gödel's First Incompleteness Theorem, Requiring Minimal Background. CoRR Dan Gusfield
2013	C	`conf`	Faster Algorithms for RNA-Folding Using the Four-Russians Method. WABI Balaji Venkatachalam, Dan Gusfield, Yelena Frid
2013	J	`jnl`	Faster Algorithms for RNA-folding using the Four-Russians method. CoRR Balaji Venkatachalam, Dan Gusfield, Yelena Frid
2013	—	`conf`	Triangulation heuristics for maximum character compatibility. ICCABS Rob Gysel, Dan Gusfield, Kristian Stevens
2012	J	`jnl`	Constructing perfect phylogenies and proper triangulations for three-state characters. Algorithms Mol. Biol. Rob Gysel, Fumei Lam, Dan Gusfield
2012	C	`conf`	Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs. WABI Rob Gysel, Kristian Stevens, Dan Gusfield
2012	C	`conf`	Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method. COCOA Yelena Frid, Dan Gusfield
2011	C	`conf`	Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters. WABI Rob Gysel, Fumei Lam, Dan Gusfield
2011	J	`jnl`	Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem. IEEE ACM Trans. Comput. Biol. Bioinform. Rob Gysel, Dan Gusfield
2011	J	`jnl`	Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters. SIAM J. Discret. Math. Fumei Lam, Dan Gusfield, Srinath Sridhar
2010	C	`conf`	A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the WABI Yelena Frid, Dan Gusfield
2010	J	`jnl`	A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup. Algorithms Mol. Biol. Yelena Frid, Dan Gusfield
2010	—	`conf`	Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem. ISBRA Rob Gysel, Dan Gusfield
2010	C	`conf`	Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. WABI Kristian Stevens, Dan Gusfield
2010	J	`jnl`	The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory. J. Comput. Biol. Dan Gusfield
2010	J	`jnl`	Untangling Tanglegrams: Comparing Trees by Their Drawings. IEEE ACM Trans. Comput. Biol. Bioinform. Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield
2009	C	`conf`	A Simple, Practical and Complete WABI Yelena Frid, Dan Gusfield
2009	J	`jnl`	Editorial. Bioinform. Dan Gusfield, Anna Tramontano
2009	J	`jnl`	Final, Five-Year End, Editorial. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2009	C	`conf`	Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters. WABI Fumei Lam, Dan Gusfield, Srinath Sridhar
2009	J	`jnl`	Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2009	B	`conf`	The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory. RECOMB Dan Gusfield
2009	J	`jnl`	The Three-state Perfect Phylogeny Problem Reduces to 2-SAT. Commun. Inf. Syst. Dan Gusfield, Yufeng Wu
2009	—	`conf`	Untangling Tanglegrams: Comparing Trees by Their Drawings. ISBRA Balaji Venkatachalam, Jim Apple, Katherine St. John, Dan Gusfield
2008	J	`jnl`	A new recombination lower bound and the minimum perfect phylogenetic forest problem. J. Comb. Optim. Yufeng Wu, Dan Gusfield
2008	J	`jnl`	EIC Editorial. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2008	B	`conf`	ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. CPM Dan Gusfield
2007	J	`jnl`	A Decomposition Theory for Phylogenetic Networks and Incompatible Characters. J. Comput. Biol. Dan Gusfield, Vikas Bansal, Vineet Bafna, Yun S. Song
2007	Misc	`conf`	A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. COCOON Yufeng Wu, Dan Gusfield
2007	J	`jnl`	Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. J. Comput. Biol. Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu
2007	J	`jnl`	An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. Discret. Appl. Math. Dan Gusfield, Dean Hickerson, Satish Eddhu
2007	J	`jnl`	Associate Editor Appreciation and Welcome. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2007	J	`jnl`	Associate Editor Appreciation and Welcome. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2007	J	`jnl`	Efficient Computation of Minimum Recombination with genotypes (not Haplotypes). J. Bioinform. Comput. Biol. Yufeng Wu, Dan Gusfield
2007	B	`conf`	Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. CPM Yufeng Wu, Dan Gusfield
2007	Misc	`conf`	Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. COCOON Dan Gusfield, Yelena Frid, Daniel G. Brown
2007	J	`jnl`	State of the Journal. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2006	J	`jnl`	A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. J. Comput. Biol. Zhihong Ding, Vladimir Filkov, Dan Gusfield
2006	B	`conf`	Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. RECOMB Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu
2006	Misc	`conf`	Efficient and Practical Algorithms for Deducing the History of Recombination in Populations. International Conference on Computational Science (2) Dan Gusfield
2006	J	`jnl`	Introduction of New Associate Editors. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2006	J	`jnl`	State of the Journal. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2005	B	`conf`	A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. RECOMB Dan Gusfield, Vikas Bansal
2005	B	`conf`	A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. RECOMB Zhihong Ding, Vladimir Filkov, Dan Gusfield
2005	C	`conf`	Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. WABI Yun S. Song, Yufeng Wu, Dan Gusfield
2005	J	`jnl`	Editorial-State of the Transaction. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2005	—	`conf`	Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. ISMB (Supplement of Bioinformatics) Yun S. Song, Yufeng Wu, Dan Gusfield
2005	J	`jnl`	Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. J. Comput. Syst. Sci. Dan Gusfield
2005	J	`jnl`	Preface: Special RECOMB 2004 Issue. J. Comput. Biol. Dan Gusfield
2004	J	`jnl`	A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. J. Comput. Biol. Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, Shibu Yooseph
2004	J	`jnl`	Introduction of New Associate Editors. IEEE ACM Trans. Comput. Biol. Bioinform. Dan Gusfield
2004	—	`conf`	Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination. German Conference on Bioinformatics Dan Gusfield
2004	J	`jnl`	Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. Dan Gusfield, Jens Stoye
2004	J	`jnl`	Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. J. Bioinform. Comput. Biol. Dan Gusfield, Satish Eddhu, Charles H. Langley
2004	B	`ed.`	Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004 RECOMB Philip E. Bourne, Dan Gusfield
2004	J	`jnl`	The Fine Structure of Galls in Phylogenetic Networks. INFORMS J. Comput. Dan Gusfield, Satish Eddhu, Charles H. Langley
2003	B	`conf`	An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs. ICTAI Dan Gusfield
2003	—	`conf`	Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. CSB Dan Gusfield, Satish Eddhu, Charles H. Langley
2003	Misc	`conf`	Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. COCOON Ren Hua Chung, Dan Gusfield
2003	B	`conf`	Haplotype Inference by Pure Parsimony. CPM Dan Gusfield
2003	J	`jnl`	Haplotyping as Perfect Phylogeny: A Direct Approach. J. Comput. Biol. Vineet Bafna, Dan Gusfield, Giuseppe Lancia, Shibu Yooseph
2003	J	`jnl`	On the Complexity of Fundamental Computational Problems in Pedigree Analysis. J. Comput. Biol. Antonio Piccolboni, Dan Gusfield
2003	J	`jnl`	Perfect phylogeny haplotyper: haplotype inferral using a tree model. Bioinform. Ren Hua Chung, Dan Gusfield
2002	C	`ed.`	Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings WABI Roderic Guigó, Dan Gusfield
2002	—	`conf`	An Overview of Combinatorial Methods for Haplotype Inference. Computational Methods for SNPs and Haplotype Inference Dan Gusfield
2002	B	`conf`	Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. RECOMB Dan Gusfield
2002	J	`jnl`	Partition-distance: A problem and class of perfect graphs arising in clustering. Inf. Process. Lett. Dan Gusfield
2002	J	`jnl`	Simple and flexible detection of contiguous repeats using a suffix tree. Theor. Comput. Sci. Jens Stoye, Dan Gusfield
2002	B	`conf`	String barcoding: uncovering optimal virus signatures. RECOMB Sam Rash, Dan Gusfield
2002	—	`conf`	Suffix Trees (and Relatives) Come of Age in Bioinformatics. CSB Dan Gusfield
2002	J	`jnl`	The Structure and Complexity of Sports Elimination Numbers. Algorithmica Dan Gusfield, Charles U. Martel
2001	J	`jnl`	Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. J. Comput. Biol. Dan Gusfield
2000	J	`jnl`	A More Efficient Approximation Scheme for Tree Alignment. SIAM J. Comput. Lusheng Wang, Tao Jiang, Dan Gusfield
2000	A	`conf`	A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations. ISMB Dan Gusfield
1999	J	`jnl`	Guest Editors' Foreword. Algorithmica Dan Gusfield, Ming-Yang Kao
1999	B	`conf`	Tresholds for Sports Elimination Numbers Algorithms and Complexity. WADS Dan Gusfield, Charles U. Martel
1998	J	`jnl`	Constructing Additive Trees When the Error Is Small. J. Comput. Biol. Lusheng Wang, Dan Gusfield
1998	J	`jnl`	Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discret. Appl. Math. Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
1998	—	`conf`	New uses for uniform lifted alignments. Mathematical Support for Molecular Biology Dan Gusfield, Lusheng Wang
1998	J	`jnl`	Reconstructing a History of Recombinations From a Set of Sequences. Discret. Appl. Math. John D. Kececioglu, Dan Gusfield
1998	B	`conf`	Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). CPM Jens Stoye, Dan Gusfield
1997	J	`jnl`	A Fast Algorithm for Optimally Increasing the Edge Connectivity. SIAM J. Comput. Dalit Naor, Dan Gusfield, Charles U. Martel
1997	B	`conf`	A more efficient approximation scheme for tree alignment. RECOMB Lusheng Wang, Tao Jiang, Dan Gusfield
1997	J	`jnl`	Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology. SIGACT News Dan Gusfield
1997	—	`book`	Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology Dan Gusfield
1997	J	`jnl`	Improved Approximation Algorithms for Tree Alignment. J. Algorithms Lusheng Wang, Dan Gusfield
1996	B	`conf`	Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
1996	B	`conf`	Improved Approximation Algorithms for Tree Alignment. CPM Lusheng Wang, Dan Gusfield
1994	J	`jnl`	A Faster Parametric Minimum-Cut Algorithm. Algorithmica Dan Gusfield, Éva Tardos
1994	B	`ed.`	Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings CPM Maxime Crochemore, Dan Gusfield
1994	J	`jnl`	Faster Implementation of a Shortest Superstring Approximation. Inf. Process. Lett. Dan Gusfield
1994	J	`jnl`	Parametric Optimization of Sequence Alignment. Algorithmica Dan Gusfield, K. Balasubramanian, Dalit Naor
1994	A*	`conf`	Reconstructing a History of Recombinations from a Set of Sequences. SODA John D. Kececioglu, Dan Gusfield
1993	J	`jnl`	Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. SIAM J. Discret. Math. Ming-Yang Kao, Dan Gusfield
1993	J	`jnl`	Extracting Maximal Information About Sets of Minimum Cuts. Algorithmica Dan Gusfield, Dalit Naor
1992	J	`jnl`	A Bounded Approximation for the Minimum Cost 2-Sat Problem. Algorithmica Dan Gusfield, Leonard Pitt
1992	J	`jnl`	A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. Algorithmica Dan Gusfield, Charles U. Martel
1992	J	`jnl`	An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Inf. Process. Lett. Dan Gusfield, Gad M. Landau, Baruch Schieber
1992	A*	`conf`	Parametric Optimization of Sequence Alignment. SODA Dan Gusfield, K. Balasubramanian, Dalit Naor
1991	J	`jnl`	Computing the Strength of a Graph. SIAM J. Comput. Dan Gusfield
1991	J	`jnl`	Efficient algorithms for generalized cut-trees. Networks Dan Gusfield, Dalit Naor
1991	J	`jnl`	Efficient algorithms for inferring evolutionary trees. Networks Dan Gusfield
1991	J	`jnl`	Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov). SIAM Rev. Andrew V. Goldberg, Dan Gusfield
1990	A*	`conf`	A Fast Algorithm for Optimally Increasing the Edge-Connectivity FOCS Dalit Naor, Dan Gusfield, Charles U. Martel
1990	—	`conf`	A Little Knowledge Goes a Long Way: Faster Detection of Compromised Data in 2-D Tables. S&P Dan Gusfield
1990	A*	`conf`	Efficient Algorithms for Generalized Cut Trees. SODA Dan Gusfield, Dalit Naor
1990	J	`jnl`	Very Simple Methods for All Pairs Network Flow Analysis. SIAM J. Comput. Dan Gusfield
1989	J	`jnl`	A Fast Parallel Quicksort Algorithm. Inf. Process. Lett. Charles U. Martel, Dan Gusfield
1989	J	`jnl`	Parametric Stable Marriage and Minimum Cuts. Inf. Process. Lett. Dan Gusfield, Robert W. Irving
1989	—	`book`	The Stable marriage problem - structure and algorithms. Dan Gusfield, Robert W. Irving
1988	J	`jnl`	A Graph Theoretic Approach to Statistical Data Security. SIAM J. Comput. Dan Gusfield
1988	J	`jnl`	The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments. SIAM J. Comput. Dan Gusfield
1987	J	`jnl`	An efficient algorithm for the "optimal" stable marriage. J. ACM Robert W. Irving, Paul Leather, Dan Gusfield
1987	J	`jnl`	Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. J. Comb. Theory A Dan Gusfield, Robert W. Irving, Paul Leather, Michael E. Saks
1987	J	`jnl`	Fast Algorithms for Bipartite Network Flow. SIAM J. Comput. Dan Gusfield, Charles U. Martel, David Fernández-Baca
1987	J	`jnl`	Optimal Mixed Graph Augmentation. SIAM J. Comput. Dan Gusfield
1987	J	`jnl`	Three Fast Algorithms for Four Problems in Stable Marriage. SIAM J. Comput. Dan Gusfield
1986	J	`jnl`	Equivalent Approximation Algorithms for Node Cover. Inf. Process. Lett. Dan Gusfield, Leonard Pitt
1985	J	`jnl`	Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85. Networks Dan Gusfield
1984	J	`jnl`	Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. J. Algorithms Dan Gusfield
1984	J	`jnl`	Matroid optimization with the interleaving of two ordered sets. Discret. Appl. Math. Dan Gusfield
1983	J	`jnl`	A note on Arc tolerances in sparse shortest-path and network flow problems. Networks Dan Gusfield
1983	J	`jnl`	Connectivity and Edge-Disjoint Spanning Trees. Inf. Process. Lett. Dan Gusfield
1983	J	`jnl`	Parametric Combinatorial Computing and a Problem of Program Module Distribution J. ACM Dan Gusfield
1983	J	`jnl`	Simple Construction for Multi-Terminal Network Flow Synthesis. SIAM J. Comput. Dan Gusfield