TY - GEN
T1 - Longest common factor after one edit operation
AU - Amir, Amihood
AU - Charalampopoulos, Panagiotis
AU - Iliopoulos, Costas S.
AU - Pissis, Solon P.
AU - Radoszewski, Jakub
N1 - Publisher Copyright: © Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - It is well known that the longest common factor (LCF) of two strings over an integer alphabet can be computed in time linear in the total length of the two strings. Our aim here is to present an algorithm that preprocesses two strings S and T in order to answer the following type of queries: Given a position i on S and a letter α, return an LCF of T and S′, where S′ is the string resulting from S after substituting S[i] with α. In what follows, we present an algorithm that, given two strings of length at most n, constructs in O(n log4 n) expected time a data structure of O(n log3 n) space that answers such queries in O(log3 n) time per query. After some trivial modifications, our approach can also support the case of single letter insertions or deletions in S.
AB - It is well known that the longest common factor (LCF) of two strings over an integer alphabet can be computed in time linear in the total length of the two strings. Our aim here is to present an algorithm that preprocesses two strings S and T in order to answer the following type of queries: Given a position i on S and a letter α, return an LCF of T and S′, where S′ is the string resulting from S after substituting S[i] with α. In what follows, we present an algorithm that, given two strings of length at most n, constructs in O(n log4 n) expected time a data structure of O(n log3 n) space that answers such queries in O(log3 n) time per query. After some trivial modifications, our approach can also support the case of single letter insertions or deletions in S.
KW - Dynamic data structure
KW - Heavy-path decomposition
KW - Longest common factor
KW - Orthogonal range searching
KW - Suffix tree
UR - http://www.scopus.com/inward/record.url?scp=85030165799&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-319-67428-5_2
DO - https://doi.org/10.1007/978-3-319-67428-5_2
M3 - منشور من مؤتمر
SN - 9783319674278
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 14
EP - 26
BT - String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings
A2 - Venturini, Rossano
A2 - Fici, Gabriele
A2 - Sciortino, Marinella
PB - Springer Verlag
T2 - 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017
Y2 - 26 September 2017 through 29 September 2017
ER -