Fast randomized approximate string matching with succinct hash data structures.
Alberto PolicritiNicola PrezzaPublished in: BMC Bioinform. (2015)
Keyphrases
- approximate string matching
- data structure
- suffix array
- suffix tree
- string matching
- b tree
- genomic databases
- edit distance
- hash table
- n gram
- indexing techniques
- space efficient
- main memory
- index structure
- itemsets
- compressed text
- bloom filter
- tree structure
- indexing structure
- high dimensional
- dynamic programming
- similarity measure
- object recognition
- space requirements
- pattern matching