Differences

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

--- thesistopics [2024/02/19 14:00]
leonard [(Runtime) Heuristic for the Fast Comparison of Genomes (Bachelor)]
+++ thesistopics [2024/04/17 13:31]
rwittler
@@ Line 17: / Line 17: @@
 [[ https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=129443261 | Leonard Bohnenkämper]] (Also refer to the [[ https://gitlab.ub.uni-bielefeld.de/gi/ding | gitlab1]]/ [[ https://gitlab.ub.uni-bielefeld.de/lbohnenkaemper/dingiiofficial | 2]])
-DING ([[ https://doi.org/10.1089/cmb.2020.0434 |publication]]) is an exact ILP solution for an NP-hard problem, comparing arbitrary genomes on a high level under the DCJ-Indel model. It is already very fast for small to medium size genomes. However, for some large or very complex genomes that occur in practice, DING is not able to calculate solutions. There are some ideas how to circumvent this problem using approximate or heuristic methods, which could be developed as a Bachelor thesis or as a Master project module. Contact [[ https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=129443261 | Leonard ]] for details.
+DING ([[ https://doi.org/10.1089/cmb.2020.0434 |publication]]) is an exact ILP solution for an NP-hard problem, comparing arbitrary genomes on a high level under the DCJ-Indel model. It is already very fast for small to medium size genomes. However, for some large or very complex genomes that occur in practice, DING is not able to calculate solutions. There are some ideas how to circumvent this problem using approximate or heuristic methods, which could be developed as a Bachelor thesis or as a Master thesis or project module. Contact [[ https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=129443261 | Leonard ]] for details.
@@ Line 26: / Line 26: @@
 Necessary is basic knowledge in algorithms and sequence analysis, ideally also algorithms in comparative genomics.
-===== Visualizing Phylogenetic Splits (Bachelor) =====
-[[https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=3721521 | Roland Wittler]] //(Please also refer to the project page: [[https://gitlab.ub.uni-bielefeld.de/gi/sans|SANS]])//
-{{ :sans.png?nolink|}}SANS is an efficient method for alignment-free, whole-genome based phylogeny estimation that follows a pangenomic approach to efficiently calculate a set of splits in a phylogenetic tree or network. Splits Tree is a tool to visualize such split networks. In this project, the output of SANS should be simplified by replacing individual, textual genome labels by colored bullets that indicate phylogenetic subgroups (or other properties), see example.
-===== Horizontal Gene Transfer Detection (Master) =====
-[[https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=70863414|Tizian Schulz]]  or
-[[https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=3721521 | Roland Wittler]] or
-[[ https://ekvv.uni-bielefeld.de/pers_publ/publ/PersonDetail.jsp?personId=129443261 | Leonard Bohnenkämper]]
-Horizontal Gene Transfers (HGTs) are events that transfer genetic material from one lineage to another. HGTs are especially common in bacteria and particularly relevant for the spreading of (antibiotic) resistance factors among microbes.
-SANS is an efficient method for the construction of phylogenies and as a byproduct allows to find candidate sequences that might have been part of a HGT (see also [[https://doi.org/10.1186/s13015-020-00164-3 | Section "Drosophila"]]). There are some ideas how to automatize the process of finding and verifying such HGT candidates, which can be developed into a master thesis - or you can even bring your own!

Genome Informatics

Differences