Sub-quadratic time and linear space data structures for permutation matching in binary strings.
Tanaeem M. MoosaM. Sohel RahmanPublished in: J. Discrete Algorithms (2012)
Keyphrases
- linear space
- binary strings
- data structure
- space efficient
- external memory
- hamming distance
- genetic algorithm
- sequence data
- computational complexity
- pattern matching
- encoding scheme
- matching algorithm
- locality sensitive hashing
- main memory
- image matching
- nearest neighbor search
- graph matching
- quadtree
- pairwise
- sliding window
- query processing