Skip to main content
  • Conference proceedings
  • © 2005

Combinatorial Pattern Matching

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

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)

Conference series link(s): CPM: Annual Symposium on Combinatorial Pattern Matching

Conference proceedings info: CPM 2005.

Buy it now

Buying options

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

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

Table of contents (37 papers)

  1. Front Matter

  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. Succinct Suffix Arrays Based on Run-Length Encoding

    • Veli Mäkinen, Gonzalo Navarro
    Pages 45-56
  6. Faster Algorithms for δ,γ-Matching and Related Problems

    • Peter Clifford, Raphaël Clifford, Costas Iliopoulos
    Pages 68-78
  7. A Fast Algorithm for Approximate String Matching on Gene Sequences

    • Zheng Liu, Xin Chen, James Borneman, Tao Jiang
    Pages 79-90
  8. Approximate Matching in the L 1 Metric

    • Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
    Pages 91-103
  9. An Efficient Algorithm for Generating Super Condensed Neighborhoods

    • Luís M. S. Russo, Arlindo L. Oliveira
    Pages 104-115
  10. The Median Problem for the Reversal Distance in Circular Bacterial Genomes

    • Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
    Pages 116-127
  11. Using PQ Trees for Comparative Genomics

    • Gad M. Landau, Laxmi Parida, Oren Weimann
    Pages 128-143
  12. Hardness of Optimal Spaced Seed Design

    • François Nicolas, Eric Rivals
    Pages 144-155
  13. Weighted Directed Word Graph

    • Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju
    Pages 156-167
  14. 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
  15. DNA Compression Challenge Revisited: A Dynamic Programming Approach

    • Behshad Behzadi, Fabrice Le Fessant
    Pages 190-200
  16. On the Complexity of Sparse Exon Assembly

    • Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
    Pages 201-218
  17. An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery

    • Paul Horton, Wataru Fujibuchi
    Pages 219-228

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

Bibliographic Information

Buy it now

Buying options

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