Ukkonen's Algorithm

  Рет қаралды 5,654

Tarvalas

Tarvalas

Күн бұрын

Пікірлер: 7
@abhijit-sarkar
@abhijit-sarkar Жыл бұрын
I counted 3 billions okays.
@imatrixx572
@imatrixx572 Жыл бұрын
Thanks god, you saved my live.
@saliadel5238
@saliadel5238 2 жыл бұрын
Nice bro you saved my project I really need that explanation ❤
@mhliu5017
@mhliu5017 7 ай бұрын
Amazing video❤
@yceraf
@yceraf 6 ай бұрын
This is the best video I could find about the algorithm, but sill is wrong, following his explanation the leaf node 9, (min 46:37) it should be node 10 and therefore wrong. because " i - active_length" i = 10, active_length = 0. Then how is possible? I tried to make the implementation but in some cases crash or put wrong leaf node index
@accountmy4622
@accountmy4622 4 ай бұрын
had the same question. The index and active_length didn't work from moving to new active node X and Y
@daviddugar3483
@daviddugar3483 3 ай бұрын
it is possible bcs active_length for this equation is actually 2 not 0 (because we changed the 'root' to the node which if pointed to by 'na' edge)
Suffix tries: introduction
26:27
Ben Langmead
Рет қаралды 10 М.
From a Trie to a Suffix Tree
11:46
Bioinformatics Algorithms: An Active Learning Approach
Рет қаралды 22 М.
How to Fight a Gross Man 😡
00:19
Alan Chikin Chow
Рет қаралды 19 МЛН
How Many Balloons To Make A Store Fly?
00:22
MrBeast
Рет қаралды 161 МЛН
Suffix Tree using Ukkonen's algorithm
1:16:13
Tushar Roy - Coding Made Simple
Рет қаралды 107 М.
Suffix tries and trees
1:08:21
Ben Langmead
Рет қаралды 72 М.
16. Strings
1:24:30
MIT OpenCourseWare
Рет қаралды 126 М.
Longest common substring problem suffix array
11:30
WilliamFiset
Рет қаралды 40 М.
Suffix trees: basic queries
16:13
Ben Langmead
Рет қаралды 6 М.
Suffix Tries
7:17
Lalitha Natraj
Рет қаралды 123 М.
Using the Suffix Tree - Conceptually
12:25
christamcc
Рет қаралды 26 М.
15. Static Trees
1:23:00
MIT OpenCourseWare
Рет қаралды 24 М.