Notes - Suffix Tree
A Suffix Tree is a compressed tree containing all the suffixes of the given (usually long) text string T of length n characters (n can be in order of hundred thousands characters).
Notes - Suffix Tree Suffix Tree 1. Introduction A Suffix Tree is a compressed tree containing all the suffixes of the given (usually long) text string T of length n characters ( n can be on order of hundred thousands of characters). The positions of each suffix in the text string T are recorded as integer indices at the leaves of the Suffix Tree whereas the path labels (concatenation of edge labels starting from the root) of the leaves describe the suffixes. Suffix Tree provides a particularly fast implementation for many important (long) string operations. This data structure is very related
saved by
related reading
- Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)favtutor.com
- Compressed Tries - GeeksforGeeksgeeksforgeeks.org
- Aho-Corasick Algorithm for Pattern Searching - GeeksforGeeksgeeksforgeeks.org
- What is a suffix tree?educative.io
- Pattern Searching using Suffix Tree - GeeksforGeeksgeeksforgeeks.org
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's Blogburntsushi.net
- Introduction of B Tree - GeeksforGeeksgeeksforgeeks.org
- Trie Data Structure - GeeksforGeeksgeeksforgeeks.org
- Trie - Wikipediaen.wikipedia.org
- Breadth-first search - Wikipediaen.wikipedia.org
- string - Data structure for fast full text search - Stack Overflowstackoverflow.com