Combinatorial Pattern Matching, 2010
21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,
Theoretical Computer Science and General Issues Series

This book constitutes the refereed proceedings of the 21st AnnualSymposium on Combinatorial Pattern Matching, CPM 2010, held in New York, USA, in June 2010.The 28 revised full papers presented together with 3 invited talks werecarefully reviewed and selected from 53 submissions. The papers addressall areas related to combinatorial pattern matching and itsapplications, such as searching and matching strings and morecomplicated patterns such as trees, regular expressions, graphs, pointsets, and arrays with special focus on coding and data compression,computational biology, data mining, information retrieval, naturallanguage processing, pattern recognition, string algorithms, stringprocessing in databases, symbolic computing and text searching.

Algorithms for Forest Pattern Matching.- Affine Image Matching Is Uniform -Complete.- Old and New in Stringology.- Small-Space 2D Compressed Dictionary Matching.- Bidirectional Search in a String with Wavelet Trees.- A Minimal Periods Algorithm with Applications.- The Property Suffix Tree with Dynamic Properties.- Approximate All-Pairs Suffix/Prefix Overlaps.- Succinct Dictionary Matching with No Slowdown.- Pseudo-realtime Pattern Matching: Closing the Gap.- Breakpoint Distance and PQ-Trees.- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs.- Succinct Representations of Separable Graphs.- Implicit Hitting Set Problems and Multi-genome Alignment.- Bounds on the Minimum Mosaic of Population Sequences under Recombination.- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection.- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints.- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.- Mod/Resc Parsimony Inference.- Extended Islands of Tractability for Parsimony Haplotyping.- Sampled Longest Common Prefix Array.- Verifying a Parameterized Border Array in O(n 1.5) Time.- Cover Array String Reconstruction.- Compression, Indexing, and Retrieval for Massive String Data.- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality.- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach.- Algorithms for Three Versions of the Shortest Common Superstring Problem.- Finding Optimal Alignment and Consensus of Circular Strings.- Optimizing Restriction Site Placement for Synthetic Genomes.- Extension and Faster Implementation of the GRP Transform for Lossless Compression.- Parallel and Distributed Compressed Indexes.