CPM 2020 Accepted Papers

Panagiotis Charalampopoulos, Solon Pissis, Jakub Radoszewski, Tomasz Walen and Wiktor Zuba. Unary Words Have the Smallest Levenshtein k-Neighbourhoods
Evangelos Kipouridis and Kostas Tsichlas. Longest Common Subsequence on Weighted Sequences
Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon Pissis, Leen Stougie and Michelle Sweering. String Sanitization under Edit Distance
Veli Mäkinen and Kristoffer Sahlin. Chaining with Overlaps Revisited
Przemysław Uznański. Approximating Text-to-Pattern distance via dimensionality reduction
Nathan Schaar, Vincent Froese and Rolf Niedermeier. Faster Binary Mean Computation Under Dynamic Time Warping
Tomohiro Koana, Vincent Froese and Rolf Niedermeier. Parameterized Algorithms for Matrix Completion With Radius Constraints
Patty Commins, David Liben-Nowell, Tina Liu and Kiran Tomlinson. Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions
Stav Ben Nun, Shay Golan, Tomasz Kociumaka and Matan Kraus. Time-Space Tradeoffs for Finding a Long Common Substring
Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus and Dina Sokol. Double String Tandem Repeats
Manuel Lafond, Binhai Zhu and Peng Zou. Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya and Masakazu Tateshita. Compressed Orthogonal Search on Suffix Arrays with applications to Range LCP
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń and Wiktor Zuba. Counting Distinct Patterns in Internal Dictionary Matching
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski and Tatiana Starikovskaya. Approximating longest common substring with k mismatches: Theory and practice
Panagiotis Charalampopoulos, Tomasz Kociumaka and Shay Mozes. Dynamic String Alignment
Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Kulekci and Sharma V. Thankachan. FM-Index Reveals the Reverse Suffix Array
Julian Pape-Lange. On Extensions of Maximal Repeats in Compressed Strings
Ian Munro, Gonzalo Navarro and Yakov Nekrich. Text Indexing and Searching in Sublinear Time
Aleksander Kędzierski and Jakub Radoszewski. k-Approximate Quasiperiodicity under Hamming and Edit Distance
Giulia Bernardini, Paola Bonizzoni and Pawel Gawrychowski. On Two Measures of Distance between Fully-Labelled Trees
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara and Masayuki Takeda. DAWGs for parameterized matching: online construction and related indexing structures
Pawel Gawrychowski, Samah Ghazawi and Gad M. Landau. On Indeterminate Strings Matching
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz and Ely Porat. The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda and Ayumi Shinohara. Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian and Ayumi Shinohara. In-Place Bijective Burrows Wheeler Transformations
Djamal Belazzougui and Gregory Kucherov. Efficient tree-structured categorical retrieval
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas Iliopoulos, Kazuhiro Kurita and Kunihiro Wasa. Finding the Anticover of a String
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz and Frank Sommer. String Factorizations under Various Collision Constraints