Burrows-Wheeler Transform

video-placeholder
Loading...
강의 계획표 보기

배우게 될 기술

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

검토

4.5개(985개 평가)

  • 5 stars
    66.39%
  • 4 stars
    21.82%
  • 3 stars
    7.91%
  • 2 stars
    2.33%
  • 1 star
    1.52%

NR

2019년 10월 18일

Filled StarFilled StarFilled StarFilled StarFilled Star

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

2019년 8월 19일

Filled StarFilled StarFilled StarFilled StarFilled Star

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

수업에서

Burrows-Wheeler Transform and Suffix Arrays

강사:

  • Placeholder

    Alexander S. Kulikov

    Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Pavel Pevzner

    Professor

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.