Understand the principles of efficient algorithms for dealing with large scale data sets and be able to select appropriate algorithms for specific problems. Understand and be able to apply the main ...
Researchers have developed eskemap, an exact dynamic programming algorithm for sketch-based read mapping that significantly ...
Researchers have introduced Infrared, a declarative Python framework that automates exact optimization and Boltzmann sampling ...
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 ...
IntroductionWe often see terms like "viral mutation" and "genome analysis" in news and research papers, but it is difficult ...
*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.
The design and analysis of efficient algorithms for important computational problems. Paradigms for algorithm design including Divide and Conquer, Greedy Algorithms, Dynamic Programming; and, the use ...
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 Financial Statistics, MSc in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results