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.
Dieser Kurs ist Teil der Spezialisierung Spezialisierung Bioinformatik
Finding Mutations in DNA and Proteins (Bioinformatics VI)
von
Lehrplan - Was Sie in diesem Kurs lernen werden
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>
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>
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>
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>
Top reviews from Finding Mutations in DNA and Proteins (Bioinformatics VI)
One of the best specialization on Coursera. Highly recommended for anyone who wants to apply his/her programming skills to fascinating real-world problems.
Really enjoyed this course. It was great to get to build on work from previous courses.
Dozenten
Pavel Pevzner
Professor
Phillip Compeau
Visiting ResearcherÜber University of California San Diego
Über die Spezialisierung Bioinformatik
Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Sobald Sie sich für ein Zertifikat angemeldet haben, haben Sie Zugriff auf alle Videos, Quizspiele und Programmieraufgaben (falls zutreffend). Aufgaben, die von anderen Kursteilnehmern bewertet werden, können erst dann eingereicht und überprüft werden, wenn Ihr Unterricht begonnen hat. Wenn Sie sich den Kurs anschauen möchten, ohne ihn zu kaufen, können Sie womöglich auf bestimmte Aufgaben nicht zugreifen.
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Wenn Sie sich für den Kurs anmelden, erhalten Sie Zugriff auf alle Kurse der Spezialisierung und Sie erhalten nach Abschluss aller Arbeiten ein Zertifikat. Ihr elektronisches Zertifikat wird zu Ihrer Seite „Errungenschaften“ hinzugefügt – von dort können Sie Ihr Zertifikat ausdrucken oder es zu Ihrem LinkedIn Profil hinzufügen. Wenn Sie nur lesen und den Inhalt des Kurses anzeigen möchten, können Sie kostenlos als Gast an dem Kurs teilnehmen.
Wie erfolgen Rückerstattungen?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Hilfe-Center für Teiln..
