Learn how dynamic programming and Hidden Markov Models can be used to compare genetic strings and uncover evolution.

Learn how dynamic programming and Hidden Markov Models can be used to compare genetic strings and uncover evolution.

Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components.

Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components.

Learn how graphs are used to assemble millions of pieces of DNA into a contiguous genome and use these genomes to construct a Tree of Life.

Learn how graphs are used to assemble millions of pieces of DNA into a contiguous genome and use these genomes to construct a Tree of Life.

Join us on the frontier of bioinformatics and learn how to look for hidden messages in DNA without ever needing to put on a lab coat.

Understand machine learning's role in data-driven modeling, prediction, and decision-making.

Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.

Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.

Learn about pattern matching and string processing algorithms and how they apply to interesting applications.

Learn about pattern matching and string processing algorithms and how they apply to interesting applications.