Computing Prefix Function

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.5(910 個評分)
  • 5 stars
    66.04%
  • 4 stars
    22.52%
  • 3 stars
    8.02%
  • 2 stars
    2.08%
  • 1 star
    1.31%
NR
2019年10月18日

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!

AF
2019年8月19日

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

從本節課中
Knuth–Morris–Pratt Algorithm

教學方

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Pavel Pevzner

    Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

探索我們的目錄

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