About this Course
최근 조회 4,086

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

100% 온라인

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

유동적 마감일

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

초급 단계

완료하는 데 약 18시간 필요

영어

자막: 영어

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

100% 온라인

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

유동적 마감일

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

초급 단계

완료하는 데 약 18시간 필요

영어

자막: 영어

강의 계획 - 이 강좌에서 배울 내용

1
완료하는 데 4시간 필요

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&nbsp;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?&nbsp;(<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>

...
4 videos (Total 33 min), 2 readings, 3 quizzes
4개의 동영상
From a Trie to a Suffix Tree 11m
2개의 읽기 자료
Course Details10m
Week 1 FAQs (Optional)
1개 연습문제
How Do We Find Disease-Causing Mutations? (Week 1)15m
2
완료하는 데 4시간 필요

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>

...
3 videos (Total 21 min), 1 reading, 2 quizzes
3
완료하는 데 4시간 필요

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>

...
4 videos (Total 22 min), 1 reading, 3 quizzes
4개의 동영상
Further Applications of Read Mapping 2m
1개의 읽기 자료
Week 3 FAQs (Optional)
1개 연습문제
How Do We Find Disease-Causing Mutations? (Weeks 2-3)20m
4
완료하는 데 4시간 필요

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>

...
5 videos (Total 42 min), 2 quizzes
5개의 동영상
The Decoding Problem 5m
The Viterbi Algorithm 7m
4.6
6개의 리뷰Chevron Right

Finding Mutations in DNA and Proteins (Bioinformatics VI)의 최상위 리뷰

대학: TKJun 29th 2016

One of the best specialization on Coursera. Highly recommended for anyone who wants to apply his/her programming skills to fascinating real-world problems.

대학: DCSep 16th 2018

Really enjoyed this course. It was great to get to build on work from previous courses.

강사

Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Phillip Compeau

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

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