A parallel multistart algorithm for the closest string problem.
Fernando C. GomesCláudio Nogueira de MenesesPanos M. PardalosGerardo Valdisio R. VianaPublished in: Comput. Oper. Res. (2008)
Keyphrases
- detection algorithm
- cost function
- optimization algorithm
- parallel implementation
- preprocessing
- times faster
- improved algorithm
- optimal solution
- significant improvement
- computational cost
- worst case
- linear programming
- similarity measure
- clustering method
- segmentation algorithm
- computationally efficient
- high accuracy
- dynamic programming
- np hard
- computational complexity
- neural network
- parallel computation
- hardware implementation
- depth first search
- parallel implementations
- memory requirements
- ant colony optimization
- theoretical analysis
- particle swarm optimization
- probabilistic model
- k means
- objective function