- Platform
- edX
- Provider
- University of California, San Diego
- Effort
- 8-10 hours/week
- Length
- 3 weeks
- Language
- English
- Credentials
- Paid Certificate Available
- Part of
- Course Link
Overview
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:
What you'll learn
Taught by
Phillip Compeau and Pavel Pevzner
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?"
What you'll learn
- Graph algorithms
- Algorithms for genome assembly
- Phylogenetics
Syllabus
Week 1: Introduction to Genome Sequencing and Graphs
Introduction to the basics of genome sequencing, and first attempts to model this problem using graphs.
Weeks 2 and 3: Assembling Genomes from Tiny Fragments
Applying an Eulerian path approach to assemble a genome from small pieces of DNA, and adapting this theoretical solution to practical considerations.
Week 1: Introduction to Genome Sequencing and Graphs
Introduction to the basics of genome sequencing, and first attempts to model this problem using graphs.
Weeks 2 and 3: Assembling Genomes from Tiny Fragments
Applying an Eulerian path approach to assemble a genome from small pieces of DNA, and adapting this theoretical solution to practical considerations.
Taught by
Phillip Compeau and Pavel Pevzner