Can You Solve Closest String Faster than Exhaustive Search?

Amir Abboud Nick Fischer Elazar Goldenberg Karthik C. S.Ron Safier

Published in: CoRR (2023)

Keyphrases

exhaustive search
computational complexity
dynamic programming
brute force
search methods
closest string
solution space
search space
nearest neighbor search
lower bound
genetic algorithm
simulated annealing
computationally feasible
optimal solution
search algorithm