This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

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

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

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