Small Longest Tandem Scattered Subsequences

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 s...

Full description

Bibliographic Details
Main Authors:	Luıs M. S. Russo, Alexandre P. Francisco
Format:	Article
Language:	English
Published:	Alexandru Ioan Cuza University of Iasi 2021-08-01
Series:	Scientific Annals of Computer Science
Subjects:	hunt-szymanski algorithm longest increasing subsequence tandem sub-sequence
Online Access:	https://www.info.uaic.ro/en/sacs_articles/small-longest-tandem-scattered-subsequences/

id	doaj-65cb50c11d4b4bda97394f3f6bd66e58
record_format	Article
spelling	doaj-65cb50c11d4b4bda97394f3f6bd66e582021-08-25T07:14:54ZengAlexandru Ioan Cuza University of IasiScientific Annals of Computer Science1843-81212248-26952021-08-01XXXI17911010.7561/SACS.2021.1.79Small Longest Tandem Scattered SubsequencesLuıs M. S. Russo0https://orcid.org/0000-0002-1966-1808Alexandre P. Francisco1https://orcid.org/0000-0003-4852-1641 INESC-ID and the Department of Computer Science and Engineering, Instituto Superior Tecnico, Universidade de Lisboa INESC-ID and the Department of Computer Science and Engineering, Instituto Superior Tecnico, Universidade de LisboaWe 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, which 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.https://www.info.uaic.ro/en/sacs_articles/small-longest-tandem-scattered-subsequences/hunt-szymanski algorithmlongest increasing subsequencetandemsub-sequence
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Luıs M. S. Russo Alexandre P. Francisco
spellingShingle	Luıs M. S. Russo Alexandre P. Francisco Small Longest Tandem Scattered Subsequences Scientific Annals of Computer Science hunt-szymanski algorithm longest increasing subsequence tandem sub-sequence
author_facet	Luıs M. S. Russo Alexandre P. Francisco
author_sort	Luıs M. S. Russo
title	Small Longest Tandem Scattered Subsequences
title_short	Small Longest Tandem Scattered Subsequences
title_full	Small Longest Tandem Scattered Subsequences
title_fullStr	Small Longest Tandem Scattered Subsequences
title_full_unstemmed	Small Longest Tandem Scattered Subsequences
title_sort	small longest tandem scattered subsequences
publisher	Alexandru Ioan Cuza University of Iasi
series	Scientific Annals of Computer Science
issn	1843-8121 2248-2695
publishDate	2021-08-01
description	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, which 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.
topic	hunt-szymanski algorithm longest increasing subsequence tandem sub-sequence
url	https://www.info.uaic.ro/en/sacs_articles/small-longest-tandem-scattered-subsequences/
work_keys_str_mv	AT luısmsrusso smalllongesttandemscatteredsubsequences AT alexandrepfrancisco smalllongesttandemscatteredsubsequences
_version_	1721196732424912896

Small Longest Tandem Scattered Subsequences

Similar Items