CPM 2012: Helsinki, Finland
Invited Talks.
Proceedings.
- Maxime Crochemore, Costas S. Iliopoulos,
Tomasz Kociumaka, Marcin Kubica,
Jakub Radoszewski, Wojciech Rytter,
Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. 27-40
download presentation (PDF)
download paper
- Aida Ouangraoua,
Mathieu Raffinot:
Faster
and Simpler Minimal Conflicting Set Identification - (Extended
Abstract). 41-55
download paper
- Sharon Bruckner,
Falk Huffner,
Christian Komusiewicz,
Rolf Niedermeier, Sven
Thiel,
Johannes Uhlmann:
Partitioning
into Colorful Components by Minimum Edge Deletions. 56-69
download presentation (PDF)
download paper
- Dima Blokh,
Danny Segev,
Roded Sharan:
Approximation Algorithms and Hardness Results for Shortest Path
Based Graph Orientations. 70-82
download presentation (PDF)
download paper
- Dany Breslauer,
Leszek Gasieniec, Roberto
Grossi:
Constant-Time Word-Size String Matching. 83-96
download presentation (PDF)
download paper
- Raphael Clifford,
Markus Jalsenius, Ely
Porat,
Benjamin Sach:
Pattern Matching in Multiple Streams. 97-109
download presentation (PDF)
download paper
- Omar AitMous,
Frederique Bassino,
Cyril Nicaud:
An
Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick
Automata. 110-123
download paper
- Christian Hundt,
Florian Wendland:
Efficient
Two-Dimensional Pattern Matching with Scaling and Rotation and
Higher-Order Interpolation. 124-137
download paper
- Guillaume Blin,
Laurent Bulteau,
Minghui Jiang,
Pedro J. Tejada,
Stephane Vialette:
Hardness of Longest Common Subsequence for Sequences with Bounded
Run-Lengths. 138-148
download paper
- Ferdinando Cicalese,
Eduardo Sany Laber,
Oren Weimann,
Raphael Yuster:
Near Linear Time Construction of an Approximate Index for All
Maximum Consecutive Sub-sums of a Sequence. 149-158
download paper
- Anne Condon, Jan
Manuch,
Chris Thachuk:
The Complexity of String Partitioning. 159-172
download presentation (PDF)
download paper
- Wing-Kai Hon,
Rahul Shah,
Sharma V. Thankachan:
Towards an Optimal Space-and-Query-Time Index for Top-k Document
Retrieval. 173-184
download paper
- Wing-Kai Hon,
Rahul Shah,
Sharma V. Thankachan,
Jeffrey Scott Vitter:
Document Listing for Queries with Excluded Pattern. 185-195
download paper
- Gregory Kucherov, Yakov
Nekrich,
Tatiana A. Starikovskaya:
Cross-Document Pattern Matching. 196-207
download presentation (PDF)
download paper
- Michael P. Ferguson:
FEMTO: Fast Search of Large Sequence Collections. 208-219
download presentation (PDF)
download paper
- Keisuke Goto,
Hideo Bannai,
Shunsuke Inenaga, Masayuki
Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. 220-231
download presentation (PDF)
download paper
- Pawel Gawrychowski:
Simple and Efficient LZW-Compressed Multiple Pattern Matching. 232-242
download paper
- Enno Ohlebusch,
Timo Beller,
Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler Transform of a String and Its Reverse. 243-256
download paper
- Wing-Kai Hon,
Tsung-Han Ku,
Chen-Hua Lu,
Rahul Shah,
Sharma V. Thankachan:
Efficient Algorithm for Circular Burrows-Wheeler Transform. 257-268
download paper
- Niko Valimaki:
Least Random Suffix/Prefix Matches in Output-Sensitive Time. 269-279
download presentation (PDF)
download paper
- Djamal Belazzougui,
Rossano Venturini:
Compressed String Dictionary Look-Up with Edit Distance One. 280-292
download presentation (PDF)
download paper
- Philip Bille,
Inge Li Gortz,
Benjamin Sach,
Hjalte Wedel Vildhoj:
Time-Space Trade-Offs for Longest Common Extensions. 293-305
download presentation (PDF)
download paper
- Mika Amit, Rolf Backofen,
Steffen Heyne,
Gad M. Landau,
Mathias Mohl,
Christina Schmiedl,
Sebastian Will:
Local Exact Pattern Matching for Non-fixed RNA Structures. 306-320
download paper
- Saad Sheikh,
Rolf Backofen,
Yann Ponty:
Impact of the Energy Model on the Complexity of RNA Folding with
Pseudoknots. 321-333
download presentation (PDF)
download paper
- Yen Kaow Ng,
Hirotaka Ono,
Ling Ge,
Shuai Cheng Li:
Finding Longest Common Segments in Protein Structures in Nearly
Linear Time. 334-348
download paper
- Haitao Jiang,
Binhai Zhu:
A Linear Kernel for the Complementary Maximal Strip Recovery Problem. 349-359
download presentation (PDF)
download paper
- Tatsuya Akutsu,
Takeyuki Tamura,
Daiji Fukagawa,
Atsuhiro Takasu:
Efficient Exponential Time Algorithms for Edit Distance between
Unordered Trees. 360-372
download paper
- David Fernandez-Baca,
Sylvain Guillemot,
Brad Shutters,
Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. 373-384
download presentation (PDF)
download paper
- Jesper Jansson,
Andrzej Lingas:
Computing the Rooted Triplet Distance between Galled Trees by
Counting Triangles. 385-398
download paper
- Riccardo Dondi,
Nadia El-Mabrouk:
Minimum
Leaf Removal for Reconciliation: Complexity and Algorithms. 399-412
download presentation (PDF)
download paper
- Liviu Petrisor Dinu,
Alexandru Popa:
On the Closest String via Rank Distance. 413-426
download paper
- Christina Boucher,
Gad M. Landau,
Avivit Levy,
David Pritchard,
Oren Weimann:
On
Approximating String Selection Problems with Outliers. 427-438
download paper
- Zhi-Zhong Chen,
Lusheng Wang,
Wenji Ma:
The
Parameterized Complexity of the Shared Center Problem. 439-452
download paper