About this Course
최근 조회 5,259

다음의 4/7개 강좌

100% 온라인

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

탄력적인 마감일

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

초급 단계

완료하는 데 약 17시간 필요

영어

자막: 영어

다음의 4/7개 강좌

100% 온라인

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

탄력적인 마감일

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

초급 단계

완료하는 데 약 17시간 필요

영어

자막: 영어

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

1
완료하는 데 3시간 필요

Week 1: Introduction to Evolutionary Tree Construction

<p>Welcome to our class!</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>Weeks 1-3: Which Animal Gave Us SARS? (<i>Evolutionary tree construction</i>)</li><li>Weeks 4-5: Was <em>T. rex</em> Just a Big Chicken?&nbsp;(<em>Combinatorial Algorithms</em>)</li></ol><p>In Week 6, you will complete a Bioinformatics Application Challenge to apply evolutionary tree construction algorithms in order to determine the origin of the recent ebola outbreak in Africa.</p><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. What do stick bugs and bats have to do with deadly viruses? And how can bioinformatics be used to stop these viruses in their tracks? Start learning today and find out!</p><p><img src="http://bioinformaticsalgorithms.com/images/cover/evolution_cropped.jpg" title="Image: http://bioinformaticsalgorithms.com/images/cover/evolution_cropped.jpg" width="528"></p>...
5 videos (Total 34 min), 2 readings, 3 quizzes
5개의 동영상
The Fastest Outbreak 5m
Transforming Distance Matrices into Evolutionary Trees 6m
Toward an Algorithm for Distance-Based Phylogeny Construction 8m
Additive Phylogeny 9m
2개의 읽기 자료
Course Details10m
Week 1 FAQs (Optional)
1개 연습문제
Week 1 Quiz15m
2
완료하는 데 3시간 필요

Week 2: More Algorithms for Constructing Trees from Distance Matrices

<p>Welcome to Week 2 of class!</p> <p>Last week, we started to see how evolutionary trees can be constructed from distance matrices. &nbsp;This week, we will encounter additional algorithms for this purpose, including the neighbor-joining algorithm, which has become one of the top-ten most cited papers in all of science since its introduction three decades ago.</p>...
3 videos (Total 17 min), 1 reading, 3 quizzes
3개의 동영상
Ultrametric Trees 6m
The Neighbor-Joining Algorithm 7m
1개의 읽기 자료
Week 2 FAQs (Optional)
1개 연습문제
Week 2 Quiz15m
3
완료하는 데 4시간 필요

Week 3: Constructing Evolutionary Trees from Characters

<p>Welcome to week 3 of class!</p> <p>Over the last two weeks, we have seen several different algorithms for constructing evolutionary trees from distance matrices.</p> <p>This week, we will conclude the current chapter by considering what happens if we use properties called "characters" instead of distances. We will also see how to infer the ancestral states of organisms in an evolutionary tree, and consider whether it is possible to define an efficient algorithm for this task.</p>...
4 videos (Total 20 min), 1 reading, 3 quizzes
4개의 동영상
The Small Parsimony Algorithm 8m
The Large Parsimony Algorithm 3m
Evolutionary Tree Reconstruction in the Modern Era 5m
1개의 읽기 자료
Week 3 FAQs (Optional)
1개 연습문제
Week 3 Quiz15m
4
완료하는 데 1시간 필요

Week 4

<p>Welcome to week 4 of the class!</p> <p>Did birds evolve from dinosaurs? Over the next two weeks, we will see how we could analyze molecular evidence in support of this theory. You can find this week's Bioinformatics Cartoon from Randall Christopher at the bottom of this E-mail. Why does the <em>T. rex&nbsp;</em>look so much like a chicken? And why is the monkey typing frantically? Keep learning to find out!</p> <p><img src="http://bioinformaticsalgorithms.com/images/cover/proteomics_cropped.jpg" title="Image: http://bioinformaticsalgorithms.com/images/cover/proteomics_cropped.jpg" width="528"></p>...
4 videos (Total 26 min), 1 reading, 2 quizzes
4개의 동영상
Decoding an Ideal Spectrum 5m
From Ideal to Real Spectra 5m
Peptide Sequencing 7m
1개의 읽기 자료
Note on This Week's Assignments10m
1개 연습문제
Week 4 Quiz15m
5
완료하는 데 1시간 필요

Week 5: Resolving the T. rex Peptides Mystery?

<p>Welcome to week 5 of class!</p> <p>Last week, we asked whether it is possible for dinosaur peptides to survive locked inside of a fossil for 65 million years. This week, we will see what this question has to do with statistics; in the process, we will see how a monkey typing out symbols on a typewriter can be used to address it.</p>...
5 videos (Total 44 min), 1 reading, 2 quizzes
5개의 동영상
Spectral Dictionaries 6m
The Ostrich Hemoglobin Riddle 15m
Searching for Post-Translational Modifications 5m
Spectral Alignment Algorithm 11m
1개의 읽기 자료
Note on This Week's Content10m
1개 연습문제
Week 5 Quiz15m
6
완료하는 데 4시간 필요

Week 6: Bioinformatics Application Challenge

<p>Welcome to the sixth and final week of the course!</p> <p>In this week's Bioinformatics Application Challenge, we will use reconstruct an evolutionary tree of ebolaviruses and use it to determine the origin of the pathogen that caused the recent outbreak in Africa.</p>...
1 quiz
4.5
12개의 리뷰Chevron Right

최상위 리뷰

대학: RGJul 20th 2017

Covers the most important algorithms for phylogenetic trees. Fascinating exam

강사

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

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