Dagstuhl Seminar 24472
Regular Expressions: Matching and Indexing
( Nov 17 – Nov 22, 2024 )
(Click in the middle of the image to enlarge)
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/24472
Organizers
- Inge Li Gørtz (Technical University of Denmark - Lyngby, DK)
- Sebastian Maneth (Universität Bremen, DE)
- Gonzalo Navarro (University of Chile - Santiago de Chile, CL)
- Nicola Prezza (University of Venice, IT)
Contact
- Marsha Kleinbauer (for scientific matters)
- Jutka Gasiorowski (for administrative matters)
Dagstuhl Reports
As part of the mandatory documentation, participants are asked to submit their talk abstracts, working group results, etc. for publication in our series Dagstuhl Reports via the Dagstuhl Reports Submission System.
- Upload (Use personal credentials as created in DOOR to log in)
Dagstuhl Seminar Wiki
- Dagstuhl Seminar Wiki (Use personal credentials as created in DOOR to log in)
Shared Documents
- Dagstuhl Materials Page (Use personal credentials as created in DOOR to log in)
Regular expressions and finite automata lie at the foundations of Computer Science and have been used since the sixties in basic problems like compiler design. The key algorithmic challenge is regular expression matching, that is, efficiently identifying words of a regular language within a sequence.
Over the years, there have been numerous algorithmic advances around the topic, while at the same time, their applications have spread over too many different areas like information retrieval, databases, bioinformatics, security, and others, which not only make use of standard results but also pose new and challenging variants of the regular expression matching problem. The use of regular expressions has made its way even into current standards like SQL:2016 and SPARQL. Bringing together researchers from core stringology and relevant application areas will benefit both sides, giving the opportunity to exchange novel problems and solutions of theoretical and practical nature.
The seminar aims to bring together researchers from various research directions within algorithmic aspects of regular expressions and finite automata. Furthermore, the seminar will inspire the exchange of theoretical and practical results. Our aims are to identify practically relevant restrictions and extensions of regular expression matching, as well as variants that work on graphs rather than sequences, and propose matching and indexing algorithms to handle those, together with related impossibility results.
Creative Commons BY 4.0
Inge Li Gørtz, Sebastian Maneth, Gonzalo Navarro, and Nicola Prezza
Please log in to DOOR to see more details.
- Antoine Amarilli
- Hideo Bannai
- Ruben Becker
- Giulia Bernardini
- Philip Bille
- Manuel Cáceres
- Davide Cenzato
- James Davis
- Dominik D. Freydenberger
- Pawel Gawrychowski
- Adrián Gómez Brandón
- Inge Li Gørtz
- Roberto Grossi
- Moshe Lewenstein
- Konstantinos Mamouras
- Sebastian Maneth
- Wim Martens
- Yasuhiko Minamide
- Gonzalo Navarro
- Nicola Prezza
- Cristian Riveros
- Markus L. Schmid
- Teresa Steiner
- Michelle Sweering
- Simon Rumle Tarnow
- Brink van der Merwe
Classification
- Data Structures and Algorithms
Keywords
- finite automata
- regular expressions
- complex patterns
- text indexing
- graph matching and indexing
