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) .

COMP_SCI 396, 496: Advanced Algorithm Design through the Lens of ... Instructor Description. This is an advanced undergraduate course on algorithms. This course examines such topics as greedy ...

Dynamic programming (DP) algorithms have become indispensable in computational biology, addressing problems that range from sequence alignment and phylogenetic inference to RNA secondary structure ...