Using BWT for Pattern Matching

Loading...
Eye
查看授課大綱

您將學習的技能

Suffix Tree, Suffix Array, Knuth–Morris–Pratt (KMP) Algorithm, Algorithms On Strings

審閱

4.5(597 個評分)
  • 5 stars
    383 ratings
  • 4 stars
    141 ratings
  • 3 stars
    49 ratings
  • 2 stars
    17 ratings
  • 1 star
    7 ratings
PG

Nov 19, 2017

great course, interesting concepts and very well delivered content from lecture videos. challenging and rewarding programming assignments.

KP

Jun 24, 2018

Learned a lot in the class. It was really excellent. But many a times we need to hear twice to understand some of the concepts clearly.

從本節課中
Burrows-Wheeler Transform and Suffix Arrays

教學方

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Pavel  Pevzner

    Pavel Pevzner

    Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

探索我們的目錄

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