|392231||Stoye||Summer 2019||Class hours by appointment|
Monday, 2019 July 08, at 14h c.t. 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.
|Burrows Wheeler Transformation I||Gabriel Abrantes|
|Double Cut and Join (DCJ) Distance||Fabienne Thelen|
|Spanning Trees (Kuskal or Prim)||Fabienne Thelen|
|Burrows Wheeler Transformation II||Jasmin Hartmann|
|Neighbour Joining||Jonas Bicker|
|Sankoff Algorithm for the SPP||Lukas Schulte|
|Agglomerative Clustering||Lukas Micks|
Back to Teaching