Sparse and Truncated Suffix Trees on Variable-Length Codes.
Takashi UemuraHiroki ArimuraPublished in: CPM (2011)
Keyphrases
- variable length
- suffix tree
- convolutional codes
- fixed length
- data structure
- suffix array
- disk resident
- n gram
- pattern matching
- string matching
- index structure
- neural network
- bitstream
- error correction
- high dimensional
- wavelet transform
- machine learning
- human motion
- information extraction
- query processing
- image sequences