Skip to main content
Springer Nature Link
Account

Combinatorial Pattern Matching

12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Authors:
  1. Gad M. Landau

    1. Department of Computer Science, University of Haifa, Haifa, Brooklyn, Israel, USA

Editors:
  1. Amihood Amir

    1. Department of Computer Science, Bar-Ilan University, Ramat-Gan, Georgia, Israel, USA

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2089)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (24 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Regular Expression Searching over Ziv-Lempel Compressed Text

    • Gonzalo Navarro
    Pages 1-17

  3. Parallel Lempel Ziv Coding (Extended Abstract)

    • Shmuel Tomi Klein, Yair Wiseman
    Pages 18-30

  4. Approximate Matching of Run-Length Compressed Strings

    • Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
    Pages 31-49

  5. What to Do with All this Hardware? (Invited Lecture)

    • Uzi Vishkin
    Pages 50-50

  6. Efficient Experimental String Matching by Weak Factor Recognition*

    • Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
    Pages 51-72

  7. Better Filtering with Gapped q-Grams

    • Stefan Burkhardt, Juha Kärkkäinen
    Pages 73-85

  8. Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract)

    • Abraham Bookstein, Shmuel Tomi Klein, Timo Raita
    Pages 86-97

  9. An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)

    • Aviezri S. Fraenkel, Jamie Simpson
    Pages 98-105

  10. A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

    • Anne Bergeron
    Pages 106-117

  11. Tandem Cyclic Alignment

    • Gary Benson
    Pages 118-130

  12. An Output-Sensitive Flexible Pattern Discovery Algorithm

    • Laxmi Parida, Isidore Rigoutsos, Dan Platt
    Pages 131-142

  13. Episode Matching*

    • Zdeněk Troníček
    Pages 143-146

  14. String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music

    • Masayuki Takeda
    Pages 147-151

  15. Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract)

    • Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa
    Pages 152-156

  16. Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time

    • Jean-Marc Champarnaud, Djelloul Ziadi
    Pages 157-168

  17. On-Line Construction of Compact Directed Acyclic Word Graphs*

    • Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri et al.
    Pages 169-180

  18. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

    • Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park
    Pages 181-192

  19. Multiple Pattern Matching Algorithms on Collage System

    • Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Pages 193-206

  20. Finding All Common Intervals of k Permutations

    • Steffen Heber, Jens Stoye
    Pages 207-218
Back to top

Authors, Editors and Affiliations

  • Department of Computer Science, Bar-Ilan University, Ramat-Gan, Georgia, Israel, USA

    Amihood Amir

  • Department of Computer Science, University of Haifa, Haifa, Brooklyn, Israel, USA

    Gad M. Landau

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top