Skip to main content
  • Conference proceedings
  • © 2004

Combinatorial Pattern Matching

15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings

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

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

Conference proceedings info: CPM 2004.

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. Computational Design of New and Recombinant Selenoproteins

    • Rolf Backofen, Anke Busch
    Pages 270-284
  2. Multi-seed Lossless Filtration

    • Gregory Kucherov, Laurent Noé, Mikhail Roytberg
    Pages 297-310
  3. New Results for the 2-Interval Pattern Problem

    • Guillaume Blin, Guillaume Fertin, Stéphane Vialette
    Pages 311-322
  4. A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes

    • Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu
    Pages 323-332
  5. Sparse Normalized Local Alignment

    • Nadav Efraty, Gad M. Landau
    Pages 333-346
  6. Maximal Common Connected Sets of Interval Graphs

    • Michel Habib, Christophe Paul, Mathieu Raffinot
    Pages 359-372
  7. Reversal Distance without Hurdles and Fortresses

    • Anne Bergeron, Julia Mixtacki, Jens Stoye
    Pages 388-399
  8. A Fast Set Intersection Algorithm for Sorted Sequences

    • Ricardo Baeza-Yates
    Pages 400-408
  9. Faster Two Dimensional Pattern Matching with Rotations

    • Amihood Amir, Oren Kapah, Dekel Tsur
    Pages 409-419
  10. Compressed Compact Suffix Arrays

    • Veli Mäkinen, Gonzalo Navarro
    Pages 420-433
  11. Approximate String Matching Using Compressed Suffix Arrays

    • Trinh N. D. Huynh, Wing-Kai Hon, Tak-Wah Lam, Wing-Kin Sung
    Pages 434-444
  12. Compressed Index for a Dynamic Collection of Texts

    • Ho-Leung Chan, Wing-Kai Hon, Tak-Wah Lam
    Pages 445-456
  13. Improved Single and Multiple Approximate String Matching

    • Kimmo Fredriksson, Gonzalo Navarro
    Pages 457-471
  14. Average-Case Analysis of Approximate Trie Search

    • Moritz G. Maaß
    Pages 472-483
  15. Back Matter

Other Volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • School of Computing Science, Simon Fraser University, Burnaby, Canada

    Suleyman Cenk Sahinalp

  • Google Inc., New York, NY

    S. Muthukrishnan

  • Tom Sawyer Software, Oakland, USA

    Ugur Dogrusoz

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