Graph Algorithms in Genome Sequencing

Course 7 of 8: MicroMasters® Program in Algorithms and Data Structures 3 Weeks 8 - 10 hours each week
857

Please select the start dates for your courses below.

Scheduled Start:

About this course

In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn how graph algorithms are used in two fundamental problems in modern biology:

  • How do we sequence a genome?
  • How do we construct an evolutionary “Tree of Life?”

In the first part of the course, you will learn how genome sequencing relies on using a graph to assemble millions of tiny DNA fragments into a contiguous genome. We will then shift gears and learn how to construct an evolutionary tree of life from genome data.

What you’ll learn

  • Graph algorithms
  • Algorithms for genome assembly
  • Phylogenetics

Prerequisites

Basic knowledge of:

  • at least one programming language: loops, arrays, stacks, recursion.
  • mathematics: proof by induction, proof by contradiction.

 

Who can take this course?

Unfortunately, learners from one or more of the following countries or regions will not be able to register for this course: Iran, Cuba and the Crimea region of Ukraine. While edX has sought licenses from the U.S. Office of Foreign Assets Control (OFAC) to offer our courses to learners in these countries and regions, the licenses we have received are not broad enough to allow us to offer this course in all locations. EdX truly regrets that U.S. sanctions prevent us from offering all of our courses to everyone, no matter where they live.

Meet Your Instructors

Pavel Pevzner

Ronald R. Taylor Professor of Computer Science
The University of California, San Diego

Phillip Compeau

Assistant Teaching Professor
Carnegie Mellon University
857

Duration

3 Weeks

Experience Level

Intermediate

Learning Partner

San Diego

Program Type

MicroMasters®
Advanced Business Harvard X-Series