About this document
Suffix Tries: Structure and Applications by abhayanilark is a document available to read on EtoBox.
Suffix tries are a data structure used to store the suffixes of a string to enable efficient searching and other string operations on the stored text. They work by building a trie where each path from the root represents a suffix. This allows queries like searching for a substring or counting occurrences to be done in time proportional to the length of the query regardless of the size of the stored text. Common applications include searching for substrings/suffixes, counting occurrences, and finding the lon
- Author
- abhayanilark
- Language
- EN