Parameterized Complexity Analysis for the Closest String with Wildcards Problem.
Danny HermelinLiat RozenbergPublished in: CPM (2014)
Keyphrases
- complexity analysis
- closest string
- practical solutions
- pattern matching
- theoretical analysis
- feasible solution
- lower bound
- approximation algorithms
- randomized algorithm
- computational complexity
- first order logic
- constant factor approximation
- neural network
- greedy algorithm
- reinforcement learning
- simulated annealing
- np hard
- evolutionary algorithm
- learning algorithm
- genetic algorithm