Computing runs on a trie
From MaRDI portal
Recommendations
- Efficiently computing runs on a trie
- A generalization of the trie data structure
- Algorithms for trie compaction
- scientific article; zbMATH DE number 4775
- On greedy trie execution
- Computing runs on a general alphabet
- New trie data structures which support very fast search operations
- Computing on binary strings
Cites work
- A linear-time algorithm for a special case of disjoint set union
- An on-line string superprimitivity test
- Computing runs on a general alphabet
- Constructing Efficient Dictionaries in Close to Sorting Time
- Efficient counting of square substrings in a tree
- Extracting powers and periods in a word from its runs structure
- Faster longest common extension queries in strings over general alphabets
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1522932 (Why is no real title available?)
- Longest common extensions in trees
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries
- Range predecessor and Lempel-Ziv parsing
- Squares, cubes, and time-space efficient string searching
- String powers in trees
- The ``runs theorem
- The level ancestor problem simplified
- The maximal number of cubic runs in a word
- The maximum number of squares in a tree
- The suffix tree of a tree and minimizing sequential transducers
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
This page was built for publication: Computing runs on a trie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088914)
