Ukkonen's algorithm for approximate string matching

  Рет қаралды 11,470

Gaurav Sen

Gaurav Sen

Күн бұрын

Пікірлер: 15
@gkcs
@gkcs 6 жыл бұрын
Hey guys, just noticed a mistake in the analysis! The second method is actually going to take just T-steps number of operations, as the x gets cancelled when finding the distance between two diagonals. So the second method is exactly twice as fast as the first!
@wow2689
@wow2689 5 жыл бұрын
You left me in splits when you said " I will leave that proof upto you ". :-D This was a really cool video.... liked it....
@subratkumarsahu4295
@subratkumarsahu4295 2 жыл бұрын
What is the difference between approximate string matching and sequence alignment ?? Can you please tell the problem description of both ‼️
@aftabsaadsohail9608
@aftabsaadsohail9608 4 жыл бұрын
Can you do a video on approximate string matching over suffix trees?
@anupamkarn1009
@anupamkarn1009 6 жыл бұрын
Hey sir! Wanted to ask like often times I stuck in string manipulation questions so wanted to know what are must algorithms and keys points one should have to tackle majority of problems. You can take example of question like this months div 2 3rd question. Thanks!
@gkcs
@gkcs 6 жыл бұрын
These are important: Suffix arrays, Tries, KMP or Z algorithm and all the standard DP problems of strings (Edit distance, Max Substring, Max Subsequence etc...)
@anupamkarn1009
@anupamkarn1009 6 жыл бұрын
Thanks alot sir! You replied in O(1)!
@micheleinchingolo6863
@micheleinchingolo6863 3 жыл бұрын
Anyone knows where i can find a C implementation of this algorithm?
@aparichitsingh384
@aparichitsingh384 6 жыл бұрын
can you please explain how that diagnol thing is becoming mod(x-y) for any point (x, y)?
@gkcs
@gkcs 6 жыл бұрын
Let us say I move upto point (x,y) from (0,0). That means I can head along the diagonal for some time, till I have to take a straight horizontal or vertical line path to that point. I will choose the smallest path. The smallest Manhattan distance I have to traverse, as we have already moved along the diagonal and now have only horizontal and vertical options remaining, is equal to mod(x-y).
@aparichitsingh384
@aparichitsingh384 6 жыл бұрын
thanks for the reply!
@algolife2126
@algolife2126 6 жыл бұрын
Bro im in btech 1st yr and i know c and c++ but im not able to understand these things, pls tell me when and how can i learn competitive programming because im also not from a very good institute pls reply bro
@aravindha12
@aravindha12 6 жыл бұрын
First
@gkcs
@gkcs 6 жыл бұрын
You bet!
@aravindha12
@aravindha12 6 жыл бұрын
ill be able to understand ur videos one day, but ill not giveup on watching :)
Digit dynamic programming with a SPOJ example
13:21
Gaurav Sen
Рет қаралды 29 М.
ADS1: Edit distance for approximate matching
9:18
Ben Langmead
Рет қаралды 11 М.
Правильный подход к детям
00:18
Beatrise
Рет қаралды 1,9 МЛН
coco在求救? #小丑 #天使 #shorts
00:29
好人小丑
Рет қаралды 85 МЛН
УДИВИЛ ВСЕХ СВОИМ УХОДОМ!😳 #shorts
00:49
How Many Balloons To Make A Store Fly?
00:22
MrBeast
Рет қаралды 173 МЛН
Approximate string matching (Dynamic Programming Approach)
10:49
WIT Solapur - Professional Learning Community
Рет қаралды 6 М.
I never understood why you can't go faster than light - until now!
16:40
FloatHeadPhysics
Рет қаралды 4,2 МЛН
Beat Ronaldo, Win $1,000,000
22:45
MrBeast
Рет қаралды 104 МЛН
Minimum Edit Distance Dynamic Programming
9:47
Tushar Roy - Coding Made Simple
Рет қаралды 544 М.
Rabin-Karp Algorithm | Searching for Patterns | GeeksforGeeks
11:32
GeeksforGeeks
Рет қаралды 276 М.
Suffix Tree using Ukkonen's algorithm
1:16:13
Tushar Roy - Coding Made Simple
Рет қаралды 107 М.
Правильный подход к детям
00:18
Beatrise
Рет қаралды 1,9 МЛН