default search action
34th CPM 2023: Marne-la-Vallée, France
- Laurent Bulteau
, Zsuzsanna Lipták
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. LIPIcs 259, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-276-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Diego Arroyuelo, Juan Pablo Castillo:
Trie-Compressed Adaptive Set Intersection. 1:1-1:19 - Yuichi Asahiro, Hiroshi Eto, Mingyang Gong
Approximation Algorithms for the Longest Run Subsequence Problem. 2:1-2:12 - Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. 3:1-3:11 - Philip Bille
Sliding Window String Indexing in Streams. 4:1-4:18 - Itai Boneh, Dvir Fried, Adrian Miclaus, Alexandru Popa:
Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor. 5:1-5:18 - Pierre Bourhis, Aaron Boussidan, Philippe Gambette:
On Distances Between Words with Parameters. 6:1-6:23 - Manuel Cáceres
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. 7:1-7:19 - Panagiotis Charalampopoulos
Optimal Near-Linear Space Heaviest Induced Ancestors. 8:1-8:18 - Massimo Equi, Arianne Meijer-van de Griend
From Bit-Parallelism to Quantum String Matching for Labelled Graphs. 9:1-9:20 - Gabriele Fici
On the Impact of Morphisms on BWT-Runs. 10:1-10:18 - Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. 11:1-11:20 - Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner
Compressed Indexing for Consecutive Occurrences. 12:1-12:22 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. 13:1-13:19 - Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson
MUL-Tree Pruning for Consistency and Compatibility. 14:1-14:18 - Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. 15:1-15:15 - Sung-Hwan Kim, Francisco Olivares
Faster Prefix-Sorting Algorithms for Deterministic Finite Automata. 16:1-16:16 - Dominik Köppl
Encoding Hard String Problems with Answer Set Programming. 17:1-17:21 - Christian Komusiewicz, Simone Linz
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. 18:1-18:18 - Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia:
String Factorization via Prefix Free Families. 19:1-19:10 - Gregory Kucherov, Steven Skiena
Improving the Sensitivity of MinHash Through Hash-Value Analysis. 20:1-20:12 - Grigorios Loukides, Solon P. Pissis
Suffix-Prefix Queries on a Dictionary. 21:1-21:20 - Gene Myers:
Merging Sorted Lists of Similar Strings. 22:1-22:15 - Shinya Nagashita, Tomohiro I:
PalFM-Index: FM-Index for Palindrome Pattern Matching. 23:1-23:15 - Gonzalo Navarro:
Computing MEMs on Repetitive Text Collections. 24:1-24:17 - Gonzalo Navarro, Cristian Urbina:
L-Systems for Measuring Repetitiveness. 25:1-25:17 - Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli, Travis Gagie:
MONI Can Find k-MEMs. 26:1-26:14
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 2024-11-22 19:47 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: