Brute Force Approach to Pattern Matching

Ver programa

Destrezas que aprenderás

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


4.5 (969 calificaciones)

  • 5 stars
    66,04 %
  • 4 stars
    21,98 %
  • 3 stars
    8,04 %
  • 2 stars
    2,37 %
  • 1 star
    1,54 %


18 de oct. de 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

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!


19 de ago. de 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

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

De la lección

Suffix Trees

Impartido por:

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor

  • Placeholder

    Michael Levin


  • Placeholder

    Pavel Pevzner


  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.