Skip to main content
SpringerLink
Log in

Combinatorial Pattern Matching

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Amihood Amir

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Laxmi Parida

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: CPM 2010.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Algorithms for Forest Pattern Matching

    • Kaizhong Zhang, Yunkun Zhu
    Pages 1-12

  3. Affine Image Matching Is Uniform \({\text{\rm TC}^0}\)-Complete

    • Christian Hundt
    Pages 13-25

  4. Old and New in Stringology

    • Zvi Galil
    Pages 26-26

  5. Small-Space 2D Compressed Dictionary Matching

    • Shoshana Neuburger, Dina Sokol
    Pages 27-39

  6. Bidirectional Search in a String with Wavelet Trees

    • Thomas Schnattinger, Enno Ohlebusch, Simon Gog
    Pages 40-50

  7. A Minimal Periods Algorithm with Applications

    • Zhi Xu
    Pages 51-62

  8. The Property Suffix Tree with Dynamic Properties

    • Tsvi Kopelowitz
    Pages 63-75

  9. Approximate All-Pairs Suffix/Prefix Overlaps

    • Niko Välimäki, Susana Ladra, Veli Mäkinen
    Pages 76-87

  10. Succinct Dictionary Matching with No Slowdown

    • Djamal Belazzougui
    Pages 88-100

  11. Pseudo-realtime Pattern Matching: Closing the Gap

    • Raphaël Clifford, Benjamin Sach
    Pages 101-111

  12. Breakpoint Distance and PQ-Trees

    • Haitao Jiang, Cedric Chauve, Binhai Zhu
    Pages 112-124

  13. On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs

    • Minghui Jiang
    Pages 125-137

  14. Succinct Representations of Separable Graphs

    • Guy E. Blelloch, Arash Farzan
    Pages 138-150

  15. Implicit Hitting Set Problems and Multi-genome Alignment

    • Richard M. Karp
    Pages 151-151

  16. Bounds on the Minimum Mosaic of Population Sequences under Recombination

    • Yufeng Wu
    Pages 152-163

  17. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection

    • Michal Nánási, Tomáš VinaÅ™, Broňa Brejová
    Pages 164-176

  18. Phylogeny- and Parsimony-Based Haplotype Inference with Constraints

    • Michael Elberfeld, Till Tantau
    Pages 177-189

  19. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks

    • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
    Pages 190-201

  20. Mod/Resc Parsimony Inference

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

Other volumes

  1. Combinatorial Pattern Matching

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation