Advanced Data Structures: Burrows-Wheeler Transform (BWT)

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

I still come back to this channel all the time for my other classes because they have the most straight forward explanations ever made. Thank you Prof Moshiri

ericbolander
Автор

Ok but how does that sequence help us with actual matching of the query strings? How much better is "can we do better than log?"?

mr.rabbit
Автор

i had taken up the course on coursera in 2017 where Niema Moshiri was the one guiding us during the coding part..
it is till date the best course on coursera i have taken where there ws active involvment
now i am studying bio informatics, i cannot access the course on stepik.
but while studying burrow wheeler transfrom i again came across this.. video...
great Niema Moshiri sir.
thank you!!!

nikhilkambli
Автор

What a cliffhanger. Then what? How do you align the queries?

lanternofthegreen
Автор

Yeah, sorry, this is a bit of a tease. You set up the problem: Olog(N) is too inefficient. You promised a solution, namely the BWT. You beautifully showed the algorithm behind the BWT. And then you never explained why on earth this newly transformed string helps us achieve effieciency better than Olog(N). How do you do the binary search with the BWT?

lukehebert
Автор

Very well explained videos, those are a great help :D

tioalra
Автор

Any chance you're from UC San Diego ? I was going through DSAlgo Course by UC San Diego and I got confused and ended up here lol

ShubhamSinghYoutube
join shbcf.ru