Pattern matching on trees and tree comparison are classical topics in computer science. It is used, for example, in comparing structured documents, structured physical objects assembled in a tree like fashion, or molecular structures that can be represented as trees. Term rewrite systems require to match rewrite rules to target terms, and compiler code generation involves matching patterns that describe machine instructions to intermediate program code.
In bioinformatics, there is a large demand on tree comparison methods for modeling RNA secondary structure and finding novel RNA genes via structural matching.
In the seminar, we shall focus on the algorithmic aspects of tree pattern matching. We shall review some of the classical algorithms, and study some very recent enhancements.
| Rhythmus | Tag | Uhrzeit | Format / Ort | Zeitraum |
|---|
| Studiengang/-angebot | Gültigkeit | Variante | Untergliederung | Status | Sem. | LP | |
|---|---|---|---|---|---|---|---|
| Bioinformatik und Genomforschung / Master | (Einschreibung bis SoSe 2012) | Individueller Ergänzungsb | Wahl | 1. 3. | 3 | unbenotet | |
| Bioinformatik und Genomforschung / Promotion | Indiv. Erg. | Wahl | 3 | unbenotet | |||
| Intelligente Systeme / Master | (Einschreibung bis SoSe 2012) | Wahl | 1. 3. | 3 | unbenotet | ||
| Naturwissenschaftliche Informatik / Master | (Einschreibung bis SoSe 2012) | Individuelle Ergänzung | Wahl | 1. 3. | 3 | unbenotet |