Skip to main content
  • Conference proceedings
  • © 2010

Combinatorial Pattern Matching

21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,

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

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

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

  1. Front Matter

  2. Algorithms for Forest Pattern Matching

    • Kaizhong Zhang, Yunkun Zhu
    Pages 1-12
  3. Old and New in Stringology

    • Zvi Galil
    Pages 26-26
  4. Small-Space 2D Compressed Dictionary Matching

    • Shoshana Neuburger, Dina Sokol
    Pages 27-39
  5. Bidirectional Search in a String with Wavelet Trees

    • Thomas Schnattinger, Enno Ohlebusch, Simon Gog
    Pages 40-50
  6. Approximate All-Pairs Suffix/Prefix Overlaps

    • Niko Välimäki, Susana Ladra, Veli Mäkinen
    Pages 76-87
  7. Succinct Dictionary Matching with No Slowdown

    • Djamal Belazzougui
    Pages 88-100
  8. Pseudo-realtime Pattern Matching: Closing the Gap

    • Raphaël Clifford, Benjamin Sach
    Pages 101-111
  9. Breakpoint Distance and PQ-Trees

    • Haitao Jiang, Cedric Chauve, Binhai Zhu
    Pages 112-124
  10. Succinct Representations of Separable Graphs

    • Guy E. Blelloch, Arash Farzan
    Pages 138-150
  11. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection

    • Michal Nánási, Tomáš VinaÅ™, Broňa Brejová
    Pages 164-176
  12. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks

    • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
    Pages 190-201
  13. Mod/Resc Parsimony Inference

    • Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max Reuter, Olivier Duron et al.
    Pages 202-213

Other Volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA, and Bar-Ilan University, Ramat-Gan, Israel

    Amihood Amir

  • IBM T.J. Watson Research Center, Yorktown Heights, USA

    Laxmi Parida

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