Coursera
探索
  • 浏览
  • 搜索
  • 企业版
  • 登录
  • 注册

Comparing Genes, Proteins, and Genomes (Bioinformatics III)

总览授课大纲常见问题解答制作方价格评分和审阅

主页生命科学生物信息学

Comparing Genes, Proteins, and Genomes (Bioinformatics III)

美国加州大学圣地亚哥分校

关于此课程: Once we have sequenced genomes in the previous course, we would like to compare them to determine how species have evolved and what makes them different. In the first half of the course, we will compare two short biological sequences, such as genes (i.e., short sequences of DNA) or proteins. We will encounter a powerful algorithmic tool called dynamic programming that will help us determine the number of mutations that have separated the two genes/proteins. In the second half of the course, we will "zoom out" to compare entire genomes, where we see large scale mutations called genome rearrangements, seismic events that have heaved around large blocks of DNA over millions of years of evolution. Looking at the human and mouse genomes, we will ask ourselves: just as earthquakes are much more likely to occur along fault lines, are there locations in our genome that are "fragile" and more susceptible to be broken as part of genome rearrangements? We will see how combinatorial algorithms will help us answer this question. Finally, you will learn how to apply popular bioinformatics software tools to solve problems in sequence alignment, including BLAST.

此课程适用人群: 这个课程主要针对计算机科学、生物学以及相关领域的本科水平的学生。他们将了解到这两门学科的交叉代表了现代科学的前沿。


制作方:  美国加州大学圣地亚哥分校
美国加州大学圣地亚哥分校

  • Pavel  Pevzner

    教学方:  Pavel Pevzner, Professor

    Department of Computer Science and Engineering

  • Phillip Compeau

    教学方:  Phillip Compeau, Visiting Researcher

    Department of Computer Science & Engineering

  • Nikolay Vyahhi

    教学方:  Nikolay Vyahhi, Visiting Scholar

    Department of Computer Science and Engineering
基本信息
课程 3(共 7 门,Bioinformatics Specialization )
级别Beginner
语言
English
如何通过通过所有计分作业以完成课程。
用户评分
4.7 星
平均用户评分 4.7查看学生的留言
授课大纲
第 1 周
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 视频, 2 阅读材料
  1. 视频: (Check Out Our Wacky Course Intro Video!)
  2. Leyendo: Course Details
  3. Elemento LTI: Stepik Interactive Text for Week 1
  4. 视频: From Sequence Comparison to Biological Insights
  5. 视频: The Alignment Game and the Longest Common Subsequence Problem
  6. 视频: The Manhattan Tourist Problem
  7. 视频: The Change Problem
  8. 视频: Dynamic Programming and Backtracking Pointers
  9. 视频: From Manhattan to the Alignment Graph
  10. Leyendo: Week 1 FAQs (Optional)
已评分: Week 1 Quiz
已评分: Open in order to Sync Your Progress: Stepik Interactive Text for Week 1
第 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 视频, 1 阅读材料
  1. Elemento LTI: Stepik Interactive Text for Week 2
  2. 视频: From Global to Local Alignment
  3. Leyendo: Week 2 FAQs (Optional)
已评分: Week 2 Quiz
已评分: Open in order to Sync Your Progress: Stepik Interactive Text for Week 2
第 3 周
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 视频, 1 阅读材料
  1. Elemento LTI: Stepik Interactive Text for Week 3
  2. 视频: Penalizing Insertions and Deletions in Sequence Alignment
  3. 视频: Space-Efficient Sequence Alignment
  4. 视频: Multiple Sequence Alignment
  5. Leyendo: Week 3 FAQs (Optional)
已评分: Week 3 Quiz
已评分: Open in order to Sync Your Progress: Stepik Interactive Text for Week 3
第 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 视频, 1 阅读材料
  1. Elemento LTI: Stepik Interactive Text for Week 4
  2. 视频: Transforming Men Into Mice
  3. 视频: Sorting by Reversals
  4. 视频: Breakpoint Theorem
  5. 视频: Rearrangements in Tumor Genomes
  6. 视频: 2-Breaks
  7. Leyendo: Week 4 FAQs (Optional)
已评分: Week 4 Quiz
已评分: Open in order to Sync Your Progress: Stepik Interactive Text for Week 4
第 5 周
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 视频, 1 阅读材料
  1. Elemento LTI: Stepik Interactive Text for Week 5
  2. 视频: Breakpoint Graphs
  3. 视频: 2-Break Distance Theorem
  4. 视频: Rearrangement Hotspots in the Human Genome
  5. 视频: Synteny Block Construction
  6. Leyendo: Week 5 FAQs (Optional)
已评分: Week 5 Quiz
已评分: Open in order to Sync Your Progress: Stepik Interactive Text for Week 5
第 6 周
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.
    已评分: Bioinformatics Application Challenge

    常见问题解答
    运作方式
    Trabajo del curso
    Trabajo del curso

    Cada curso es como un libro de texto interactivo, con videos pregrabados, cuestionarios y proyectos.

    Ayuda de tus compañeros
    Ayuda de tus compañeros

    Conéctate con miles de estudiantes y debate ideas y materiales del curso, y obtén ayuda para dominar los conceptos.

    Certificados
    Certificados

    Obtén reconocimiento oficial por tu trabajo y comparte tu éxito con amigos, compañeros y empleadores.

    制作方
    美国加州大学圣地亚哥分校
    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.
    价格
    购买课程
    访问课程材料

    可用

    访问评分的材料

    可用

    收到最终成绩

    可用

    获得可共享的课程证书

    可用

    评分和审阅
    已评分 4.7,总共 5 个 60 评分
    Paolo Binetti

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

    Luis Fernando Rodríguez Caro

    Very challenging but excellent walk through

    Robert Kwapich

    This was intensive, time-consuming, thought-provoking ... pleasure! I really enjoyed it, it took me more time than the schedule proposed, but it was worth it. I liked exploring things on my own, and tampering with the code/algorithms. This part of the course now assumes that you can think intelligently and will do so. Although this is a course in bioinformatics I often found myself laying on the bed with a piece of paper drawing graphs in order to fully grasp what I need to do so my code would be more efficient.

    Excellent work! I'll start the next part now.

    Linbo Zhao

    I think Week 4 and 5 should be explained more. Pseudo-code can be more detailed.



    您可能也喜欢
    美国加州大学圣地亚哥分校
    分子进化 (生物信息学 IV)
    1 门课程
    美国加州大学圣地亚哥分校
    分子进化 (生物信息学 IV)
    查看课程
    美国加州大学圣地亚哥分校
    Finding Mutations in DNA and Proteins (Bioinformatics VI)
    1 门课程
    美国加州大学圣地亚哥分校
    Finding Mutations in DNA and Proteins (Bioinformatics VI)
    查看课程
    美国加州大学圣地亚哥分校
    Genomic Data Science and Clustering (Bioinformatics V)
    1 门课程
    美国加州大学圣地亚哥分校
    Genomic Data Science and Clustering (Bioinformatics V)
    查看课程
    美国加州大学圣地亚哥分校
    Genome Sequencing (Bioinformatics II)
    1 门课程
    美国加州大学圣地亚哥分校
    Genome Sequencing (Bioinformatics II)
    查看课程
    美国加州大学圣地亚哥分校
    Finding Hidden Messages in DNA (Bioinformatics I)
    1 门课程
    美国加州大学圣地亚哥分校
    Finding Hidden Messages in DNA (Bioinformatics I)
    查看课程
    Coursera
    Coursera 致力于普及全世界最好的教育,它与全球一流大学和机构合作提供在线课程。
    © 2018 Coursera Inc. 保留所有权利。
    通过 App Store 下载通过 Google Play 获取
    • Coursera
    • 关于
    • 管理团队
    • 工作机会
    • 目录
    • 证书
    • 学位
    • 商务
    • 政府版
    • 社区
    • 合作伙伴
    • 社区助教
    • 专业译员
    • 开发者
    • Beta 测试人员
    • 连接
    • 博客
    • Facebook
    • 领英
    • Twitter
    • Google+
    • 技术博客
    • 更多
    • 条款
    • 隐私
    • 帮助
    • 内容访问
    • 媒体
    • 联系我们
    • 目录
    • 附属公司