Initialization

Loading...
Visualizar o programa do curso

Habilidades que você aprenderá

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

Avaliações

4.5 (598 classificações)
  • 5 stars
    384 ratings
  • 4 stars
    141 ratings
  • 3 stars
    49 ratings
  • 2 stars
    17 ratings
  • 1 star
    7 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.

Na lição
Constructing Suffix Arrays and Suffix Trees

Ministrado 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

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.