このコースについて
7,771 最近の表示

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

初級レベル

約17時間で修了

英語

字幕:英語

習得するスキル

BioinformaticsGraph TheoryBioinformatics AlgorithmsPython Programming

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

初級レベル

約17時間で修了

英語

字幕:英語

シラバス - 本コースの学習内容

1
5時間で修了

Week 1: Introduction to Sequence Alignment

<p>Welcome to class!</p><p>If you joined us in the previous course in this Specialization, then you became an expert at <em>assembling</em> genomes and sequencing antibiotics. The next natural question to ask is how to compare DNA and amino acid sequences. This question will motivate this week's discussion of <strong>sequence alignment</strong>, which is the first of two questions that we will ask in this class (the algorithmic methods used to answer them are shown in parentheses):</p><ol><li>How Do We Compare DNA Sequences? (<em>Dynamic Programming</em>)</li><li>Are There Fragile Regions in the Human Genome? (<em>Combinatorial Algorithms</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. Why have taxis suddenly become free of charge in Manhattan? Where did Pavel get so much spare change? And how should you get dressed in the morning so that you aren't late to your job as a crime-stopping superhero? Answers to these questions, and many more, in this week's installment of the course.</p><p><img src="http://bioinformaticsalgorithms.com/images/cover/alignment_cropped.jpg" width="528"></p>...
7件のビデオ (合計51分), 2 readings, 3 quizzes
7件のビデオ
From Sequence Comparison to Biological Insights 10 分
The Alignment Game and the Longest Common Subsequence Problem 3 分
The Manhattan Tourist Problem 6 分
The Change Problem 10 分
Dynamic Programming and Backtracking Pointers 6 分
From Manhattan to the Alignment Graph 9 分
2件の学習用教材
Course Details10 分
Week 1 FAQs (Optional)
1の練習問題
Week 1 Quiz15 分
2
2時間で修了

Week 2: From Finding a Longest Path to Aligning DNA Strings

<p>Welcome to Week 2 of the class!</p> <p>Last week, we saw how touring around Manhattan and making change in a Roman shop help us find a longest common subsequence of two DNA or protein strings.</p> <p>This week, we will study how to find a highest scoring alignment of two strings. We will see that regardless of the underlying assumptions that we make regarding how the strings should be aligned, we will be able to phrase our alignment problem as an instance of finding the longest path in a directed acyclic graph.</p>...
1件のビデオ (合計11分), 1 reading, 3 quizzes
1件のビデオ
1件の学習用教材
Week 2 FAQs (Optional)
1の練習問題
Week 2 Quiz15 分
3
4時間で修了

Week 3: Advanced Topics in Sequence Alignment

<p>Welcome to Week 3 of the class!</p> <p>Last week, we saw how a variety of different applications of sequence alignment can all be reduced to finding the longest path in a Manhattan-like graph.</p> <p>This week, we will conclude the current chapter by considering a few advanced topics in sequence alignment. For example, if we need to align long strings, our current algorithm will consume a huge amount of memory. Can we find a more memory-efficient approach? And what should we do when we move from aligning just two strings at a time to aligning many strings?</p>...
3件のビデオ (合計29分), 1 reading, 3 quizzes
3件のビデオ
Space-Efficient Sequence Alignment 10 分
Multiple Sequence Alignment 13 分
1件の学習用教材
Week 3 FAQs (Optional)
1の練習問題
Week 3 Quiz15 分
4
4時間で修了

Week 4: Genome Rearrangements and Fragility

<p>Welcome to Week 4 of the class!</p> <p>You now know how to compare two DNA (or protein) strings. &nbsp;But what if we wanted to compare entire genomes? When we "zoom out" to the genome level, we find that substitutions, insertions, and deletions don't tell the whole story of evolution: we need to model more dramatic evolutionary events known as <strong>genome rearrangements</strong>, which wrench apart chromosomes and put them back together in a new order. A natural question to ask is whether there are "fragile regions" hidden in your genome where chromosome breakage has occurred more often over millions of years. This week, we will begin addressing this question by asking how we can compute the number of rearrangements on the evolutionary path connecting two species.</p> <p>You can find this week's Bioinformatics Cartoon from Randall Christopher at the bottom of this E-mail. What do earthquakes and a stack of pancakes have to do with species evolution? Keep learning to find out!</p> <p><img width="528" src="http://bioinformaticsalgorithms.com/images/cover/rearrangements_cropped.jpg"></p>...
5件のビデオ (合計36分), 1 reading, 3 quizzes
5件のビデオ
Sorting by Reversals 4 分
Breakpoint Theorem 5 分
Rearrangements in Tumor Genomes 5 分
2-Breaks 7 分
1件の学習用教材
Week 4 FAQs (Optional)
1の練習問題
Week 4 Quiz15 分
5
3時間で修了

Week 5: Applying Genome Rearrangement Analysis to Find Genome Fragility

<p>Last week, we asked whether there are fragile regions in the human genome. Then, we took a lengthy detour to see how to compute a distance between species genomes, a discussion that we will continue this week.</p> <p>It is probably unclear how computing the&nbsp;<em>distance</em> between two genomes can help us understand whether <em>fragile regions</em> exist. If so, please stay tuned -- we will see that the connection between these two concepts will yield a surprising conclusion to the class.</p>...
4件のビデオ (合計31分), 1 reading, 3 quizzes
4件のビデオ
2-Break Distance Theorem 5 分
Rearrangement Hotspots in the Human Genome 7 分
Synteny Block Construction 11 分
1件の学習用教材
Week 5 FAQs (Optional)
1の練習問題
Week 5 Quiz15 分
6
4時間で修了

Week 6: Bioinformatics Application Challenge

In the sixth and final week of the course, we will apply sequence alignment algorithms to infer the non-ribosomal code....
1 quiz
4.7
18件のレビューChevron Right

人気のレビュー

by AHAug 19th 2016

A very well taught course that gives you the ins and outs of sequence comparision and introduces chromosme rearrangement analysis in a succint manner. This was

by PBNov 30th 2017

This course was harder than the previous one, I am happy to have made it to the end!

講師

Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Phillip Compeau

Visiting Researcher
Department of Computer Science & Engineering
Avatar

Nikolay Vyahhi

Visiting Scholar
Department of Computer Science and Engineering

カリフォルニア大学サンディエゴ校について

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....

バイオインフォマティクスの専門講座について

Join Us in a Top 50 MOOC of All Time! How do we sequence and compare genomes? How do we identify the genetic basis for disease? How do we construct an evolutionary Tree of Life for all species on Earth? When you complete this Specialization, you will learn how to answer many questions in modern biology that have become inseparable from the computational approaches used to solve them. You will also obtain a toolkit of existing software resources built on these computational approaches and that are used by thousands of biologists every day in one of the fastest growing fields in science. Although this Specialization centers on computational topics, you do not need to know how to program in order to complete it. If you are interested in programming, we feature an "Honors Track" (called "hacker track" in previous runs of the course). The Honors Track allows you to implement the bioinformatics algorithms that you will encounter along the way in dozens of automatically graded coding challenges. By completing the Honors Track, you will be a bioinformatics software professional! Learn more about the Bioinformatics Specialization (including why we are wearing these crazy outfits) by watching our introductory video. You can purchase the Specialization's print companion, Bioinformatics Algorithms: An Active Learning Approach, from the textbook website. Our first course, "Finding Hidden Messages in DNA", was named a top-50 MOOC of all time by Class Central!...
バイオインフォマティクス

よくある質問

  • 修了証に登録すると、すべてのビデオ、テスト、およびプログラミング課題(該当する場合)にアクセスできます。ピアレビュー課題は、セッションが開始してからのみ、提出およびレビューできます。購入せずにコースを検討することを選択する場合、特定の課題にアクセスすることはできません。

  • コースに登録する際、専門講座のすべてのコースにアクセスできます。コースの完了時には修了証を取得できます。電子修了証が成果のページに追加され、そこから修了証を印刷したり、LinkedInのプロフィールに追加したりできます。コースの内容の閲覧のみを希望する場合は、無料でコースを聴講できます。

さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。