The edit distance (ED) and longest common subsequence (LCS) are two fundamental
problems which quantify how similar two strings are to one another. In this paper, we first …

We present an algorithm computing the longest periodic subsequence of a string of length $
n $ in $ O (n^ 7) $ time with $ O (n^ 4) $ words of space. We obtain improvements when …

Given a string T with length n whose characters are drawn from an ordered alphabet of size
σ, its longest Lyndon subsequence is a longest subsequence of T that is a Lyndon word. We …

Given a string T of length n whose characters are drawn from an ordered alphabet of size σ,
its longest Lyndon subsequence is a maximum-length subsequence of T that is a Lyndon …

We present an algorithm computing the longest periodic subsequence of a string of length n
in O (n 7) time with O (n 3) space. We obtain improvements when restricting the exponents …

Given several number sequences, determining the longest common subsequence is a
classical problem in computer science. This problem has applications in bioinformatics …

In recent years, the Bangla language has come out as a very prominent figure in the world of
natural language processing. Many researchers have produced exemplary works on the …

Certain nucleotide sequences in DNA can change their positions. Such nucleotide
sequences might be shorter than a general gene. When we restrict to nucleotide sequences …

Strings are fundamental objects in computer science. Modern applications such as text
processing, bioinformatics, and distributed data storage systems often need to deal with very …

Given a string T with length n whose characters are drawn from an ordered alphabet of size
σ, its longest Lyndon subsequence is a longest subsequence of T that is a Lyndon word. We …