Suffix Array and Suffix Tree

Loading...
Просмотреть программу курса

Получаемые навыки

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

Рецензии

4.5 (оценок: 910)
  • 5 stars
    66.04%
  • 4 stars
    22.52%
  • 3 stars
    8.02%
  • 2 stars
    2.08%
  • 1 star
    1.31%
NR
18 окт. 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!

AF
19 авг. 2019 г.

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

Из урока
Constructing Suffix Arrays and Suffix Trees

Преподаватели

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Pavel Pevzner

    Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.