Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Gilfanov, Arthur"'
Autor:
Gilfanov, Arthur
The purpose of this study is to develop an efficient algorithm to solve a variation of the NP-hard Shortest Common Superstring (SCS) problem. In this version of the problem, one string is allowed to have up to K mistakes, meaning it does not match th
Externí odkaz:
http://arxiv.org/abs/2410.23900
