A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies.
Costas S. IliopoulosLaurent MouchardSolon P. PissisPublished in: PARCO (2009)
Keyphrases
- parallel algorithm
- fixed length
- high throughput sequencing
- approximate string matching
- variable length
- n gram
- genome wide
- feature vectors
- string matching
- edit distance
- high throughput
- bitstream
- regulatory elements
- indexing techniques
- image compression
- suffix tree
- language model
- database systems
- databases
- sequence data
- feature space
- data structure
- suffix array
- rna seq
- data mining