Brute Force Approach to Pattern Matching

Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.5 (884 ratings)
  • 5 stars
    65.61%
  • 4 stars
    22.85%
  • 3 stars
    8.14%
  • 2 stars
    2.14%
  • 1 star
    1.24%
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.

From the lesson
Suffix Trees

Taught By

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Pavel Pevzner

    Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explore our Catalog

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