CPM 2023

34th Annual Symposium on Combinatorial Pattern Matching

Marne-la-Vallée, France, June 26–28, 2023

Programme

    Skip to day:
  1. Monday
  2. Tuesday
  3. Wednesday
PDF version

Monday, June 26, 2023

08:50 - 09:00Opening remarks
Keynote Talk 1 (Chair: Zsuzsanna Lipták)
09:00 - 10:00

Olgica Milenkovic

Load Balancing for Distributed Storage Codes with Dynamically Changing File Popularities
10:00 - 10:20Break
Session 1 (Chair: Gonzalo Navarro)
10:20 - 10:45

Grigorios Loukides, Solon Pissis, Sharma V. Thankachan and Wiktor Zuba

Suffix-Prefix Queries on a DictionaryPaper #21
10:45 - 11:10

Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya and Teresa Anna Steiner

Compressed Indexing for Consecutive OccurrencesPaper #12
11:10 - 11:35

Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen and Tord Joakim Stordalen

Sliding Window String Indexing in Streams (Best student paper)Paper #4
11:35 - 12:00

Shinya Nagashita and Tomohiro I

PalFM-index: FM-index for Palindrome Pattern MatchingPaper #23
12:00 - 13:30Lunch
Session 2 (Chair: Golnaz Badkobeh)
13:30 - 14:00

Zachary Chase

Separating words and trace reconstruction (Highlight Talk 1)
14:00 - 14:25

Estéban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon Pissis, Jakub Radoszewski, Michelle Sweering and Wiktor Zuba

Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and ApplicationsPaper #11
14:25 - 14:50

Sung-Hwan Kim, Francisco Olivares and Nicola Prezza

Faster Prefix-Sorting Algorithms for Deterministic Finite AutomataPaper #16
14:50 - 15:20Break
Session 3 (Chair: Marinella Sciortino)
15:20 - 15:45

Pawel Gawrychowski, Samah Ghazawi and Gad M. Landau

Order-Preserving Squares in StringsPaper #13
15:45 - 16:10

Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń and Wiktor Zuba

Linear Time Computation of Cyclic Roots and Cyclic Covers of a StringPaper #15
16:10 - 16:35

Manuel Cáceres

Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond (Best paper)Paper #7
16:35 - 17:00

Aaron Boussidan, Pierre Bourhis and Philippe Gambette

On Distances between Words with ParametersPaper #6
17:00 - 17:20Break
17:20 - 18:10Business meeting

Back to top

Tuesday, June 27, 2023

Keynote Talk 2 (Chair: Laurent Bulteau)
09:00 - 10:00

Tatiana Starikovskaya

Approximate membership in formal languages
10:00 - 10:20Break
Session 4 (Chair: Yuto Nakashima)
10:20 - 10:45

Gonzalo Navarro

Computing MEMs on Repetitive Text CollectionsPaper #24
10:45 - 11:10

Igor Tatarnikov, Ardavan Shahrabi Farahani, Sana Kashgouli and Travis Gagie

MONI can find k-MEMsPaper #26
11:10 - 11:35

Dominik Köppl

Encoding Hard String Problems with Answer Set ProgrammingPaper #17
11:35 - 12:00

Massimo Equi, Arianne Meijer van de Griend and Veli Mäkinen

From Bit-Parallelism to Quantum String Matching for Labelled GraphsPaper #9
12:00 - 13:30Lunch
Session 5 (Chair: Hideo Bannai)
13:30 - 14:00

Zoe Xi and William Kuszmaul

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings (Highlight Talk 2)
14:00 - 14:25

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono and Shunichi Tanaka

Approximation Algorithms for the Longest Run Subsequence ProblemPaper #2
14:25 - 14:50

Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat and Yonathan Sadia

String Factorization via Prefix Free FamiliesPaper #19
15:00Excursion and conference dinner

Back to top

Wednesday, June 28, 2023

Keynote Talk 3 (Chair: Inge Li Gørtz)
09:00 - 10:00

Virginia Vassilevska Williams

Fredman’s Trick Meets Dominance Product: counting and detection equivalences and more
10:00 - 10:20Break
Session 6 (Chair: Avivit Levy)
10:20 - 10:45

Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim and Wing-Kin Sung

MUL-Tree Pruning for Consistency and CompatibilityPaper #14
10:45 - 11:10

Christian Komusiewicz, Simone Linz, Nils Morawietz and Jannik Schestag

On the Complexity of Parameterized Local Search for the Maximum Parsimony ProblemPaper #18
11:10 - 11:35

Itai Boneh, Dvir Fried, Adrian Miclăuș and Alexandru Popa

Faster algorithms for computing the hairpin completion distance and minimum ancestorPaper #5
11:35 - 12:00

Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski and Karol Pokorski

Optimal Heaviest Induced AncestorsPaper #8
12:00 - 13:30Lunch
Session 7 (Chair: Pawel Gawrychowski)
13:30 - 13:55

Eugene Myers

Merging Sorted Lists of Similar StringsPaper #22
13:55 - 14:20

Gregory Kucherov and Steven Skiena

Improving the Sensitivity of MinHash Through Hash-Value AnalysisPaper #20
14:20 - 14:45

Diego Arroyuelo and Juan Pablo Castillo

Trie-Compressed Adaptive Set IntersectionPaper #1
14:45 - 15:15Break
Session 8 (Chair: Marie-Pierre Béal)
15:15 - 15:40

Gabriele Fici, Giuseppe Romana, Marinella Sciortino and Cristian Urbina

On the impact of morphisms on BWT-runsPaper #10
15:40 - 16:05

Gonzalo Navarro and Cristian Urbina

L-systems for measuring repetitivenessPaper #25
16:05 - 16:30

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto and Takeaki Uno

Optimal LZ-End Parsing is HardPaper #3
16:30 - 16:40Closing remarks

Back to top