<h2>LIPIcs, Volume 105, CPM 2018</h2>
<ul>
<li>
<span class="authors">Gonzalo Navarro, David Sankoff, and Binhai Zhu</span>
<span class="title">LIPIcs, Volume 105, CPM'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018">10.4230/LIPIcs.CPM.2018</a>
</li>
<li>
<span class="authors">Gonzalo Navarro, David Sankoff, and Binhai Zhu</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.0">10.4230/LIPIcs.CPM.2018.0</a>
</li>
<li>
<span class="authors">Yoshifumi Sakai</span>
<span class="title">Maximal Common Subsequence Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.1">10.4230/LIPIcs.CPM.2018.1</a>
</li>
<li>
<span class="authors">Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, and Hideo Bannai</span>
<span class="title">Order-Preserving Pattern Matching Indeterminate Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.2">10.4230/LIPIcs.CPM.2018.2</a>
</li>
<li>
<span class="authors">Uwe Baier</span>
<span class="title">On Undetected Redundancy in the Burrows-Wheeler Transform</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.3">10.4230/LIPIcs.CPM.2018.3</a>
</li>
<li>
<span class="authors">Amihood Amir, Avivit Levy, and Ely Porat</span>
<span class="title">Quasi-Periodicity Under Mismatch Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.4">10.4230/LIPIcs.CPM.2018.4</a>
</li>
<li>
<span class="authors">Brian Brubach</span>
<span class="title">Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.5">10.4230/LIPIcs.CPM.2018.5</a>
</li>
<li>
<span class="authors">Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, and Élise Vandomme</span>
<span class="title">Nearest constrained circular words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.6">10.4230/LIPIcs.CPM.2018.6</a>
</li>
<li>
<span class="authors">Hideo Bannai, Travis Gagie, and Tomohiro I</span>
<span class="title">Online LZ77 Parsing and Matching Statistics with RLBWTs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.7">10.4230/LIPIcs.CPM.2018.7</a>
</li>
<li>
<span class="authors">Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, and Sharma V. Thankachan</span>
<span class="title">Non-Overlapping Indexing - Cache Obliviously</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.8">10.4230/LIPIcs.CPM.2018.8</a>
</li>
<li>
<span class="authors">Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Faster Online Elastic Degenerate String Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.9">10.4230/LIPIcs.CPM.2018.9</a>
</li>
<li>
<span class="authors">Tatsuya Akutsu, Colin de la Higuera, and Takeyuki Tamura</span>
<span class="title">A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.10">10.4230/LIPIcs.CPM.2018.10</a>
</li>
<li>
<span class="authors">Amihood Amir and Itai Boneh</span>
<span class="title">Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.11">10.4230/LIPIcs.CPM.2018.11</a>
</li>
<li>
<span class="authors">Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Longest substring palindrome after edit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.12">10.4230/LIPIcs.CPM.2018.12</a>
</li>
<li>
<span class="authors">Brian Brubach and Jay Ghurye</span>
<span class="title">A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.13">10.4230/LIPIcs.CPM.2018.13</a>
</li>
<li>
<span class="authors">Shu Zhang, Daming Zhu, Haitao Jiang, Jingjing Ma, Jiong Guo, and Haodi Feng</span>
<span class="title">Can a permutation be sorted by best short swaps?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.14">10.4230/LIPIcs.CPM.2018.14</a>
</li>
<li>
<span class="authors">Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Computing longest common square subsequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.15">10.4230/LIPIcs.CPM.2018.15</a>
</li>
<li>
<span class="authors">Bartlomiej Dudek and Pawel Gawrychowski</span>
<span class="title">Slowing Down Top Trees for Better Worst-Case Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.16">10.4230/LIPIcs.CPM.2018.16</a>
</li>
<li>
<span class="authors">Guillaume Fertin, Julien Fradin, and Christian Komusiewicz</span>
<span class="title">On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.17">10.4230/LIPIcs.CPM.2018.17</a>
</li>
<li>
<span class="authors">Rayan Chikhi and Alexander Schönhuth</span>
<span class="title">Dualities in Tree Representations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.18">10.4230/LIPIcs.CPM.2018.18</a>
</li>
<li>
<span class="authors">Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Longest Lyndon Substring After Edit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.19">10.4230/LIPIcs.CPM.2018.19</a>
</li>
<li>
<span class="authors">Paniz Abedin, Sahar Hooshmand, Arnab Ganguly, and Sharma V. Thankachan</span>
<span class="title">The Heaviest Induced Ancestors Problem Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.20">10.4230/LIPIcs.CPM.2018.20</a>
</li>
<li>
<span class="authors">Bastien Cazaux and Eric Rivals</span>
<span class="title">Superstrings with multiplicities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.21">10.4230/LIPIcs.CPM.2018.21</a>
</li>
<li>
<span class="authors">Kilho Shin and Taichi Ishikawa</span>
<span class="title">Linear-time algorithms for the subpath kernel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.22">10.4230/LIPIcs.CPM.2018.22</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen</span>
<span class="title">Linear-Time Algorithm for Long LCF with k Mismatches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.23">10.4230/LIPIcs.CPM.2018.23</a>
</li>
<li>
<span class="authors">Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Lyndon Factorization of Grammar Compressed Texts Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2018.24">10.4230/LIPIcs.CPM.2018.24</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing