CPM 2021

32nd Annual Symposium on Combinatorial Pattern Matching

Wrocław, Poland, July 5–7, 2021


Papers and proceedings

Local information



Accepted papers (ordered by submission time)

Andrei Popa and Alexandru Popa. Efficient algorithms for counting gapped palindromes
Takuya Mieno, Solon Pissis, Michelle Sweering and Leen Stougie. String Sanitization Under Edit Distance: Improved and Generalized
Abhinav Nellore, Austin Nguyen and Reid Thompson. An invertible transform for efficient string matching in labeled digraphs
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl and Marcin Piątkowski. Constructing the Bijective BWT
Joshua Sobel, Noah Bertram, Chen Ding, Fatemeh Nargesian and Daniel Gildea. AWLCO: All-Window Length Co-Occurrence
Riccardo Dondi and Florian Sikora. The Longest Run Subsequence Problem: Further Complexity Results
Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park and Eric Rivals. A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen and Wiktor Zuba. Computing Covers of 2D-Strings
Philip Bille, Inge Li Gørtz, Max Pedersen and Teresa Anna Steiner. Gapped Indexing for Consecutive Occurrences
Meng He and Serikzhan Kazi. Data Structures for Categorical Path Counting Queries
Takaaki Nishimoto and Yasuo Tabei. R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space
Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon Pissis, Leen Stougie and Michelle Sweering. Constructing Strings Avoiding Forbidden Substrings
Shahbaz Khan. Optimal Construction of Hierarchical Overlap Graphs
Amihood Amir, Itai Boneh and Eitan Kondratovsky. The k-mappability problem revisited
Laurent Bulteau, Samuele Giraudo and Stéphane Vialette. Disorders and permutations
Duncan Adamson, Argyrios Deligkas, Vladimir Gusev and Igor Potapov. Ranking Bracelets in Polynomial Time
Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri and Rossano Venturini. Compressed Weighted de Bruijn Graphs
Djamal Belazzougui, Dmitry Kosolobov, Simon Puglisi and Rajeev Raman. Weighted Ancestors in Suffix Trees Revisited, recipient of the Best Paper Award
Dustin Cobas, Travis Gagie and Gonzalo Navarro. A Fast and Small Subsampled R-index
Keegan Yao and Mukul S. Bansal. Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance, recipient of the Best Student Paper Award
Sung-Hwan Kim and Hwan-Gue Cho. A Compact Index for Cartesian Tree Matching
Golnaz Badkobeh, Panagiotis Charalampopoulos and Solon Pissis. Internal Shortest Absent Word Queries