A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem.
Daniel R. AllenSharma V. ThankachanBojian XuPublished in: BCB (2018)
Keyphrases
- times faster
- computationally efficient
- search space
- cost function
- detection algorithm
- theoretical analysis
- worst case
- single pass
- hamming distance
- clustering method
- expectation maximization
- high accuracy
- experimental evaluation
- learning algorithm
- decision trees
- k means
- objective function
- computational cost
- genetic algorithm
- significant improvement
- high efficiency
- dynamic programming
- recognition algorithm
- computational complexity
- highly efficient
- image sequences
- similarity measure
- optimization algorithm
- lower bound
- particle swarm optimization
- simulated annealing
- np hard