We develop efficient and practical algorithms and data structures for fundamental problems arising in sequence analysis. The research is based on thorough understanding of both the combinatorial properties of the problems and the properties of modern computers. The goal is not only to obtain better algorithms but to understand why they are better.

Contact person: University Lecturer Juha Kärkkäinen
Home page: http://www.cs.helsinki.fi/group/pads/