Parameterized complexity analysis for the Closest String with Wildcards problem.
Danny HermelinLiat RozenbergPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- complexity analysis
- closest string
- practical solutions
- theoretical analysis
- pattern matching
- feasible solution
- lower bound
- randomized algorithm
- constant factor approximation
- computational complexity
- approximation algorithms
- first order logic
- neural network
- natural language
- xpath queries
- genetic algorithm
- machine learning
- linear combination
- knowledge representation
- special case
- decision problems
- objective function