Random Access to grammar-Compressed Strings.
Philip BilleGad M. LandauRajeev RamanKunihiko SadakaneSrinivasa Rao SattiOren WeimannPublished in: SODA (2011)
Keyphrases
- random access
- suffix array
- finite state automata
- compressed text
- disk storage
- data structure
- multiview video coding
- natural language
- compressed domain
- flash memory
- memory size
- solid state
- context free grammars
- grammatical inference
- approximate string matching
- edit distance
- data compression
- variable length
- string matching
- suffix tree
- file size
- hard disk
- pattern matching