1 paper
Alireza Abdi, Marko Djukanovic, Hesam Tahmasebi Boldaji +2
The Closest String Problem is an NP-hard problem that aims to find a string that has the minimum distance from all sequences that belong to the given set of strings. Its applicatio…