We are organizing a gathering for string algorithms researchers in the Helsinki area. The idea is to get a view of what is happening in this research area in Helsinki. We would also like to gauge interest in setting up more regular meetings (something like every other week) for example in journal club style.

The program will start with a guest lecture by Johannes Fischer from KIT, Institut für Theoretische Informatik, Karlsruhe, Germany. Johannes is visiting us until September 10th. We will then continue with the talks by researchers from the Helsinki area. See the detailed program below. Please note that we will start at 2 pm sharp (not quarter past).

Please distribute this announcement to your colleagues and students who might be interested in attending.

Welcome!

Program

14:00 Johannes Fischer: Inducing the LCP-Array

Abstract: We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC'09) such that it computes the array of longest common prefixes (LCP-array) as well. Practical tests show that this outperforms recent LCP-array construction algorithms (Gog and Ohlebusch, ALENEX'11).

14:45-15:00 Coffee break

15:00 Juha Kärkkäinen: Fixed-Block Compression Boosting in FM-Indexes
15:20 Travis Gagie: Boundary Access to LZ77-Compressed Texts
15:40 Travis Gagie: Info on Workshop on Industrial Applications of  Textual Algorithms and Data Structures (for CPM/SWAT attendees)

15:45-16:00 Break

16:00 Veli Mäkinen: Indexing Finite Language Representation of Population Genotypes
16:20 Leena Salmela: Correcting errors in short reads by multiple alignments
16:40 Esko Ukkonen: Learning binding affinity models from Selex

17:00 Discussion on arranging regular meetings