Ukkonen's algorithm for approximate string matching

This algorithm allows two strings to be approximately matched using an enhanced edit distance algorithm devised by Ukkonen.

[gkcs]

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!

[subratkumarsahu]

What is the difference between approximate string matching and sequence alignment ?? Can you please tell the problem description of both ‼️

[wow]

You left me in splits when you said " I will leave that proof upto you ". :-D
This was a really cool video.... liked it....

[aftabsaadsohail]

Can you do a video on approximate string matching over suffix trees?

[algolife]

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

[anupamkarn]

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!

[aparichitsingh]

can you please explain how that diagnol thing is becoming mod(x-y) for any point (x, y)?

[micheleinchingolo]

Anyone knows where i can find a C implementation of this algorithm?