International Journal of Foundations of Computer Science ( IF 0.523 ) Pub Date : 2020-08-26 , DOI: 10.1142/s0129054120500288 Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Wing-Kin Sung; Steven Watts
A closed string contains a proper factor occurring as both a prefix and a suffix but not elsewhere in the string. Closed strings were introduced by Fici (WORDS 2011) as objects of combinatorial interest. This paper addresses a new problem by extending the closed string problem to the -closed string problem, for which a level of approximation is permitted up to a number of Hamming distance errors, set by the parameter .
We address the problem of deciding whether or not a given string of length over an integer alphabet is -closed and additionally specifying the border resulting in the string being -closed. Specifically, we present an -time and -space algorithm to achieve this along with the pseudocode of an implementation and proof-of-concept experimental results.