Skip to main content
KBS_Icon_questionmark link-ico

Dagstuhl Seminar on "Combinatorics and Algorithmics of Strings"

Professor Maxime Crochemore co-organised a Dagstuhl seminar on "Combinatorics and Algorithmics of Strings" that was held on 9-14 March 2014.

Schloss Dagstuhl-Leibniz Center for Informatics is the world's premier venue for informatics. World-class scientists, promising young researchers, and practitioners come together to exchange their knowledge and to discuss their research findings.

The purpose of the seminar was to bring together researchers from combinatorics and from algorithms whose interests are string processing algorithms and problems on words, namely Stringology.  Typical topics included pattern avoidability, efficient text indexing, word equations, string algorithms on large alphabets, and pattern matching in general. 40 world-class researchers attended the seminar.

Maxime Crochemore is Professor of Computer Science in the Algorithms and Bioinformatics research group of the Department of Informatics.

For more details of the seminar please see:

http://www.dagstuhl.de/no_cache/en/program/calendar/semhp/?semnr=14111