Loupe Copy

Lecture: Preprocessing

Loading...
來自 Johns Hopkins University 的課程
DNA 测序算法
352 個評分
Johns Hopkins University

DNA 测序算法

352 個評分
課程 4（共 8 門，Specialization 基因组数据科学）
從本節課中
Preprocessing, indexing and approximate matching
In this module, we learn useful and flexible new algorithms for solving the exact and approximate matching problems. We'll start by learning Boyer-Moore, a fast and very widely used algorithm for exact matching
Week 2 Introduction 1:34
Lecture: Boyer-Moore basics8:50
Lecture: Boyer-Moore: putting it all together6:15
Lecture: Diversion: Repetitive elements5:02
Practical: Implementing Boyer-Moore 10:01
Lecture: Preprocessing7:02
Lecture: Indexing and the k-mer index10:43
Lecture: Ordered structures for indexing8:06
Lecture: Hash tables for indexing7:13
Practical: Implementing a k-mer index 7:23
Lecture: Variations on k-mer indexes9:25
Lecture: Genome indexes used in research9:34
Lecture: Approximate matching, Hamming and edit distance6:53
Lecture: Pigeonhole principle6:37
Practical: Implementing the pigeonhole principle 9:30

與講師見面

  • Ben Langmead, PhD
    Ben Langmead, PhD
    Assistant Professor
    Computer Science
  • Jacob Pritt
    Jacob Pritt

    Department of Computer Science

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。

Coursera 致力於普及全世界最好的教育，它與全球一流大學和機構合作提供在線課程。
© 2018 Coursera Inc. 保留所有權利。
通過 App Store 下載通過 Google Play 獲取