Skip to main content
  • Conference proceedings
  • © 2006

Combinatorial Pattern Matching

17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings

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

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 2006.

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 (36 papers)

  1. Session 6. Applications in Molecular Biology II

    1. Approximation of RNA Multiple Structural Alignment

      • Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz WaleÅ„
      Pages 211-222
    2. A Compact Mathematical Programming Formulation for DNA Motif Finding

      • Carl Kingsford, Elena Zaslavsky, Mona Singh
      Pages 233-245
    3. Local Alignment of RNA Sequences with Arbitrary Scoring Schemes

      • Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
      Pages 246-257
  2. Session 7. Applications in Molecular Biology III

  3. Session 8. Data Compression

    1. A Simpler Analysis of Burrows-Wheeler Based Compression

      • Haim Kaplan, Shir Landau, Elad Verbin
      Pages 282-293
    2. Statistical Encoding of Succinct Data Structures

      • Rodrigo González, Gonzalo Navarro
      Pages 294-305
    3. Dynamic Entropy-Compressed Sequences and Full-Text Indexes

      • Veli Mäkinen, Gonzalo Navarro
      Pages 306-317
    4. Reducing the Space Requirement of LZ-Index

      • Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane
      Pages 318-329
  4. Session 9. String Matching II

    1. Faster Algorithms for Computing Longest Common Increasing Subsequences

      • Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
      Pages 330-341
    2. New Algorithms for Text Fingerprinting

      • Roman Kolpakov, Mathieu Raffinot
      Pages 342-353
    3. Sublinear Algorithms for Parameterized Matching

      • Leena Salmela, Jorma Tarhio
      Pages 354-364
    4. Approximate Matching in Weighted Sequences

      • Amihood Amir, Costas Iliopoulos, Oren Kapah, Ely Porat
      Pages 365-376
  5. Session 10. Dynamic Programming

    1. Algorithms for Finding a Most Similar Subforest

      • Jesper Jansson, Zeshan Peng
      Pages 377-388
    2. Efficient Algorithms for Regular Expression Constrained Sequence Alignment

      • Yun-Sheng Chung, Chin Lung Lu, Chuan Yi Tang
      Pages 389-400
    3. Large Scale Matching for Position Weight Matrices

      • Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré
      Pages 401-412
  6. Back Matter

Other Volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

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

    Moshe Lewenstein

  • Department of Software, Technical University of Catalonia, Barcelona, Spain

    Gabriel Valiente

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