Brute Force Approach to Pattern Matching

Loading...
Ver programa

Destrezas que aprenderás

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

Revisiones

4.5 (654 calificaciones)
  • 5 stars
    422 ratings
  • 4 stars
    155 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.

De la lección
Suffix Trees

Impartido por:

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Pavel  Pevzner

    Pavel Pevzner

    Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

Explora nuestro catálogo

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