Computing Prefix Function

Loading...
查看授课大纲

您将学习的技能

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

审阅

4.5(645 个评分)
  • 5 stars
    415 ratings
  • 4 stars
    153 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.

从本节课中
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

探索我们的目录

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