Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
thesistopics [2024/02/19 14:00]
leonard [(Runtime) Heuristic for the Fast Comparison of Genomes (Bachelor)]
thesistopics [2024/02/19 15:09]
leonard [(Runtime) Heuristic for the Fast Comparison of Genomes (Bachelor/Master)]
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]]) [[ 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.