Faster entropy-bounded compressed suffix trees.
Johannes FischerVeli MäkinenGonzalo NavarroPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- suffix tree
- suffix array
- data structure
- compressed text
- approximate string matching
- string matching
- tree construction
- index structure
- pattern matching
- disk resident
- space requirements
- space efficient
- data compression
- periodicity detection
- relational databases
- indexing structure
- information retrieval
- main memory
- image retrieval
- similarity measure