<h2>LIPIcs, Volume 128, CPM 2019</h2>
<ul>
<li>
<span class="authors">Nadia Pisanti and Solon P. Pissis</span>
<span class="title">LIPIcs, Volume 128, CPM'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019">10.4230/LIPIcs.CPM.2019</a>
</li>
<li>
<span class="authors">Nadia Pisanti and Solon P. Pissis</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.0">10.4230/LIPIcs.CPM.2019.0</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski</span>
<span class="title">How to Exploit Periodicity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.1">10.4230/LIPIcs.CPM.2019.1</a>
</li>
<li>
<span class="authors">Francesco Dolce, Antonio Restivo, and Christophe Reutenauer</span>
<span class="title">Some Variations on Lyndon Words (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.2">10.4230/LIPIcs.CPM.2019.2</a>
</li>
<li>
<span class="authors">Michal Ziv-Ukelson</span>
<span class="title">Stringology Combats Microbiological Threats (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.3">10.4230/LIPIcs.CPM.2019.3</a>
</li>
<li>
<span class="authors">Nicola Prezza</span>
<span class="title">Optimal Rank and Select Queries on Dictionary-Compressed Text</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.4">10.4230/LIPIcs.CPM.2019.4</a>
</li>
<li>
<span class="authors">Haitao Jiang, Jiong Guo, Daming Zhu, and Binhai Zhu</span>
<span class="title">A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.5">10.4230/LIPIcs.CPM.2019.5</a>
</li>
<li>
<span class="authors">Amihood Amir and Eitan Kondratovsky</span>
<span class="title">Sufficient Conditions for Efficient Indexing Under Different Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.6">10.4230/LIPIcs.CPM.2019.6</a>
</li>
<li>
<span class="authors">Nicola Prezza and Giovanna Rosone</span>
<span class="title">Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.7">10.4230/LIPIcs.CPM.2019.7</a>
</li>
<li>
<span class="authors">Niko Kiirala, Leena Salmela, and Alexandru I. Tomescu</span>
<span class="title">Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.8">10.4230/LIPIcs.CPM.2019.8</a>
</li>
<li>
<span class="authors">Takaaki Nishimoto and Yasuo Tabei</span>
<span class="title">Conversion from RLBWT to LZ77</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.9">10.4230/LIPIcs.CPM.2019.9</a>
</li>
<li>
<span class="authors">Djamal Belazzougui and Fabio Cunial</span>
<span class="title">Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.10">10.4230/LIPIcs.CPM.2019.10</a>
</li>
<li>
<span class="authors">Michał Gańczorz</span>
<span class="title">Entropy Lower Bounds for Dictionary Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.11">10.4230/LIPIcs.CPM.2019.11</a>
</li>
<li>
<span class="authors">Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, and Marinella Sciortino</span>
<span class="title">A New Class of Searchable and Provably Highly Compressible String Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.12">10.4230/LIPIcs.CPM.2019.12</a>
</li>
<li>
<span class="authors">Dmitry Kosolobov and Nikita Sivukhin</span>
<span class="title">Compressed Multiple Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.13">10.4230/LIPIcs.CPM.2019.13</a>
</li>
<li>
<span class="authors">Karim Labib, Przemysław Uznański, and Daniel Wolleb-Graf</span>
<span class="title">Hamming Distance Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.14">10.4230/LIPIcs.CPM.2019.14</a>
</li>
<li>
<span class="authors">Jan Studený and Przemysław Uznański</span>
<span class="title">Approximating Approximate Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.15">10.4230/LIPIcs.CPM.2019.15</a>
</li>
<li>
<span class="authors">Sung Gwan Park, Amihood Amir, Gad M. Landau, and Kunsoo Park</span>
<span class="title">Cartesian Tree Matching and Indexing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.16">10.4230/LIPIcs.CPM.2019.16</a>
</li>
<li>
<span class="authors">Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, and Marcin Pia̧tkowski</span>
<span class="title">Indexing the Bijective BWT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.17">10.4230/LIPIcs.CPM.2019.17</a>
</li>
<li>
<span class="authors">Julian Pape-Lange</span>
<span class="title">On Maximal Repeats in Compressed Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.18">10.4230/LIPIcs.CPM.2019.18</a>
</li>
<li>
<span class="authors">Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, and Brigitte Vallée</span>
<span class="title">Dichotomic Selection on Words: A Probabilistic Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.19">10.4230/LIPIcs.CPM.2019.19</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, and Stéphane Vialette</span>
<span class="title">Finding a Small Number of Colourful Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.20">10.4230/LIPIcs.CPM.2019.20</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski and Tatiana Starikovskaya</span>
<span class="title">Streaming Dictionary Matching with Mismatches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.21">10.4230/LIPIcs.CPM.2019.21</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Jakub Radoszewski, and Tatiana Starikovskaya</span>
<span class="title">Quasi-Periodicity in Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.22">10.4230/LIPIcs.CPM.2019.22</a>
</li>
<li>
<span class="authors">Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Computing Runs on a Trie</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.23">10.4230/LIPIcs.CPM.2019.23</a>
</li>
<li>
<span class="authors">Bastien Cazaux and Eric Rivals</span>
<span class="title">Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.24">10.4230/LIPIcs.CPM.2019.24</a>
</li>
<li>
<span class="authors">Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Quasi-Linear-Time Algorithm for Longest Common Circular Factor</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.25">10.4230/LIPIcs.CPM.2019.25</a>
</li>
<li>
<span class="authors">Diego Díaz-Domínguez, Travis Gagie, and Gonzalo Navarro</span>
<span class="title">Simulating the DNA Overlap Graph in Succinct Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.26">10.4230/LIPIcs.CPM.2019.26</a>
</li>
<li>
<span class="authors">Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Faster Queries for Longest Substring Palindrome After Block Edit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.27">10.4230/LIPIcs.CPM.2019.27</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, and Murray Patterson</span>
<span class="title">A Rearrangement Distance for Fully-Labelled Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.28">10.4230/LIPIcs.CPM.2019.28</a>
</li>
<li>
<span class="authors">Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.29">10.4230/LIPIcs.CPM.2019.29</a>
</li>
<li>
<span class="authors">Diptarama Hendrian, Takuya Takagi, and Shunsuke Inenaga</span>
<span class="title">Online Algorithms for Constructing Linear-Size Suffix Trie</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.30">10.4230/LIPIcs.CPM.2019.30</a>
</li>
<li>
<span class="authors">Oleg Merkurev and Arseny M. Shur</span>
<span class="title">Searching Long Repeats in Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.31">10.4230/LIPIcs.CPM.2019.31</a>
</li>
<li>
<span class="authors">Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, and Simon J. Puglisi</span>
<span class="title">Computing the Antiperiod(s) of a String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2019.32">10.4230/LIPIcs.CPM.2019.32</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