The final exam is a 30 hour exam that involves solving two algorithmic problems with multiple parts to each. These problems will involve the material you have learned in this class: linear programming ...

Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) . We will ...