Faster Algorithm for the Set Variant of the String Barcoding Problem.
Leszek GasieniecCindy Y. LiMeng ZhangPublished in: CPM (2008)
Keyphrases
- detection algorithm
- dynamic programming
- learning algorithm
- convex hull
- preprocessing
- improved algorithm
- theoretical analysis
- input data
- high accuracy
- convergence rate
- matching algorithm
- initial set
- memory efficient
- decomposition algorithm
- experimental evaluation
- cost function
- k means
- computational complexity
- objective function
- simulated annealing
- hamming distance
- evolutionary algorithm
- search space
- data structure
- neural network
- highly efficient
- recognition algorithm
- computationally demanding
- times faster
- optimization algorithm
- particle swarm optimization
- linear programming
- worst case
- probabilistic model
- computational cost
- significant improvement