Об этом курсе
4.7
Оценки: 75
Рецензии: 16
Специализация

Курс 3 из 7 в программе

100% онлайн

100% онлайн

Начните сейчас и учитесь по собственному графику.
Гибкие сроки

Гибкие сроки

Назначьте сроки сдачи в соответствии со своим графиком.
Начальный уровень

Начальный уровень

Часов на завершение

Прибл. 17 часов на выполнение

Предполагаемая нагрузка: 3 hours/week...
Доступные языки

Английский

Субтитры: Английский

Приобретаемые навыки

BioinformaticsGraph TheoryBioinformatics AlgorithmsPython Programming
Специализация

Курс 3 из 7 в программе

100% онлайн

100% онлайн

Начните сейчас и учитесь по собственному графику.
Гибкие сроки

Гибкие сроки

Назначьте сроки сдачи в соответствии со своим графиком.
Начальный уровень

Начальный уровень

Часов на завершение

Прибл. 17 часов на выполнение

Предполагаемая нагрузка: 3 hours/week...
Доступные языки

Английский

Субтитры: Английский

Программа курса: что вы изучите

Неделя
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>...
Reading
7 видео ((всего 51 мин.)), 2 материалов для самостоятельного изучения, 3 тестов
Video7 видео
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мин
Reading2 материала для самостоятельного изучения
Course Details10мин
Week 1 FAQs (Optional)
Quiz1 практическое упражнение
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>...
Reading
1 видео ((всего 11 мин.)), 1 материал для самостоятельного изучения, 3 тестов
Video1 видео
Reading1 материал для самостоятельного изучения
Week 2 FAQs (Optional)
Quiz1 практическое упражнение
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>...
Reading
3 видео ((всего 29 мин.)), 1 материал для самостоятельного изучения, 3 тестов
Video3 видео
Space-Efficient Sequence Alignment 10мин
Multiple Sequence Alignment 13мин
Reading1 материал для самостоятельного изучения
Week 3 FAQs (Optional)
Quiz1 практическое упражнение
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>...
Reading
5 видео ((всего 36 мин.)), 1 материал для самостоятельного изучения, 3 тестов
Video5 видео
Sorting by Reversals 4мин
Breakpoint Theorem 5мин
Rearrangements in Tumor Genomes 5мин
2-Breaks 7мин
Reading1 материал для самостоятельного изучения
Week 4 FAQs (Optional)
Quiz1 практическое упражнение
Week 4 Quiz15мин
4.7
Рецензии: 16Chevron Right

Лучшие рецензии

автор: 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

автор: 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

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

О специализации ''Bioinformatics'

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

Часто задаваемые вопросы

  • Зарегистрировавшись на сертификацию, вы получите доступ ко всем видео, тестам и заданиям по программированию (если они предусмотрены). Задания по взаимной оценке сокурсниками можно сдавать и проверять только после начала сессии. Если вы проходите курс без оплаты, некоторые задания могут быть недоступны.

  • Записавшись на курс, вы получите доступ ко всем курсам в специализации, а также возможность получить сертификат о его прохождении. После успешного прохождения курса на странице ваших достижений появится электронный сертификат. Оттуда его можно распечатать или прикрепить к профилю LinkedIn. Просто ознакомиться с содержанием курса можно бесплатно.

Остались вопросы? Посетите Центр поддержки учащихся.