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.
| Frequency | Weekday | Time | Format / Place | Period | |
|---|---|---|---|---|---|
| by appointment | n.V. | 13.04.-24.07.2026 |
| Module | Course | Requirements | |
|---|---|---|---|
| 39-M-Inf-P_BI Project Bioinformatics Projekt Bioinformatik | Projekt | Ungraded examination
|
Student information |
The binding module descriptions contain further information, including specifications on the "types of assignments" students need to complete. In cases where a module description mentions more than one kind of assignment, the respective member of the teaching staff will decide which task(s) they assign the students.