Safe Shift

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.5(838 個評分)
  • 5 stars
    64.79%
  • 4 stars
    23.50%
  • 3 stars
    8.23%
  • 2 stars
    2.26%
  • 1 star
    1.19%
NR

Oct 19, 2019

Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!

HC

May 07, 2018

Excelentes algoritmos, nunca había pensado lo complicado que era hacer pattern matching eficientemente en términos de tiempo de procesamiento y memoria.

從本節課中
Knuth–Morris–Pratt Algorithm

教學方

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Pavel  Pevzner

    Pavel Pevzner

    Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

探索我們的目錄

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