We consider the longest common subsequence problem in the context of subsequences
with gap constraints. In particular, following Day et al. 2022, we consider the setting when …

Matching Patterns with Variables Under Simon’s Congruence | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …

Using arch-jumping functions and properties of the arch factorization of words, we propose a
new algorithm for computing the subword circular universality index of words. We also …

Subsequence-queries with wildcards and gap-size constraints (swg-queries, for short) are
an expressive model for sequence data, in which queries are described by patterns over an …

A subsequence of a word w is a word u such that u= w [i 1] w [i 2],⋯ w [i| u|], for some set of
indices 1≤ i 1< i 2<⋯< ik≤| w|. A word w is k-subsequence universal over an alphabet Σ if …

A query model for sequence data was introduced in [11] in the form of subsequence-queries
with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a …

We study the problem of deciding whether a given language is directed. A language $ L $
is\emph {directed} if every pair of words in $ L $ have a common (scattered) superword in …

For two strings u, v over some alphabet A, we investigate the problem of embedding u into w
as a subsequence under the presence of generalised gap constraints. A generalised gap …

A subsequence of a word $ w $ is a word $ u $ such that $ u= w [i_1] w [i_2]\dots w [i_ {k}] $,
for some set of indices $1\leq i_1< i_2<\dots< i_k\leq\lvert w\rvert $. A word $ w $ is $ k …

This paper is concerned with subsequences that consist of limited numbers of segments. We
call a subsequence\emph {$ f $-segmental} if it is composed of $ f $ factors. More precisely …