Computing Prefix Function

Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.5 (624 ratings)
  • 5 stars
    405 ratings
  • 4 stars
    145 ratings
  • 3 stars
    49 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.

From the lesson
Knuth–Morris–Pratt Algorithm

Taught By

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Pavel  Pevzner

    Pavel Pevzner

    Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.