From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) (→An Afternoon of Algorithmic Protein Folding) |
||
| Line 14: | Line 14: | ||
|- | |- | ||
| 13:00 | | 13:00 | ||
| − | | | + | | Exact and non-exact algorithms (Daan van den Berg) |
|- | |- | ||
| 13:15 | | 13:15 | ||
| − | | be | + | | to be |
|- | |- | ||
| 13:30 | | 13:30 | ||
| − | | | + | | completed |
|- | |- | ||
| 13:45 | | 13:45 | ||
| Line 37: | Line 37: | ||
| patient. | | patient. | ||
|} | |} | ||
| − | |||
==Comes from== | ==Comes from== | ||
Revision as of 18:29, 6 May 2019
An Afternoon of Algorithmic Protein Folding
On June 19th 2019 from 13:00 till 17:00 (max) we'll be organising a thematic afternoon of algorithmic protein folding. We'll be having some speakers, some student projects and a really nice [competition] by Bas Terwijn, lecturer in Heuristics. If you want to join us, or maybe even contribute, [please let us know] so we can arrange for enough space.
| Programme | |
|---|---|
| 13:00 | Exact and non-exact algorithms (Daan van den Berg) |
| 13:15 | to be |
| 13:30 | completed |
| 13:45 | soon |
| 14:00 | so |
| 14:15 | please |
| 14:30 | be |
| 14:45 | patient. |
Comes from
The idea for a meetup stems from the course of Heuristics in the Minor Programming here @UvA. One of the cases involves developing algorithms for folding proteins. Click the image.
 Bepaal de optimale vouwing van een eiwit. |