Hi Ben! Thanks a lot for these nice lectures! Just a little remark about algorithm with permutations. It seems that actualy this algorithm does not solve the SCS problem in general (when substrings has a different length). This short example is good to demonstrate it {ABBA, BB}. So probably on each step you should also check if substring already content in superstring.
@cacheman
Ай бұрын
Usually it's assumed (without loss of generality) that the input is already factor-free.
@dc33333
6 жыл бұрын
Thank You Ben!!! Very useful..
@ajayshinde9844
3 жыл бұрын
really good dude
@chaoschao9432
5 жыл бұрын
Where is the following lecture?
@jonaskoelker
3 жыл бұрын
I think it's this one: kzitem.info/news/bejne/wn2ms3xrpWWepX4
@foreverursabhi
3 жыл бұрын
It'd be really helpful if instead of referring to previous and next lectures, you used specific numbers. I'm looking at this playlist kzitem.info/door/PL2mpR0RYFQsBiCWVJSvVAO3OJ2t7DzoHA, and can only guess what previous lecture talked about overlap graphs and which next one would solve the SCS problem faster than n!.
@gamermatrix8103
7 жыл бұрын
You sound a lot like Mark Zuckerberg. Have u got that before ?
Пікірлер: 9