default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd CPM 2021: Wrocław, Poland
- Pawel Gawrychowski
, Tatiana Starikovskaya:
32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wrocław, Poland, July 5-7, 2021. LIPIcs 191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-186-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:14
- Hideo Bannai:
Repetitions in Strings: A "Constant" Problem (Invited Talk). 1:1-1:1 - Michal Koucký:
Computing Edit Distance (Invited Talk). 2:1-2:1 - Nadia Pisanti:
On-Line Pattern Matching on D-Texts (Invited Talk). 3:1-3:2 - Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas:
Ranking Bracelets in Polynomial Time. 4:1-4:17 - Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-Mappability Problem Revisited. 5:1-5:20 - Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis:
Internal Shortest Absent Word Queries. 6:1-6:18 - Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. 7:1-7:16 - Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. 8:1-8:15 - Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Constructing Strings Avoiding Forbidden Substrings. 9:1-9:18 - Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. 10:1-10:19 - Laurent Bulteau, Samuele Giraudo, Stéphane Vialette:
Disorders and Permutations. 11:1-11:15 - Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Computing Covers of 2D-Strings. 12:1-12:20 - Dustin Cobas, Travis Gagie, Gonzalo Navarro:
A Fast and Small Subsampled R-Index. 13:1-13:16 - Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. 14:1-14:15 - Meng He, Serikzhan Kazi:
Data Structures for Categorical Path Counting Queries. 15:1-15:17 - Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini:
Compressed Weighted de Bruijn Graphs. 16:1-16:16 - Shahbaz Khan:
Optimal Construction of Hierarchical Overlap Graphs. 17:1-17:11 - Sung-Hwan Kim, Hwan-Gue Cho:
A Compact Index for Cartesian Tree Matching. 18:1-18:19 - Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. 19:1-19:18 - Abhinav Nellore, Austin Nguyen, Reid F. Thompson:
An Invertible Transform for Efficient String Matching in Labeled Digraphs. 20:1-20:14 - Takaaki Nishimoto, Yasuo Tabei:
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space. 21:1-21:21 - Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals:
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. 22:1-22:9 - Andrei Popa, Alexandru Popa:
Efficient Algorithms for Counting Gapped Palindromes. 23:1-23:13 - Joshua Sobel, Noah Bertram, Chen Ding, Fatemeh Nargesian, Daniel Gildea:
AWLCO: All-Window Length Co-Occurrence. 24:1-24:21 - Keegan Yao, Mukul S. Bansal:
Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance. 25:1-25:23
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-28 01:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
