Brief Introduction
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.Description
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.
Knowledge
- Graph algorithms
- Algorithms for genome assembly
- Phylogenetics
Algorithms for DNA Sequencing
- 4.7
-
![]()
![]()
![]()
![]()
![]()
We will learn computational methods -- algorithms and data structures -- for analyzing DNA sequencing data. We will learn a little about DNA, genomics, and how DNA sequencing is used....
Genome Sequencing (Bioinformatics II)
- 4.6
-
![]()
![]()
![]()
![]()
![]()
You may have heard a lot about genome sequencing and its potential to usher in an era of personalized medicine, but what does it mean to sequence a genome?...
Comparing Genes, Proteins, and Genomes (Bioinformatics III)
- 4.7
-
![]()
![]()
![]()
![]()
![]()
Once we have sequenced genomes in the previous course, we would like to compare them to determine how species have evolved and what makes them different....
Введение в биоинформатику (Introduction to Bioinformatics)
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Курс «Введение в биоинформатику» адресован тем, кто хочет получить расширенное представление о том, что такое биоинформатика и как она помогает биологам и медикам в их работе....
