A&DS S03E13. Suffix Tree. Ukkonen's Algorithm
Algorithms and data structures. Semester 3. Lecture 13 In the thirteenth lecture, we discussed Ukkonen's algorithm for constructing a suffix tree. ITMO University, 2021
▶︎
A&DS S03E14. Y-Fast Trie
▶︎
A&DS S03E09. Strings. Hashing. KMP. Z Algorithm
▶︎
Linear Time Construction of Suffix Trees with Ukkonen's Algorithm
▶︎
A&DS S04E14. Parallel Algorithms
▶︎
How to become better at competitive programming
▶︎
QBasic. Competitive programming 30 years ago.
▶︎
From Child Prodigy to Winning Fields Medal, Nobel of Math
▶︎
Lecture 1: Algorithmic Thinking, Peak Finding
▶︎
Suffix Tree using Ukkonen's algorithm
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
Creating the Suffix Tree - Conceptually
▶︎
16. Strings
▶︎
If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes
▶︎
Gil Strang's Final 18.06 Linear Algebra Lecture
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Ukkonen's Algorithm
▶︎
A&DS S03E10. Finite State Automata
▶︎
Suffix trees: basic queries
▶︎
Lecture - 15 Insertion in Red Black Trees
▶︎