Combinatorial Pattern Matching

7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings

Editors:

ISBN: 978-3-540-61258-2 (Print) 978-3-540-68390-2 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-23

    A faster algorithm for approximate string matching

  2. No Access

    Book Chapter

    Pages 24-38

    Boyer-Moore strategy to efficient approximate string matching

  3. No Access

    Book Chapter

    Pages 39-49

    Randomized efficient algorithms for compressed strings: the finger-print approach

  4. No Access

    Book Chapter

    Pages 50-63

    Filtration with q-samples in approximate string matching

  5. No Access

    Book Chapter

    Pages 64-64

    Computing discoveries in molecular biology

  6. No Access

    Book Chapter

    Pages 65-74

    Approximate dictionary queries

  7. No Access

    Book Chapter

    Pages 75-86

    Approximate multiple string search

  8. No Access

    Book Chapter

    Pages 87-101

    A 2 2/3-approximation algorithm for the shortest superstring problem

  9. No Access

    Book Chapter

    Pages 102-115

    Suffix trees on words

  10. No Access

    Book Chapter

    Pages 116-129

    The suffix tree of a tree and minimizing sequential transducers

  11. No Access

    Book Chapter

    Pages 130-140

    Perfect hashing for strings: Formalization and algorithms

  12. No Access

    Book Chapter

    Pages 141-158

    Spliced alignment: A new approach to gene recognition

  13. No Access

    Book Chapter

    Pages 159-167

    Original Synteny

  14. No Access

    Book Chapter

    Pages 168-185

    Fast sorting by reversal

  15. No Access

    Book Chapter

    Pages 186-208

    A double combinatorial approach to discovering patterns in biological sequences

  16. No Access

    Book Chapter

    Pages 209-219

    Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization

  17. No Access

    Book Chapter

    Pages 220-233

    Improved approximation algorithms for tree alignment

  18. No Access

    Book Chapter

    Pages 234-252

    The asymmetric median tree — A new model for building consensus trees

  19. No Access

    Book Chapter

    Pages 253-270

    Constructing computer virus phylogenies

  20. No Access

    Book Chapter

    Pages 271-287

    Docking of conformationally flexible proteins

previous Page of 2