Finding Mutations in DNA and Proteins (Bioinformatics VI) (Coursera)

Our goal is to take small fragments of DNA from the individual and "map" them to the reference genome. We will see that the combinatorial pattern matching algorithms solving this problem are elegant and extremely efficient, requiring a surprisingly small amount of runtime and memory.

In the second half of the course, we will learn how to identify the function of a protein even if it has been bombarded by so many mutations compared to similar proteins with known functions that it has become barely recognizable. This is the case, for example, in HIV studies, since the virus often mutates so quickly that researchers can struggle to study it. The approach we will use is based on a powerful machine learning tool called a hidden Markov model.

Finally, you will learn how to apply popular bioinformatics software tools applying hidden Markov models to compare a protein against a related family of proteins.

Course 6 of 7 in the Bioinformatics Specialization.

Syllabus

WEEK 1

Introduction to Read Mapping

In this class, we will consider the following two central biological questions (the computational approaches needed to solve them are shown in parentheses): How Do We Locate Disease-Causing Mutations? (Combinatorial Pattern Matching)Why Have Biologists Still Not Developed an HIV Vaccine?(Hidden Markov Models)

WEEK 2

The Burrows-Wheeler Transform

This week, we will introduce a paradigm called the Burrows-Wheeler transform; after seeing how it can be used in string compression, we will demonstrate that it is also the foundation of modern read-mapping algorithms.

WEEK 3

Speeding Up Burrows-Wheeler Read Mapping

Last week, we saw how the Burrows-Wheeler transform could be applied to multiple pattern matching. This week, we will speed up our algorithm and generalize it to the case that patterns have errors, which models the biological problem of mapping reads with errors to a reference genome.

WEEK 4

Introduction to Hidden Markov Models

This week, we will start examining the case of aligning sequences with many mutations -- such as related genes from different HIV strains -- and see that our problem formulation for sequence alignment is not adequate for highly diverged sequences. To improve our algorithms, we will introduce a machine-learning paradigm called a hidden Markov model and see how dynamic programming helps us answer questions about these models.

WEEK 5

Profile HMMs for Sequence Alignment

Last week, we introduced hidden Markov models. This week, we will see how hidden Markov models can be applied to sequence alignment with a profile HMM. We will then consider some advanced topics in this area, which are related to advanced methods that we considered in a previous course for clustering.

WEEK 6

Bioinformatics Application Challenge

This week brings our Application Challenge, in which we apply the HMM sequence alignment algorithms that we have developed.

Suggested Readings:
Bioinformatics Algorithms An Active Learning Approach