The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dan Gusfield: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dan Gusfield
    A Graph Theoretic Approach to Statistical Data Security. [Citation Graph (5, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:552-571 [Journal]
  2. Dan Gusfield
    A Little Knowledge Goes a Long Way: Faster Detection of Compromised Data in 2-D Tables. [Citation Graph (1, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1990, pp:86-94 [Conf]
  3. Dan Gusfield
    Optimal Mixed Graph Augmentation. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:599-612 [Journal]
  4. Ren Hua Chung, Dan Gusfield
    Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:5-19 [Conf]
  5. Dan Gusfield
    Haplotype Inference by Pure Parsimony. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:144-155 [Conf]
  6. Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
    Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:304-319 [Conf]
  7. Jens Stoye, Dan Gusfield
    Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CPM, 1998, pp:140-152 [Conf]
  8. Lusheng Wang, Dan Gusfield
    Improved Approximation Algorithms for Tree Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:220-233 [Conf]
  9. Dan Gusfield
    Suffix Trees (and Relatives) Come of Age in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    CSB, 2002, pp:3- [Conf]
  10. Dan Gusfield, Satish Eddhu, Charles H. Langley
    Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. [Citation Graph (0, 0)][DBLP]
    CSB, 2003, pp:363-374 [Conf]
  11. Dalit Naor, Dan Gusfield, Charles U. Martel
    A Fast Algorithm for Optimally Increasing the Edge-Connectivity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:698-707 [Conf]
  12. Dan Gusfield
    Invited Talk: Phylogenetic Networks with Constrained and Unconstrained Recombination. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 2004, pp:1-2 [Conf]
  13. Dan Gusfield
    Efficient and Practical Algorithms for Deducing the History of Recombination in Populations. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:618-619 [Conf]
  14. Dan Gusfield
    An Overview of Haplotyping via Perfect Phylogeny: Theory, Algorithms and Programs. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2003, pp:- [Conf]
  15. Dan Gusfield
    A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations. [Citation Graph (0, 0)][DBLP]
    ISMB, 2000, pp:183-189 [Conf]
  16. Yun S. Song, Yufeng Wu, Dan Gusfield
    Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2005, pp:413-422 [Conf]
  17. Dan Gusfield
    An Overview of Combinatorial Methods for Haplotype Inference. [Citation Graph (0, 0)][DBLP]
    Computational Methods for SNPs and Haplotype Inference, 2002, pp:9-25 [Conf]
  18. Dan Gusfield
    Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:166-175 [Conf]
  19. Dan Gusfield, Vikas Bansal
    A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:217-232 [Conf]
  20. Zhihong Ding, Vladimir Filkov, Dan Gusfield
    A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:585-600 [Conf]
  21. Sam Rash, Dan Gusfield
    String barcoding: uncovering optimal virus signatures. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:254-261 [Conf]
  22. Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H. Langley, Yufeng Wu
    Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:231-245 [Conf]
  23. Lusheng Wang, Tao Jiang, Dan Gusfield
    A more efficient approximation scheme for tree alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:310-319 [Conf]
  24. Dan Gusfield, K. Balasubramanian, Dalit Naor
    Parametric Optimization of Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:432-439 [Conf]
  25. Dan Gusfield, Dalit Naor
    Efficient Algorithms for Generalized Cut Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:422-433 [Conf]
  26. John D. Kececioglu, Dan Gusfield
    Reconstructing a History of Recombinations from a Set of Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:471-480 [Conf]
  27. Yun S. Song, Yufeng Wu, Dan Gusfield
    Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:152-164 [Conf]
  28. Dan Gusfield, Charles U. Martel
    Tresholds for Sports Elimination Numbers Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:330-341 [Conf]
  29. Dan Gusfield, K. Balasubramanian, Dalit Naor
    Parametric Optimization of Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:312-326 [Journal]
  30. Dan Gusfield, Ming-Yang Kao
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:141- [Journal]
  31. Dan Gusfield, Charles U. Martel
    The Structure and Complexity of Sports Elimination Numbers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:73-86 [Journal]
  32. Dan Gusfield, Charles U. Martel
    A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:5&6, pp:499-519 [Journal]
  33. Dan Gusfield, Dalit Naor
    Extracting Maximal Information About Sets of Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:1, pp:64-89 [Journal]
  34. Dan Gusfield, Leonard Pitt
    A Bounded Approximation for the Minimum Cost 2-Sat Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:2, pp:103-117 [Journal]
  35. Dan Gusfield, Éva Tardos
    A Faster Parametric Minimum-Cut Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:278-290 [Journal]
  36. Ren Hua Chung, Dan Gusfield
    Perfect phylogeny haplotyper: haplotype inferral using a tree model. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:6, pp:780-781 [Journal]
  37. Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
    Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:167-180 [Journal]
  38. John D. Kececioglu, Dan Gusfield
    Reconstructing a History of Recombinations From a Set of Sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:239-260 [Journal]
  39. Dan Gusfield, Dean Hickerson, Satish Eddhu
    An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:806-830 [Journal]
  40. Dan Gusfield, Satish Eddhu, Charles H. Langley
    The Fine Structure of Galls in Phylogenetic Networks. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:4, pp:459-469 [Journal]
  41. Dan Gusfield
    Partition-distance: A problem and class of perfect graphs arising in clustering. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:3, pp:159-164 [Journal]
  42. Dan Gusfield
    Connectivity and Edge-Disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:87-89 [Journal]
  43. Dan Gusfield
    Faster Implementation of a Shortest Superstring Approximation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:5, pp:271-274 [Journal]
  44. Dan Gusfield, Robert W. Irving
    Parametric Stable Marriage and Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:5, pp:255-259 [Journal]
  45. Dan Gusfield, Gad M. Landau, Baruch Schieber
    An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:181-185 [Journal]
  46. Dan Gusfield, Leonard Pitt
    Equivalent Approximation Algorithms for Node Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:291-294 [Journal]
  47. Charles U. Martel, Dan Gusfield
    A Fast Parallel Quicksort Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:2, pp:97-102 [Journal]
  48. Dan Gusfield
    Parametric Combinatorial Computing and a Problem of Program Module Distribution [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:551-563 [Journal]
  49. Robert W. Irving, Paul Leather, Dan Gusfield
    An efficient algorithm for the ``optimal'' stable marriage. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:532-543 [Journal]
  50. Dan Gusfield
    Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:1, pp:1-6 [Journal]
  51. Lusheng Wang, Dan Gusfield
    Improved Approximation Algorithms for Tree Alignment. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:255-273 [Journal]
  52. Dan Gusfield, Satish Eddhu, Charles H. Langley
    Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:1, pp:173-214 [Journal]
  53. Vineet Bafna, Dan Gusfield, Sridhar Hannenhalli, Shibu Yooseph
    A Note on Efficient Computation of Haplotypes via Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:5, pp:858-866 [Journal]
  54. Vineet Bafna, Dan Gusfield, Giuseppe Lancia, Shibu Yooseph
    Haplotyping as Perfect Phylogeny: A Direct Approach. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:3/4, pp:323-340 [Journal]
  55. Dan Gusfield
    Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2001, v:8, n:3, pp:305-323 [Journal]
  56. Dan Gusfield
    Preface: Special RECOMB 2004 Issue. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:6, pp:567-568 [Journal]
  57. Antonio Piccolboni, Dan Gusfield
    On the Complexity of Fundamental Computational Problems in Pedigree Analysis. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:5, pp:763-773 [Journal]
  58. Lusheng Wang, Dan Gusfield
    Constructing Additive Trees When the Error Is Small. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:1, pp:137-134 [Journal]
  59. Dan Gusfield
    Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:3, pp:381-398 [Journal]
  60. Dan Gusfield, Jens Stoye
    Linear time algorithms for finding and representing all the tandem repeats in a string. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:4, pp:525-546 [Journal]
  61. Dan Gusfield, Robert W. Irving, Paul Leather, Michael E. Saks
    Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:2, pp:304-309 [Journal]
  62. Dan Gusfield
    Simple Construction for Multi-Terminal Network Flow Synthesis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:157-165 [Journal]
  63. Dan Gusfield
    Three Fast Algorithms for Four Problems in Stable Marriage. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:111-128 [Journal]
  64. Dan Gusfield
    The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:742-769 [Journal]
  65. Dan Gusfield
    Very Simple Methods for All Pairs Network Flow Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:143-155 [Journal]
  66. Dan Gusfield
    Computing the Strength of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:639-654 [Journal]
  67. Dan Gusfield, Charles U. Martel, David Fernández-Baca
    Fast Algorithms for Bipartite Network Flow. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:237-251 [Journal]
  68. Dalit Naor, Dan Gusfield, Charles U. Martel
    A Fast Algorithm for Optimally Increasing the Edge Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1139-1165 [Journal]
  69. Lusheng Wang, Tao Jiang, Dan Gusfield
    A More Efficient Approximation Scheme for Tree Alignment. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:283-299 [Journal]
  70. Ming-Yang Kao, Dan Gusfield
    Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:460-476 [Journal]
  71. Dan Gusfield
    Introduction of New Associate Editors. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:3, pp:97- [Journal]
  72. Dan Gusfield
    Editorial-State of the Transaction. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:39- [Journal]
  73. Dan Gusfield
    State of the Journal. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:1, pp:1- [Journal]
  74. Dan Gusfield
    Introduction of New Associate Editors. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:2, pp:97- [Journal]
  75. Jens Stoye, Dan Gusfield
    Simple and flexible detection of contiguous repeats using a suffix tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:843-856 [Journal]
  76. Yufeng Wu, Dan Gusfield
    A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:16-26 [Conf]
  77. Dan Gusfield, Yelena Frid, Dan Brown
    Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:51-64 [Conf]
  78. Yufeng Wu, Dan Gusfield
    Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:150-161 [Conf]
  79. Dan Gusfield
    State of the Journal. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:1, pp:1- [Journal]
  80. Dan Gusfield
    Associate Editor Appreciation and Welcome. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:1, pp:2- [Journal]
  81. Dan Gusfield
    Associate Editor Appreciation and Welcome. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:3, pp:321- [Journal]

  82. ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations. [Citation Graph (, )][DBLP]


  83. The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory. [Citation Graph (, )][DBLP]


  84. Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters. [Citation Graph (, )][DBLP]


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


  86. A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea. [Citation Graph (, )][DBLP]


  87. Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. [Citation Graph (, )][DBLP]


  88. Untangling Tanglegrams: Comparing Trees by Their Drawings. [Citation Graph (, )][DBLP]


  89. Extensions and Improvements to the Chordal Graph Approach to the Multi-state Perfect Phylogeny Problem. [Citation Graph (, )][DBLP]


  90. Editorial. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002