开始时间: 04/22/2022 持续时间: Unknown
所在平台: CourseraArchive 课程类别: 其他类别 |
课程主页: https://www.coursera.org/course/mutations
课程评论:没有评论
Although biologists assembled a reference human genomes in 2001, your own genome differs from this reference genome by millions of mutations. In this chapter, we will learn combinatorial pattern matching algorithms for finding these mutations, something that future doctors will be able to do within minutes in order to find disease genes.
We will then examine the problem of detecting subtle similarities that evade the traditional sequence comparison algorithms that we studied in "Comparing Genes, Genomes, and Proteins". Having efficient algorithms for comparing highly diverged sequences is important, since a single misaligned nucleotide can misclassify a protein and prevent biologists from inferring its function. We will consider a popular approach to sequence comparison based on an abstract machine called a Hidden Markov Model.
How Do We Locate Disease-Causing Mutations? (Combinatorial Pattern Matching)
In this class, we will compare DNA from an individual against a reference human genome to find potentially disease-causing mutations. We will also learn how to identify the function of a protein even if it has been affected by so many mutations compared to similar proteins with known functions that it has become barely recognizable.