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

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

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

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

The Foundations of Data Structures and Algorithms specialization includes two optional preparation courses and a three-course pathway to earn admission to the Online MS in Computer Science. You must ...

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

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

This course is compulsory on the MSc in Mathematics and Computation. This course is available on the MPA in Data Science for Public Policy, MSc in Data Science, MSc in Operations Research & Analytics, ...