THE VIRTUAL SUFFIX TREE
From MaRDI portal
Publication:3655540
DOI10.1142/S0129054109007066zbMath1186.68136OpenAlexW2080967843MaRDI QIDQ3655540
Don A. Adjeroh, Jie Lin, Yue Jiang
Publication date: 8 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054109007066
Semisimple Lie groups and their representations (22E46) Differential geometry of symmetric spaces (53C35) Data structures (68P05) Noncompact Lie groups of transformations (57S20)
Related Items (1)
Cites Work
- Replacing suffix trees with enhanced suffix arrays
- Sublinear approximate string matching and biological applications
- On-line construction of suffix trees
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Space Efficient Suffix Trees
- Suffix Arrays: A New Method for On-Line String Searches
- Faster suffix tree construction with missing suffix links
- Linear work suffix array construction
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- On the sorting-complexity of suffix tree construction
This page was built for publication: THE VIRTUAL SUFFIX TREE
