Accepted Papers for CPM 2013
Space-Efficient Construction Algorithm for the Circular Suffix Tree
New Algorithms for Position Heaps
Approximation of grammar-based compression via recompression
Compact q-gram Profiling of Compressed Strings
Pattern Matching with Variables: A Multivariate Complexity Analysis
Fast Algorithm for Partial Covers in Words
Efficient All Path Score Computations on Grid Graphs
External Memory Generalized Suffix and LCP Arrays Construction
Locating All Maximal Approximate Runs in a String
Approximating Shortest Superstring Problem Using De Bruijn Graphs
Document Listing on Repetitive Collections
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform
Converting SLP to LZ78 in almost linear time
A Succinct Grammar Compression
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Local Search for String Problems: Brute Force is Essentially Optimal
Time-Space Trade-Offs for the Longest Common Substring Problem
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
On Minimal and Maximal Suffixes of a Substring
Efficient Lyndon factorization of grammar compressed text