What is a suffix tree?
educative.io · 135 words · saved by 1 readers
Contributor: Rukhshan Haroon
A suffix tree is a tree data structure typically used to store a list of strings. It is also referred to as the compressed version of a trie, as, unlike a trie, each unique suffix in the list is compressed together and represented by a single node or branch in a suffix tree. There are many ways to construct a suffix tree, but the semantics that is shared by most if not all types of suffix trees are as follows: A special character is appended to each sub-string. Each leaf node contains the starting position or index of the suffix it represents. The alphabets of any suffix are compressed…
saved by
related reading
- Pattern Searching using Suffix Tree - GeeksforGeeksgeeksforgeeks.org
- Notes - Suffix Treevisualgo.net
- Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)favtutor.com
- Compressed Tries - GeeksforGeeksgeeksforgeeks.org
- Trie - Wikipediaen.wikipedia.org
- Ternary search tree - Wikipediaen.wikipedia.org
- Trie Data Structure - GeeksforGeeksgeeksforgeeks.org
- Merkle Tree | Brilliant Math & Science Wikibrilliant.org
- Introduction of B Tree - GeeksforGeeksgeeksforgeeks.org
- Tree (abstract data type) - Wikipediaen.wikipedia.org
- How Cursor Indexes Codebases Fastread.engineerscodex.com
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl