default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st CPM 2020: Copenhagen, Denmark
- Inge Li Gørtz
, Oren Weimann:
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. LIPIcs 161, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-149-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Thore Husfeldt:
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). 1:1-1:1 - Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. 2:1-2:11 - Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. 3:1-3:13 - Djamal Belazzougui, Gregory Kucherov:
Efficient Tree-Structured Categorical Retrieval. 4:1-4:11 - Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus:
Time-Space Tradeoffs for Finding a Long Common Substring. 5:1-5:14 - Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance Between Fully-Labelled Trees. 6:1-6:16 - Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance. 7:1-7:14 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. 8:1-8:15 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes:
Dynamic String Alignment. 9:1-9:13 - Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba:
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. 10:1-10:12 - Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. 11:1-11:15 - Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. 12:1-12:11 - Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan:
FM-Index Reveals the Reverse Suffix Array. 13:1-13:14 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
On Indeterminate Strings Matching. 14:1-14:14 - Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. 15:1-15:15 - Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. 16:1-16:15 - Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
String Factorizations Under Various Collision Constraints. 17:1-17:14 - Aleksander Kedzierski, Jakub Radoszewski:
k-Approximate Quasiperiodicity under Hamming and Edit Distance. 18:1-18:15 - Evangelos Kipouridis, Kostas Tsichlas:
Longest Common Subsequence on Weighted Sequences. 19:1-19:15 - Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion with Radius Constraints. 20:1-20:14 - Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara:
In-Place Bijective Burrows-Wheeler Transforms. 21:1-21:15 - Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. 22:1-22:15 - Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita:
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. 23:1-23:13 - J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Text Indexing and Searching in Sublinear Time. 24:1-24:15 - Veli Mäkinen, Kristoffer Sahlin:
Chaining with Overlaps Revisited. 25:1-25:12 - Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda:
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. 26:1-26:14 - Julian Pape-Lange:
On Extensions of Maximal Repeats in Compressed Strings. 27:1-27:13 - Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. 28:1-28:13 - Przemyslaw Uznanski:
Approximating Text-To-Pattern Distance via Dimensionality Reduction. 29:1-29:11
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-16 00:24 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:
