We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self similar. This occurs naturally on strings over large alphabets. Our algorithm relies on new results for data structures that support dynamic longest increasing sub-sequences. In the process we also obtain improved algorithms for the decremental string comparison problem.
@article{arxiv.2006.14029,
title = {Small Longest Tandem Scattered Subsequences},
author = {Luís M. S. Russo and Alexandre P. Francisco},
journal= {arXiv preprint arXiv:2006.14029},
year = {2020}
}
Comments
The work reported in this article was supported by national funds through Funda\c{c}\~ao para a Ci\^encia e Tecnologia (FCT) with reference UIDB/50021/2020 and through project NGPHYLO PTDC/CCI-BIO/29676/2017. Funded in part by European Union's Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie Actions grant agreement No 690941