SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size.
Eldar GiladiMichael G. WalkerJames Ze WangWayne VolkmuthPublished in: Bioinform. (2002)
Keyphrases
- database
- detection algorithm
- learning algorithm
- computational complexity
- preprocessing
- times faster
- tree structure
- long sequences
- worst case
- probabilistic model
- computational cost
- experimental evaluation
- dynamic programming
- np hard
- cost function
- high accuracy
- k means
- clustering method
- database systems
- space complexity
- recognition algorithm
- memory requirements
- worst case time complexity
- data sets
- optimization algorithm
- convergence rate
- segmentation algorithm
- expectation maximization
- sequence alignment
- fixed size
- scales linearly
- simulated annealing
- optimal solution