CPM 2018

29th Annual Symposium on Combinatorial Pattern Matching

Qingdao, China, July 2-4, 2018

Conference

Papers and Proceedings

Local information

Other

Accepted papers

1: Yoshifumi Sakai. Maximal common subsequence algorithms
2: Rui Henriques,Alexandre Francisco, Luís Russo and Hideo Bannai. Order-Preserving Pattern Matching Indeterminate Strings
3: Uwe Baier. On Undetected Redundancy in the Burrows-Wheeler Transform
4: Amihood Amir, Avivit Levy and Ely Porat. Quasi-Periodicity Under Mismatch Errors
5: Brian Brubach. Fast Matching-based Approximations for Maximum Duo-preservation String Mapping and its Weighted Variant
6: Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel and Élise Vandomme. Nearest constrained circular words
7: Hideo Bannai, Travis Gagie, and Tomohiro I. Online LZ77 Parsing and Matching Statistics with RLBWTs
8: Sahar Hooshmand, Sharma V. Thankachan, Paniz Abedin and M. Oguzhan Kulekci. Non-Overlapping Indexing -- Cache Obliviously
9: Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Faster Online Elastic Degenerate String Matching
10: Tatsuya Akutsu, Colin de La Higuera and Takeyuki Tamura. A Simple Linear-time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications
11: Amihood Amir and Itai Boneh. Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms
12: Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Longest substring palindrome after edit
13: Brian Brubach and Jay Ghurye. A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment
14: Shu Zhang, Daming Zhu, Haitao Jiang and Jingjing Ma. Can a permutation be sorted by best short swaps?
15: Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai and Masayuki Takeda. Computing longest common square subsequences
16: Bartlomiej Dudek and Pawel Gawrychowski. Slowing Down Top Trees for Better Worst-Case Compression
17: Guillaume Fertin, Julien Fradin and Christian Komusiewicz. On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure
18: Rayan Chikhi and Alexander Schönhuth. Dualities in Tree Representations
19: Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Longest Lyndon Substring After Edit
20: Paniz Abedin, Sahar Hooshmand, Sharma V. Thankachan and Arnab Ganguly. The Heaviest Induced Ancestors Problem Revisited
21: Bastien Cazaux and Eric Rivals. Superstrings with multiplicities
22: Kilho Shin and Ishikawa Taichi. Linear-time algorithms for the subpath kernel
24: Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Lyndon Factorization of Grammar Compressed Texts Revisited