About this Course
최근 조회 6,762

다음 전문 분야의 7개 강좌 중 3번째 강좌:

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

초급 단계

완료하는 데 약 17시간 필요

영어

자막: 영어

귀하가 습득할 기술

BioinformaticsGraph TheoryBioinformatics AlgorithmsPython Programming

다음 전문 분야의 7개 강좌 중 3번째 강좌:

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 videos (Total 51 min), 2 readings, 3 quizzes
7개의 동영상
The Manhattan Tourist Problem 6m
The Change Problem 10m
Dynamic Programming and Backtracking Pointers 6m
From Manhattan to the Alignment Graph 9m
2개의 읽기 자료
Course Details10m
Week 1 FAQs (Optional)
1개 연습문제
Week 1 Quiz15m
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 video (Total 11 min), 1 reading, 3 quizzes
1개의 동영상
1개의 읽기 자료
Week 2 FAQs (Optional)
1개 연습문제
Week 2 Quiz15m
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 videos (Total 29 min), 1 reading, 3 quizzes
1개의 읽기 자료
Week 3 FAQs (Optional)
1개 연습문제
Week 3 Quiz15m
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 videos (Total 36 min), 1 reading, 3 quizzes
5개의 동영상
Rearrangements in Tumor Genomes 5m
2-Breaks 7m
1개의 읽기 자료
Week 4 FAQs (Optional)
1개 연습문제
Week 4 Quiz15m
4.7
18개의 리뷰Chevron Right

Comparing Genes, Proteins, and Genomes (Bioinformatics III)의 최상위 리뷰

대학: 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

캘리포니아 샌디에고 대학교 정보

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 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.