Vorträge

Efficiently solving large scale matching problems on

biosequence databases

Prof. Dr. Stefan Kurtz
Abteilung für Genominformatik
Zentrum für Bioinformatik
Universität Hamburg

Many sequence analysis tools developed in the pre-genomic age cannot handle the large data sizes of the biosequence databases in the genomic age. For this reason we have developed the concept of virtual suffix trees. These provide a versatile indexing technique allowing to efficiently solve many large scale sequence comparison and matching problems on current biosequence databases. In this talk we will describe a new software tool which provides an efficient implementation of virtual suffix trees. We will talk about the algorithmic aspects aspect of this software tool, and present some new applications in the following areas:

• multiple genome alignment

• development of signatures for pathogen bacteria

Zeit: Montag, den 26. Mai 2003, 17 Uhr c.t.

Ort: Institut für Neuro- und Bioinformatik
        TZL, Seelandstr. 1a, Geb. 5
        Seminarraum OG.3