| 2018 | A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications. Tatsuya Akutsu, Colin de la Higuera, Takeyuki Tamura |
| 2018 | A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment. Brian Brubach, Jay Ghurye |
| 2018 | Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018 Gonzalo Navarro, David Sankoff, Binhai Zhu |
| 2018 | Can a permutation be sorted by best short swaps?. Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, Haodi Feng |
| 2018 | Computing longest common square subsequences. Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda |
| 2018 | Dualities in Tree Representations. Rayan Chikhi, Alexander Schönhuth |
| 2018 | Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant. Brian Brubach |
| 2018 | Faster Online Elastic Degenerate String Matching. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2018 | Linear-Time Algorithm for Long LCF with k Mismatches. Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | Linear-time algorithms for the subpath kernel. Kilho Shin, Taichi Ishikawa |
| 2018 | Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. Amihood Amir, Itai Boneh |
| 2018 | Longest Lyndon Substring After Edit. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | Longest substring palindrome after edit. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | Lyndon Factorization of Grammar Compressed Texts Revisited. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | Maximal Common Subsequence Algorithms. Yoshifumi Sakai |
| 2018 | Nearest constrained circular words. Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme |
| 2018 | Non-Overlapping Indexing - Cache Obliviously. Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan |
| 2018 | On Undetected Redundancy in the Burrows-Wheeler Transform. Uwe Baier |
| 2018 | On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
| 2018 | Online LZ77 Parsing and Matching Statistics with RLBWTs. Hideo Bannai, Travis Gagie, Tomohiro I |
| 2018 | Order-Preserving Pattern Matching Indeterminate Strings. Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai |
| 2018 | Quasi-Periodicity Under Mismatch Errors. Amihood Amir, Avivit Levy, Ely Porat |
| 2018 | Slowing Down Top Trees for Better Worst-Case Compression. Bartlomiej Dudek, Pawel Gawrychowski |
| 2018 | Superstrings with multiplicities. Bastien Cazaux, Eric Rivals |
| 2018 | The Heaviest Induced Ancestors Problem Revisited. Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, Sharma V. Thankachan |