CPM 2023

34th Annual Symposium on Combinatorial Pattern Matching

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

Summer school

Just before CPM 2023, there will be a two-day summer school on June 24–25 in the very center of Paris, at the École normale supérieure. The school is primarily aimed at PhD students and postdocs, but of course everyone is welcome. Lunch will be provided by the organizers.

Registration is free but mandatory: please register here before June 19.

As a part of the event, we will have a poster session in the afternoon of June 24. The organizers will cover two nights of accommodation for the 5 participants who volunteer to present a poster (on a first-come first-serve basis).

The school is organized by Gabriel Bathie, Paweł Gawrychowski (gawry[at]cs.uni.wroc.pl), Garance Gourdel and Tatiana Starikovskaya (tat.starikovskaya[at]gmail.com).

There will be two lecturers:

Karel Břinda (Inria/IRISA Rennes)
Under the hood: the role of string algorithms in contemporary biological research

Karel Břinda is a permanent researcher at Inria Rennes in France. He received his master’s degree in mathematical computer science from the Czech Technical University in Prague, followed by a PhD in computer science at Université Paris-Est. Prior to joining Inria, he spent five years in Boston as a postdoctoral fellow and research associate in biomedical informatics and epidemiology at Harvard Medical School and Harvard TH Chan School of Public Health.

Karel's research focuses on developing computational methods for large-scale sequence data search and rapid diagnostics of infectious diseases using DNA sequencing, with a particular focus on antibiotic resistance. To achieve these goals, he develops novel algorithms, data representations, software, and databases that are then provided to the scientific community as building blocks for larger efforts. His research questions range from the theoretical aspects of computer science to the practical end-to-end protocols used in laboratories.

Panagiotis Charalampopoulos (Birbeck, University of London)
Structural analysis of approximate pattern matching and algorithmic applications

Panagiotis Charalampopoulos is a Lecturer at Birkbeck, University of London. Earlier, he completed his undergraduate studies at University of Cambridge and his postgraduate studies at King's College London. Prior to starting at Birkbeck, he was a postdoctoral fellow at Reichman University.

Panagiotis is broadly interested in algorithms and data structures, with a focus on strings and planar graphs. More specifically, his research interests include topics such as approximate pattern matching, algorithms for dynamic strings, and the computation of shortest paths in planar graphs.