Computationele Biologie
Na de deadline zal de correctheid en de computationele complexiteit (tijd en geheugen) van de volgende oefening geëvalueerd worden op basis van peer review:
- Global alignment in linear space
| Titel | Voortgang groep | |||
|---|---|---|---|---|
| Change problem | ||||
| Longest path in a Manhattan-like grid | ||||
| Longest common subsequence | ||||
| Topological ordering of a DAG | ||||
| Longest path in a DAG | ||||
| Global alignment | ||||
| Local alignment | ||||
| Edit distance | ||||
| Fitting alignment | ||||
| Overlap alignment | ||||
| Global alignment with affine gap penalties | ||||
| Multiple longest common subsequence | ||||
| Find a middle edge in linear space | ||||
| Global alignment in linear space |