Initialization

Loading...
Ver programa

Destrezas que aprenderás

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

Revisiones

4.5 (597 calificaciones)
  • 5 stars
    383 ratings
  • 4 stars
    141 ratings
  • 3 stars
    49 ratings
  • 2 stars
    17 ratings
  • 1 star
    7 ratings
PG

Nov 19, 2017

great course, interesting concepts and very well delivered content from lecture videos. challenging and rewarding programming assignments.

KP

Jun 24, 2018

Learned a lot in the class. It was really excellent. But many a times we need to hear twice to understand some of the concepts clearly.

De la lección
Constructing Suffix Arrays and 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.