Combinatorial Pattern Matching, 2008
19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings
Coll. Theoretical Computer Science and General Issues

The papers contained in this volume were presented at the 19th Annual S- posium on Combinatorial Pattern Matching (CPM 2008) held at the University of Pisa, Italy, June 18?20, 2008. All the papers presented at the conference are originalresearchcontributions on computational pattern matching and analysis. They were selected from 78 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 25 papers. The programme also includes three invited talks by Daniel M. Gus?eld from the University of California, Davis, USA, J. Ian Munro from the University of Waterloo, Canada, and Prabhakar Raghavan from Yahoo! Research, USA. The objective of the annual CPM meetings is to provide an international forum for research in combinatorial pattern matching and related applications. It addresses issues of searching and matching strings and more complicated p- terns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivialcombinatorialproperties of suchstructures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under which searches cannotbeperformede?ciently. Themeeting also dealswith problems incom- tational biology, data compression, data mining, coding, information retrieval, natural language processing and pattern recognition.

Invited Talks.- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations.- Lower Bounds for Succinct Data Structures.- The Changing Face of Web Search.- Contributed Papers.- Two-Dimensional Pattern Matching with Combined Scaling and Rotation.- Searching for Gapped Palindromes.- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.- Finding Largest Well-Predicted Subset of Protein Structure Models.- HP Distance Via Double Cut and Join Distance.- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots.- Faster Algorithm for the Set Variant of the String Barcoding Problem.- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics.- Analysis of the Size of Antidictionary in DCA.- Approximate String Matching with Address Bit Errors.- On-Line Approximate String Matching with Bounded Errors.- A Black Box for Online Approximate Pattern Matching.- An(other) Entropy-Bounded Compressed Suffix Tree.- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices.- Computing Inverse ST in Linear Complexity.- Dynamic Fully-Compressed Suffix Trees.- A Linear Delay Algorithm for Building Concept Lattices.- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares.- Fast Algorithms for Computing Tree LCS.- Why Greed Works for Shortest Common Superstring Problem.- Constrained LCS: Hardness and Approximation.- Finding Additive Biclusters with Random Background.- An Improved Succinct Representation for Dynamic k-ary Trees.- Towards a Solution to the “Runs” Conjecture.- On the Longest Common Parameterized Subsequence.