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
    Select timezone:
  1. Venue time
  2. My local time

Monday, June 26, 2023

08:50 - 09:00Opening remarks
Keynote Talk 1
09:00 - 10:00

Olgica Milenkovic

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

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

Suffix-Prefix Queries on a Dictionary
10:45 - 11:10

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

Compressed Indexing for Consecutive Occurrences
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
11:35 - 12:00

Shinya Nagashita and Tomohiro I

PalFM-index: FM-index for Palindrome Pattern Matching
12:00 - 13:30Lunch
Highlight Talk 1
13:30 - 14:00

Zachary Chase

Separating words and trace reconstruction
Session 2
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 Applications
14:25 - 14:50

Sung-Hwan Kim, Francisco Olivares and Nicola Prezza

Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
14:50 - 15:20Break
Session 3
15:20 - 15:45

Pawel Gawrychowski, Samah Ghazawi and Gad M. Landau

Order-Preserving Squares in Strings
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 String
16:10 - 16:35

Manuel Cáceres

Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
16:35 - 17:00

Aaron Boussidan, Pierre Bourhis and Philippe Gambette

On Distances between Words with Parameters
17:00 - 17:20Break
17:20 - 17:50Business meeting

Back to top

Tuesday, June 27, 2023

Keynote Talk 2
09:00 - 10:00

Tatiana Starikovskaya

TBA
10:00 - 10:20Break
Session 4
10:20 - 10:45

Gonzalo Navarro

Computing MEMs on Repetitive Text Collections
10:45 - 11:10

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

MONI can find k-MEMs
11:10 - 11:35

Dominik Köppl

Encoding Hard String Problems with Answer Set Programming
11:35 - 12:00

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

From Bit-Parallelism to Quantum String Matching for Labelled Graphs
12:00 - 13:30Lunch
Highlight Talk 2
13:30 - 14:00

Zoe Xi and William Kuszmaul

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings
Session 5
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 Problem
14:25 - 14:50

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

String Factorization via Prefix Free Families
15:00Excursion and conference dinner

Back to top

Wednesday, June 28, 2023

Keynote Talk 3
09:00 - 10:00

Virginia Vassilevska Williams

TBA
10:00 - 10:20Break
Session 6
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 Compatibility
10:45 - 11:10

Christian Komusiewicz, Simone Linz, Nils Morawietz and Jannik Schestag

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
11:10 - 11:35

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

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

Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski and Karol Pokorski

Optimal Heaviest Induced Ancestors
12:00 - 13:30Lunch
Session 7
13:30 - 13:55

Eugene Myers

Merging Sorted Lists of Similar Strings
13:55 - 14:20

Gregory Kucherov and Steven Skiena

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

Diego Arroyuelo and Juan Pablo Castillo

Trie-Compressed Adaptive Set Intersection
14:45 - 15:15Break
Session 8
15:15 - 15:40

Gabriele Fici, Giuseppe Romana, Marinella Sciortino and Cristian Urbina

On the impact of morphisms on BWT-runs
15:40 - 16:05

Gonzalo Navarro and Cristian Urbina

L-systems for measuring repetitiveness
16:05 - 16:30

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

Optimal LZ-End Parsing is Hard
16:30 - 16:40Closing remarks

Back to top