Comparing Genes, Proteins, and Genomes (Bioinformatics III)

所在平台: CourseraArchive

课程类别: 其他类别

大学或机构: CourseraNew

课程主页: https://www.coursera.org/archive/comparing-genomes

课程评论:没有评论

第一个写评论        关注课程

课程简介

University of California, San Diego

课程大纲

Welcome to class!

If you joined us in the previous course in this Specialization, then you became an expert at assembling 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 sequence alignment, 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):

  1. How Do We Compare DNA Sequences? (Dynamic Programming)
  2. Are There Fragile Regions in the Human Genome? (Combinatorial Algorithms)

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 print companion. 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.

课程评论(0条)

课程详情

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.

比较基因,蛋白质和基因组(生物信息学III):在上一课程中对基因组进行测序后,我们想对它们进行比较,以确定物种如何进化以及如何使它们与众不同。 在课程的前半部分,我们将比较两个短的生物学序列,例如基因(即DNA的短序列)或蛋白质。我们将遇到一个称为动态编程的强大算法工具,该工具将帮助我们确定将两种基因/蛋白质分开的突变数。 在课程的下半部分,我们将“缩小”以比较整个基因组,在这里我们看到称为基因组重排的大规模突变,这种地震事件在数百万年的进化过程中一直围绕着大块DNA扩散。看人类和小鼠的基因组,我们会问自己:就像地震更有可能沿着断层线发生一样,我们的基因组中是否存在“脆弱”的位置,并且更容易因基因组重排而断裂?我们将看到组合算法将如何帮助我们回答这个问题。 最后,您将学习如何应用流行的生物信息学软件工具解决包括BLAST在内的序列比对问题。

课程标签

0人关注该课程

主题相关的课程