-
© Universität Bielefeld
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| thesistopics [2025/03/21 12:42] – [SAT solving solutions for rearrangement problems (Bachelor/Master)] leonard | thesistopics [2026/07/19 16:41] (current) – jstoye | ||
|---|---|---|---|
| Line 4: | Line 4: | ||
| The following is a (probably incomplete) list of thesis topics offered within the Genome Informatics group. If you are interested in working on one of these (or anything else in Genome Informatics), | The following is a (probably incomplete) list of thesis topics offered within the Genome Informatics group. If you are interested in working on one of these (or anything else in Genome Informatics), | ||
| </ | </ | ||
| - | |||
| - | |||
| - | ===== SAT solutions for rearrangement problems (Bachelor/ | ||
| - | Genomic rearrangements play a critical role in evolution and adaptation, altering genome structure and organization, | ||
| - | |||
| - | However, even quantifying rearrangements for most genomes that occur in practice is NP-hard under realistic models. | ||
| - | While Integer Linear Programming (ILP) is commonly used to address this challenge, it has been recently observed that SAT formulations of the same problems may offer a faster alternative. The project involves converting an existing ILP solution for genomic rearrangement quantification into a SAT-based solution, leveraging SAT solvers' | ||
| - | |||
| - | ===== < | ||
| - | <Project description> | ||
| ===== < | ===== < | ||
| <Project description> | <Project description> | ||
thesistopics.1742560949.txt.gz · Last modified: by leonard
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International