Using BWT for Pattern Matching

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.5(656 個評分)
  • 5 stars
    423 ratings
  • 4 stars
    156 ratings
  • 3 stars
    52 ratings
  • 2 stars
    17 ratings
  • 1 star
    8 ratings
AF

Aug 20, 2019

Takes your understanding of string algorithms to the next level and gives you new ideas of handling large amount of memory intensive tasks.

PG

Nov 19, 2017

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

從本節課中
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

探索我們的目錄

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