

Finding Mutations in DNA and Proteins (Bioinformatics VI)
- Offered byCoursera
- Public/Government Institute
Finding Mutations in DNA and Proteins (Bioinformatics VI) at Coursera Overview
Duration | 24 hours |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Intermediate |
Official Website | Explore Free Course |
Credential | Certificate |
Finding Mutations in DNA and Proteins (Bioinformatics VI) at Coursera Highlights
- This Course Plus the Full Specialization.
- Shareable Certificates.
- Graded Programming Assignments.
Finding Mutations in DNA and Proteins (Bioinformatics VI) at Coursera Course details
- 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.
Finding Mutations in DNA and Proteins (Bioinformatics VI) at Coursera Curriculum
Week 1: Introduction to Read Mapping
(Check Out Our Wacky Course Intro Video!)
Why Do We Map Reads?
Using the Trie
From a Trie to a Suffix Tree
Course Details
Week 1 FAQs (Optional)
How Do We Find Disease-Causing Mutations? (Week 1)
Week 2: The Burrows-Wheeler Transform
String Compression and the Burrows-Wheeler Transform
Inverting Burrows-Wheeler
Using Burrows-Wheeler for Pattern Matching
Week 2 FAQs (Optional)
Week 3: Speeding Up Burrows-Wheeler Read Mapping
Finding the Matched Patterns
Setting Up Checkpoints
Inexact Matching
Further Applications of Read Mapping
Week 3 FAQs (Optional)
How Do We Find Disease-Causing Mutations? (Weeks 2-3)
Week 4: Introduction to Hidden Markov Models
Classifying HIV Phenotypes
Gambling with Yakuza
From a Crooked Casino to a Hidden Markov Model
The Decoding Problem
The Viterbi Algorithm
Week 5: Profile HMMs for Sequence Alignment
Profile HMMs for Sequence Alignment
Classifying Proteins with Profile HMMs
Viterbi Learning
Soft Decoding Problem
Baum-Welch Learning
Week 5 FAQs (Optional)
Why Have Biologists Still Not Developed an HIV Vaccine? (Weeks 4-5)
Week 6: Bioinformatics Application Challenge
Other courses offered by Coursera
Student Forum
Useful Links
Know more about Coursera
Know more about Programs
- Medical Courses
- Public Health & Management
- Hospital Management Course
- Perfusion Technology
- Medical Transcription
- Diabetology
- Forensic Medical Science
- Dialysis Technology
- Cardiovascular Technology
- Cath Lab Technology
- BSc Pathology
- BSc Operation Theatre Technology
- MSc Pathology
- BSc in Perfusion Technology
- Nephrology