This project investigates an exact, brute force approach to computing the DCJ-indel distance under the maximal matching model for natural genomes. The main objective is to design a compact and efficiently enumerable encoding of marker matches, ensuring both memory efficiency and systematic generation of all valid maximal matchings. This encoding is integrated into an existing DCJ-indel distance interface to implement a brute force algorithm that enumerates and evaluates all possible matches. The project also includes experimental evaluation, focusing on runtime behavior and scalability, with particular emphasis on comparison to an existing tool.
| Rhythmus | Tag | Uhrzeit | Format / Ort | Zeitraum | |
|---|---|---|---|---|---|
| nach Vereinbarung | n.V. | 13.04.-24.07.2026 |
| Modul | Veranstaltung | Leistungen | |
|---|---|---|---|
| 39-M-Inf-P_BI Projekt Bioinformatik Projekt Bioinformatik | Projekt | unbenotete Prüfungsleistung
|
Studieninformation |
Die verbindlichen Modulbeschreibungen enthalten weitere Informationen, auch zu den "Leistungen" und ihren Anforderungen. Sind mehrere "Leistungsformen" möglich, entscheiden die jeweiligen Lehrenden darüber.