generalized suffix tree python version based on https://github.com/maclandrol/SuffixTreeJS
- suffix tree
https://en.wikipedia.org/wiki/Suffix_tree
https://www.youtube.com/watch?v=aPRqocoBsFQ
- Ukkonen's Algorithm
http://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf
https://en.wikipedia.org/wiki/Ukkonen's_algorithm
https://stackoverflow.com/questions/9452701/ukkonens-suffix-tree-algorithm-in-plain-english
- Ukkonen’s Suffix Tree Construction
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-1/
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-2/
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-3/
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-4/
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-5/
https://www.geeksforgeeks.org/ukkonens-suffix-tree-construction-part-6/
- Visualization of Ukkonen's Algorithm
https://github.com/brenden/ukkonen-animation
http://brenden.github.io/ukkonen-animation/
- McCreight's suffix tree construction algorithm
http://101.96.10.64/users-birc.au.dk/cstorm/courses/StrAlg_f12/slides/suffix-tree-construction.pdf
- Suffix Tree Application
https://www.geeksforgeeks.org/suffix-tree-application-1-substring-check/
https://www.geeksforgeeks.org/suffix-tree-application-2-searching-all-patterns/
https://www.geeksforgeeks.org/suffix-tree-application-3-longest-repeated-substring/
https://www.geeksforgeeks.org/suffix-tree-application-4-build-linear-time-suffix-array/
https://www.geeksforgeeks.org/suffix-tree-application-5-longest-common-substring-2/
https://www.geeksforgeeks.org/suffix-tree-application-6-longest-palindromic-substring/
- Generalized Suffix Tree
https://www.geeksforgeeks.org/generalized-suffix-tree-1/
This is licensed under the MIT License