The following pages link to Linear-size suffix tries (Q294967):
Displaying 9 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Linear time online algorithms for constructing linear-size suffix trie (Q6614010) (← links)
- Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)