Differences

This shows you the differences between two versions of the page.

--- thesistopics [2025/03/21 13:53]
leonard [SAT solutions for rearrangement problems (Bachelor/Master)]
+++ thesistopics [2026/07/19 18: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), please contact the responsible group members or see [[http://www.techfak.uni-bielefeld.de/~stoye|Prof. Jens Stoye]].
 </WRAP>
-===== SAT solutions for rearrangement problems (Bachelor/Master) =====
-Genomic rearrangements play a critical role in evolution and adaptation, altering genome structure and organization, thereby influencing phenotypic traits. Understanding these rearrangements helps identify the mechanisms underlying many genetic diseases and evolutionary processes.
-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' computational efficiency.
-Contact [[https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=129443261 |Leonard]] for details.
-===== <TITLE> (Bachelor/Master) =====
-<Project description>
 ===== <TITLE> (Bachelor/Master) =====
 <Project description>