Maximal and minimal representations of gapped and non-gapped motifs of a string.
Esko UkkonenPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- biological sequences
- suffix array
- data structure
- space efficient
- sequence data
- suffix tree
- ms ms
- databases
- motif discovery
- string matching
- motif finding
- dna sequences
- computational biology
- long strings
- protein sequences
- data compression
- binding sites
- similarity measurement
- molecular biology
- biological data
- higher level
- multi dimensional
- dynamic programming
- high throughput
- multiple alignment