Learn about data structures that are used in computational thinking – both basic and advanced.

Learn about high-performance data structures and supporting algorithms, as well as the fundamentals of theoretical time complexity analysis through an interactive online text.

Learn about high-performance data structures and supporting algorithms, as well as the fundamentals of theoretical time complexity analysis through an interactive online text.

Learn about high-performance data structures and supporting algorithms, as well as the fundamentals of theoretical time complexity analysis through an interactive online text.

Learn about high-performance data structures and supporting algorithms, as well as the fundamentals of theoretical time complexity analysis through an interactive online text.

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.