CPM 2020 Accepted Papers
Evangelos Kipouridis and Kostas Tsichlas. Longest Common Subsequence on Weighted Sequences Veli Mäkinen and Kristoffer Sahlin. Chaining with Overlaps Revisited 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 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 Julian Pape-Lange. On Extensions of Maximal Repeats in Compressed Strings
Aleksander Kędzierski and Jakub Radoszewski. k-Approximate Quasiperiodicity under Hamming and Edit Distance 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
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda and Ayumi Shinohara. Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences
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