Sort Doubled Cyclic Shifts

video-placeholder
Loading...
查看授课大纲

您将学习的技能

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

审阅

4.5(998 个评分)

  • 5 stars
    66.23%
  • 4 stars
    21.94%
  • 3 stars
    7.91%
  • 2 stars
    2.30%
  • 1 star
    1.60%

NR

Oct 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

Aug 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

    Neil Rhodes

    Adjunct Faculty

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Pavel Pevzner

    Professor

  • Placeholder

    Alexander S. Kulikov

    Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。