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

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