This is an old revision of the document!
|392231||Stoye, Wittler||Summer 2018||Class hours by appointment||ekvv|
Tuesday, July 10 at 13:45 in U10-146 or July 16 at 10:00 in U10-146.
Each participant implements a (simple) algorithm in a programming language of their own choice. Topics will be distributed individually: meet or send email to the organizer, a lecturer of any other class or seminar in the modules Algorithms in Bioinformatics or Special Algorithmus in Bioinformatics. The focus of the implementation shall be on code readability and optimal asymptotics, which ideally is verified by systematic testing.
The source code and some test data (where applicable) has to be sent to the organiser one week before the final presentation. During the final presentation, every participant runs and explains her/his software in front of everybody. If the result is not satisfactory, a correction can be provided until the end of the semester.
|Neighbor Joining 1||Sarah Becker||Roland|
|Agglomerative Clustering 1||Christina Drake||Roland|
|Prim's Algorithm||Vanessa Krämer||Roland|
|Additive tree construction á la Waterman||Manuel Feser||Roland|
|Seller's Algorithm||Antonia Leidel||Roland|
|Finding MUMs and MEMs using Suffix Trees||Timo Wentong Lin||Roland|
|Agglomerative Clustering 2||Stephanie Wrage||Jens|
|Neighbor Joining 2||Sophia Hönig||Jens|
|BWT incl. backward search||Henrike Zimmermann||Jens|
|Profile Hidden Markov Model Analysis||Ilja Wolik||Jens|
|Perfect Phylogeny||Nils Lemke||Jens|
|The Money Changing Problem||Ruth Rotgänger||Jens|
|Signed Reversal Distance in Linear Time||Tim Rother||Jens|
|Maximal Unique Matches w/ suffix trees||Sophia Hansen||Jens|
Back to Teaching