LIPIcs, Volume 105, CPM 2018

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