About this course: In previous courses in the Specialization, we have discussed how to sequence and compare genomes. This course will cover advanced topics in finding mutations lurking within DNA and proteins. In the first half of the course, we would like to ask how an individual's genome differs from the "reference genome" of the species. 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.
Created by: University of California, San Diego
Taught by: Pavel Pevzner, Professor
Department of Computer Science and Engineering
Taught by: Phillip Compeau, Visiting Researcher
Department of Computer Science & Engineering
| Basic Info |
Course 6 of 7 in the
Bioinformatics Specialization.
|
| Level | Beginner |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Week 1: Introduction to Read Mapping
<p>Welcome to our class! We are glad that you decided to join us.</p><p>In this class, we will consider the following two central biological questions (the computational approaches needed to solve them are shown in parentheses):</p><ol><li>How Do We Locate Disease-Causing Mutations? (<em>Combinatorial Pattern Matching</em>)</li><li>Why Have Biologists Still Not Developed an HIV Vaccine? (<em>Hidden Markov Models</em>)</li></ol><p>As in previous courses, each of these two chapters is accompanied by a Bioinformatics Cartoon created by talented artist Randall Christopher and serving as a chapter header in the Specialization's bestselling <a href="http://bioinformaticsalgorithms.com" target="_blank">print companion</a>. You can find the first chapter's cartoon at the bottom of this message. </p><p><img src="https://stepic.org/media/attachments/lessons/292/chapter7_cropped.jpg" title="Image: https://stepic.org/media/attachments/lessons/292/chapter7_cropped.jpg" width="528"></p>
4 videos, 2 readings
- Video: (Check Out Our Wacky Course Intro Video!)
- Reading: Course Details
- LTI Item: Stepik Interactive Text for Week 1
- Video: Why Do We Map Reads?
- Video: Using the Trie
- Video: From a Trie to a Suffix Tree
- Reading: Week 1 FAQs (Optional)
Graded: How Do We Find Disease-Causing Mutations? (Week 1)
Graded: Open in order to Sync Your Progress: Stepik Interactive Text for Week 1
WEEK 2
Week 2: The Burrows-Wheeler Transform
<p>Welcome to week 2 of the class!</p>
<p>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.</p>
3 videos, 1 reading
- LTI Item: Stepik Interactive Text for Week 2
- Video: String Compression and the Burrows-Wheeler Transform
- Video: Inverting Burrows-Wheeler
- Video: Using Burrows-Wheeler for Pattern Matching
- Reading: Week 2 FAQs (Optional)
Graded: Open in order to Sync Your Progress: Stepik Interactive Text for Week 2
WEEK 3
Week 3: Speeding Up Burrows-Wheeler Read Mapping
<p>Welcome to week 3 of class!</p>
<p>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.</p>
4 videos, 1 reading
- LTI Item: Stepik Interactive Text for Week 3
- Video: Finding the Matched Patterns
- Video: Setting Up Checkpoints
- Video: Inexact Matching
- Video: Further Applications of Read Mapping
- Reading: Week 3 FAQs (Optional)
Graded: How Do We Find Disease-Causing Mutations? (Weeks 2-3)
Graded: Open in order to Sync Your Progress: Stepik Interactive Text for Week 3
WEEK 4
Week 4: Introduction to Hidden Markov Models
<p>Welcome to week 4 of class!</p>
<p>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.</p>
<p>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.</p>
5 videos, 1 reading
- Reading: Note on This Week's Content
- Video: Classifying HIV Phenotypes
- Video: Gambling with Yakuza
- Video: From a Crooked Casino to a Hidden Markov Model
- Video: The Decoding Problem
- Video: The Viterbi Algorithm
Graded: Stepik Code Challenges for Week 4
WEEK 5
Week 5: Profile HMMs for Sequence Alignment
<p>Welcome to week 5 of class!</p>
<p>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.</p>
5 videos, 2 readings
- Reading: Note on This Week's Content
- Video: Profile HMMs for Sequence Alignment
- Video: Classifying Proteins with Profile HMMs
- Video: Viterbi Learning
- Video: Soft Decoding Problem
- Video: Baum-Welch Learning
- Reading: Week 5 FAQs (Optional)
Graded: Why Have Biologists Still Not Developed an HIV Vaccine? (Weeks 4-5)
Graded: Stepik Code Challenges for Week 5
WEEK 6
Week 6: Bioinformatics Application Challenge
<p>Welcome to the sixth and final week of class!</p>
<p>This week brings our Application Challenge, in which we apply the HMM sequence alignment algorithms that we have developed.</p>
Graded: Bioinformatics Application Challenge
FAQs
How It Works
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Creators
University of California, San Diego
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
Pricing
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
Ratings and Reviews
good
One of the best specialization on Coursera. Highly recommended for anyone who wants to apply his/her programming skills to fascinating real-world problems.
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
TL
Very interesting material. The only reason I marked this course as 4 stars instead of 5 stars is by comparison to the other courses in this specialization. This course does not have the online textbook which means that the student needs to work through the lecture videos very closely in order to be able to solve the programming assignments.