Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Boldaji, Hesam Tahmasebi"'
Autor:
Abdi, Alireza, Djukanovic, Marko, Boldaji, Hesam Tahmasebi, Salehi, Hadis, Kartelj, Aleksandar
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 applications can be found in coding theory, computational biology, and designing
Externí odkaz:
http://arxiv.org/abs/2407.13023
