An Ultra-Fast and Parallelizable Algorithm for Finding $k$k-Mismatch Shortest Unique Substrings.
Daniel R. AllenSharma V. ThankachanBojian XuPublished in: IEEE ACM Trans. Comput. Biol. Bioinform. (2021)
Keyphrases
- optimization algorithm
- np hard
- detection algorithm
- neural network
- convergence rate
- optimal solution
- dynamic programming
- recognition algorithm
- matching algorithm
- segmentation algorithm
- linear programming
- experimental evaluation
- computational cost
- worst case
- input data
- k means
- learning algorithm
- data sets
- distance measure
- cost function
- multi objective
- theoretical analysis
- preprocessing
- objective function
- classification algorithm
- similarity measure
- times faster
- convex hull
- memory requirements
- genetic algorithm
- hamming distance