<h2>LIPIcs, Volume 161, CPM 2020</h2>
<ul>
<li>
<span class="authors">Inge Li Gørtz and Oren Weimann</span>
<span class="title">LIPIcs, Volume 161, CPM 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020">10.4230/LIPIcs.CPM.2020</a>
</li>
<li>
<span class="authors">Inge Li Gørtz and Oren Weimann</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.0">10.4230/LIPIcs.CPM.2020.0</a>
</li>
<li>
<span class="authors">Thore Husfeldt</span>
<span class="title">Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.1">10.4230/LIPIcs.CPM.2020.1</a>
</li>
<li>
<span class="authors">Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, and Kunihiro Wasa</span>
<span class="title">Finding the Anticover of a String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.2">10.4230/LIPIcs.CPM.2020.2</a>
</li>
<li>
<span class="authors">Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, and Dina Sokol</span>
<span class="title">Double String Tandem Repeats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.3">10.4230/LIPIcs.CPM.2020.3</a>
</li>
<li>
<span class="authors">Djamal Belazzougui and Gregory Kucherov</span>
<span class="title">Efficient Tree-Structured Categorical Retrieval</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.4">10.4230/LIPIcs.CPM.2020.4</a>
</li>
<li>
<span class="authors">Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, and Matan Kraus</span>
<span class="title">Time-Space Tradeoffs for Finding a Long Common Substring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.5">10.4230/LIPIcs.CPM.2020.5</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Paola Bonizzoni, and Paweł Gawrychowski</span>
<span class="title">On Two Measures of Distance Between Fully-Labelled Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.6">10.4230/LIPIcs.CPM.2020.6</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, and Michelle Sweering</span>
<span class="title">String Sanitization Under Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.7">10.4230/LIPIcs.CPM.2020.7</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Counting Distinct Patterns in Internal Dictionary Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.8">10.4230/LIPIcs.CPM.2020.8</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Tomasz Kociumaka, and Shay Mozes</span>
<span class="title">Dynamic String Alignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.9">10.4230/LIPIcs.CPM.2020.9</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Unary Words Have the Smallest Levenshtein k-Neighbourhoods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.10">10.4230/LIPIcs.CPM.2020.10</a>
</li>
<li>
<span class="authors">Patty Commins, David Liben-Nowell, Tina Liu, and Kiran Tomlinson</span>
<span class="title">Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.11">10.4230/LIPIcs.CPM.2020.11</a>
</li>
<li>
<span class="authors">Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, and Ayumi Shinohara</span>
<span class="title">Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.12">10.4230/LIPIcs.CPM.2020.12</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oğuzhan Külekci, and Sharma V. Thankachan</span>
<span class="title">FM-Index Reveals the Reverse Suffix Array</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.13">10.4230/LIPIcs.CPM.2020.13</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Samah Ghazawi, and Gad M. Landau</span>
<span class="title">On Indeterminate Strings Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.14">10.4230/LIPIcs.CPM.2020.14</a>
</li>
<li>
<span class="authors">Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, and Ely Porat</span>
<span class="title">The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.15">10.4230/LIPIcs.CPM.2020.15</a>
</li>
<li>
<span class="authors">Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, and Tatiana Starikovskaya</span>
<span class="title">Approximating Longest Common Substring with k mismatches: Theory and Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.16">10.4230/LIPIcs.CPM.2020.16</a>
</li>
<li>
<span class="authors">Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer</span>
<span class="title">String Factorizations Under Various Collision Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.17">10.4230/LIPIcs.CPM.2020.17</a>
</li>
<li>
<span class="authors">Aleksander Kędzierski and Jakub Radoszewski</span>
<span class="title">k-Approximate Quasiperiodicity under Hamming and Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.18">10.4230/LIPIcs.CPM.2020.18</a>
</li>
<li>
<span class="authors">Evangelos Kipouridis and Kostas Tsichlas</span>
<span class="title">Longest Common Subsequence on Weighted Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.19">10.4230/LIPIcs.CPM.2020.19</a>
</li>
<li>
<span class="authors">Tomohiro Koana, Vincent Froese, and Rolf Niedermeier</span>
<span class="title">Parameterized Algorithms for Matrix Completion with Radius Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.20">10.4230/LIPIcs.CPM.2020.20</a>
</li>
<li>
<span class="authors">Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, and Ayumi Shinohara</span>
<span class="title">In-Place Bijective Burrows-Wheeler Transforms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.21">10.4230/LIPIcs.CPM.2020.21</a>
</li>
<li>
<span class="authors">Manuel Lafond, Binhai Zhu, and Peng Zou</span>
<span class="title">Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.22">10.4230/LIPIcs.CPM.2020.22</a>
</li>
<li>
<span class="authors">Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, and Masakazu Tateshita</span>
<span class="title">Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.23">10.4230/LIPIcs.CPM.2020.23</a>
</li>
<li>
<span class="authors">J. Ian Munro, Gonzalo Navarro, and Yakov Nekrich</span>
<span class="title">Text Indexing and Searching in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.24">10.4230/LIPIcs.CPM.2020.24</a>
</li>
<li>
<span class="authors">Veli Mäkinen and Kristoffer Sahlin</span>
<span class="title">Chaining with Overlaps Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.25">10.4230/LIPIcs.CPM.2020.25</a>
</li>
<li>
<span class="authors">Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Masayuki Takeda</span>
<span class="title">DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.26">10.4230/LIPIcs.CPM.2020.26</a>
</li>
<li>
<span class="authors">Julian Pape-Lange</span>
<span class="title">On Extensions of Maximal Repeats in Compressed Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.27">10.4230/LIPIcs.CPM.2020.27</a>
</li>
<li>
<span class="authors">Nathan Schaar, Vincent Froese, and Rolf Niedermeier</span>
<span class="title">Faster Binary Mean Computation Under Dynamic Time Warping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.28">10.4230/LIPIcs.CPM.2020.28</a>
</li>
<li>
<span class="authors">Przemysław Uznański</span>
<span class="title">Approximating Text-To-Pattern Distance via Dimensionality Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CPM.2020.29">10.4230/LIPIcs.CPM.2020.29</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