Skip to main content
Springer Nature Link
Account

Combinatorial Pattern Matching

16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Alberto Apostolico

    1. Georgia Institute of Technology and Università di Padova,  

  2. Maxime Crochemore

    1. Université Paris-Est, France

  3. Kunsoo Park

    1. School of Computer Science and Engineering, Seoul National University, Seoul, Korea

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CPM 2005.

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

Access this book

Log in via an institution
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 (37 papers)

  1. Front Matter

    Download chapter PDF

  2. Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern

    • Broňa Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomáš Vinař
    Pages 1-10

  3. On the Longest Common Rigid Subsequence Problem

    • Bin Ma, Kaizhong Zhang
    Pages 11-20

  4. Text Indexing with Errors

    • Moritz G. Maaß, Johannes Nowak
    Pages 21-32

  5. A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space

    • Dong Kyue Kim, Heejin Park
    Pages 33-44

  6. Succinct Suffix Arrays Based on Run-Length Encoding

    • Veli Mäkinen, Gonzalo Navarro
    Pages 45-56

  7. Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets

    • Joong Chae Na
    Pages 57-67

  8. Faster Algorithms for δ,γ-Matching and Related Problems

    • Peter Clifford, Raphaël Clifford, Costas Iliopoulos
    Pages 68-78

  9. A Fast Algorithm for Approximate String Matching on Gene Sequences

    • Zheng Liu, Xin Chen, James Borneman, Tao Jiang
    Pages 79-90

  10. Approximate Matching in the L 1 Metric

    • Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
    Pages 91-103

  11. An Efficient Algorithm for Generating Super Condensed Neighborhoods

    • Luís M. S. Russo, Arlindo L. Oliveira
    Pages 104-115

  12. The Median Problem for the Reversal Distance in Circular Bacterial Genomes

    • Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
    Pages 116-127

  13. Using PQ Trees for Comparative Genomics

    • Gad M. Landau, Laxmi Parida, Oren Weimann
    Pages 128-143

  14. Hardness of Optimal Spaced Seed Design

    • François Nicolas, Eric Rivals
    Pages 144-155

  15. Weighted Directed Word Graph

    • Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju
    Pages 156-167

  16. Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets

    • Shiri Dori, Gad M. Landau
    Pages 168-177

  17. An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression

    • Sabrina Mantaci, Antonio Restivo, G. Rosone, Marinella Sciortino
    Pages 178-189

  18. DNA Compression Challenge Revisited: A Dynamic Programming Approach

    • Behshad Behzadi, Fabrice Le Fessant
    Pages 190-200

  19. On the Complexity of Sparse Exon Assembly

    • Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
    Pages 201-218

  20. An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery

    • Paul Horton, Wataru Fujibuchi
    Pages 219-228
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  • Université Paris-Est, France

    Maxime Crochemore

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

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