@inproceedings{6ccb73a8249249fe9e4bc427120068e0,
title = "Efficient identification of k-closed strings",
abstract = "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. In this paper, we extend this definition to k-closed strings, for which a level of approximation is permitted up to a number of Hamming distance errors, set by the parameter k. We then address the problem of identifying whether or not a given string of length n over an integer alphabet is k-closed and additionally specifying the border resulting in the string being k-closed. Specifically, we present an O(kn)-time and O(n)-space algorithm to achieve this along with the pseudocode of an implementation.",
author = "Hayam Alamro and Mai Alzamel and Iliopoulos, \{Costas S.\} and Pissis, \{Solon P.\} and Steven Watts and Sung, \{Wing Kin\}",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-65172-9\_49",
language = "English",
isbn = "9783319651712",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "583--595",
editor = "Lazaros Iliadis and Aristidis Likas and Chrisina Jayne and Giacomo Boracchi",
booktitle = "Engineering Applications of Neural Networks - 18th International Conference, EANN 2017, Proceedings",
address = "Germany",
note = "18th International Conference on Engineering Applications of Neural Networks, EANN 2017 ; Conference date: 25-08-2017 Through 27-08-2017",
}