Knuth-Morris-Pratt Algorithm

Loading...
查看授课大纲

您将学习的技能

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

审阅

4.5(757 个评分)
  • 5 stars
    65%
  • 4 stars
    24%
  • 3 stars
    8%
  • 2 stars
    2%
  • 1 star
    1%
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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。