<h2>LIPIcs, Volume 191, CPM 2021</h2>
<ul>
<li>
<span class="authors">Paweł Gawrychowski and Tatiana Starikovskaya</span>
<span class="title">LIPIcs, Volume 191, CPM 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021">10.4230/LIPIcs.CPM.2021</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski and Tatiana Starikovskaya</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.0">10.4230/LIPIcs.CPM.2021.0</a>
</li>
<li>
<span class="authors">Hideo Bannai</span>
<span class="title">Repetitions in Strings: A "Constant" Problem (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.1">10.4230/LIPIcs.CPM.2021.1</a>
</li>
<li>
<span class="authors">Michal Koucký</span>
<span class="title">Computing Edit Distance (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.2">10.4230/LIPIcs.CPM.2021.2</a>
</li>
<li>
<span class="authors">Nadia Pisanti</span>
<span class="title">On-Line Pattern Matching on D-Texts (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.3">10.4230/LIPIcs.CPM.2021.3</a>
</li>
<li>
<span class="authors">Duncan Adamson, Vladimir V. Gusev, Igor Potapov, and Argyrios Deligkas</span>
<span class="title">Ranking Bracelets in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.4">10.4230/LIPIcs.CPM.2021.4</a>
</li>
<li>
<span class="authors">Amihood Amir, Itai Boneh, and Eitan Kondratovsky</span>
<span class="title">The k-Mappability Problem Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.5">10.4230/LIPIcs.CPM.2021.5</a>
</li>
<li>
<span class="authors">Golnaz Badkobeh, Panagiotis Charalampopoulos, and Solon P. Pissis</span>
<span class="title">Internal Shortest Absent Word Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.6">10.4230/LIPIcs.CPM.2021.6</a>
</li>
<li>
<span class="authors">Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, and Marcin Piątkowski</span>
<span class="title">Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.7">10.4230/LIPIcs.CPM.2021.7</a>
</li>
<li>
<span class="authors">Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, and Rajeev Raman</span>
<span class="title">Weighted Ancestors in Suffix Trees Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.8">10.4230/LIPIcs.CPM.2021.8</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, and Michelle Sweering</span>
<span class="title">Constructing Strings Avoiding Forbidden Substrings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.9">10.4230/LIPIcs.CPM.2021.9</a>
</li>
<li>
<span class="authors">Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, and Teresa Anna Steiner</span>
<span class="title">Gapped Indexing for Consecutive Occurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.10">10.4230/LIPIcs.CPM.2021.10</a>
</li>
<li>
<span class="authors">Laurent Bulteau, Samuele Giraudo, and Stéphane Vialette</span>
<span class="title">Disorders and Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.11">10.4230/LIPIcs.CPM.2021.11</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Computing Covers of 2D-Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.12">10.4230/LIPIcs.CPM.2021.12</a>
</li>
<li>
<span class="authors">Dustin Cobas, Travis Gagie, and Gonzalo Navarro</span>
<span class="title">A Fast and Small Subsampled R-Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.13">10.4230/LIPIcs.CPM.2021.13</a>
</li>
<li>
<span class="authors">Riccardo Dondi and Florian Sikora</span>
<span class="title">The Longest Run Subsequence Problem: Further Complexity Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.14">10.4230/LIPIcs.CPM.2021.14</a>
</li>
<li>
<span class="authors">Meng He and Serikzhan Kazi</span>
<span class="title">Data Structures for Categorical Path Counting Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.15">10.4230/LIPIcs.CPM.2021.15</a>
</li>
<li>
<span class="authors">Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, and Rossano Venturini</span>
<span class="title">Compressed Weighted de Bruijn Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.16">10.4230/LIPIcs.CPM.2021.16</a>
</li>
<li>
<span class="authors">Shahbaz Khan</span>
<span class="title">Optimal Construction of Hierarchical Overlap Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.17">10.4230/LIPIcs.CPM.2021.17</a>
</li>
<li>
<span class="authors">Sung-Hwan Kim and Hwan-Gue Cho</span>
<span class="title">A Compact Index for Cartesian Tree Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.18">10.4230/LIPIcs.CPM.2021.18</a>
</li>
<li>
<span class="authors">Takuya Mieno, Solon P. Pissis, Leen Stougie, and Michelle Sweering</span>
<span class="title">String Sanitization Under Edit Distance: Improved and Generalized</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.19">10.4230/LIPIcs.CPM.2021.19</a>
</li>
<li>
<span class="authors">Abhinav Nellore, Austin Nguyen, and Reid F. Thompson</span>
<span class="title">An Invertible Transform for Efficient String Matching in Labeled Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.20">10.4230/LIPIcs.CPM.2021.20</a>
</li>
<li>
<span class="authors">Takaaki Nishimoto and Yasuo Tabei</span>
<span class="title">R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.21">10.4230/LIPIcs.CPM.2021.21</a>
</li>
<li>
<span class="authors">Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, and Eric Rivals</span>
<span class="title">A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.22">10.4230/LIPIcs.CPM.2021.22</a>
</li>
<li>
<span class="authors">Andrei Popa and Alexandru Popa</span>
<span class="title">Efficient Algorithms for Counting Gapped Palindromes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.23">10.4230/LIPIcs.CPM.2021.23</a>
</li>
<li>
<span class="authors">Joshua Sobel, Noah Bertram, Chen Ding, Fatemeh Nargesian, and Daniel Gildea</span>
<span class="title">AWLCO: All-Window Length Co-Occurrence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.24">10.4230/LIPIcs.CPM.2021.24</a>
</li>
<li>
<span class="authors">Keegan Yao and Mukul S. Bansal</span>
<span class="title">Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2021.25">10.4230/LIPIcs.CPM.2021.25</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