Constructing Suffix Trees: Ukkonen’s algorithm – Wikipedia
Posted by jpluimers on 2021/10/12
For my link archive:
- [WayBack] string – Ukkonen’s suffix tree algorithm in plain English – Stack Overflow
- [WayBack] Ukkonen’s algorithm – Wikipedia
- [WayBack] Esko Ukkonen – Wikipedia
- [WayBack] Esko Ukkonen
- [WayBack] Visualization of Ukkonen’s Algorithm
- [WayBack] Google Code Archive – Long-term storage for Google Code Project Hosting.
- [WayBack] suffix_trees.rb · GitHub
- [WayBack] Implementation of Ukkonen’s algorithm to build a prefix tree in O(n) · GitHub
- [WayBack] C# Suffix tree implementation based on Ukkonen’s algorithm. Full explanation here: http://stackoverflow.com/questions/9452701/ukkonens-suffix-tree-algorithm-in-plain-english · GitHub
- [WayBack] Simple suffix tree implementation in JavaScript. Install chalk to run the script below, or strip it down and remove all the debug messages and test cases. · GitHub
I also need to check out [WayBack] Martin Farach-Colton – Wikipedia, as his algorithm is likely more optimised and more versatile.
–jeroen
The Wiert Corner - irregular stream of stuff 
Leave a comment