We revisit the classic combinatorial pattern matching problem of finding a longest common
subsequence (LCS). For strings x and y of length n, a textbook algorithm solves LCS in time …

In this paper, we propose a framework that aims at handling metrics among strings defined
over heterogeneous alphabets. Furthermore, we illustrate in detail its application to …

The problem of the set of k-covers is a distance measure for strings. Another well-studied
string comparison measure is that of parameterized matching. We consider the problem of …

Parameterized pattern matching is a string searching variant that was initially defined to
detect duplicate code but later proved to support several other applications. In particular, two …

We study sketching and streaming algorithms for the Longest Common Subsequence
problem (LCS) on strings of small alphabet size $|\Sigma| $. For the problem of deciding …

White Matter fibers play an important role in the working of brain. In order to improve their
analysis, it is important to cluster them in homogeneous bundles. In this activity, the amount …

The longest common parameterized subsequence problem Page 1 Applied Mathematical
Sciences, Vol. 6, 2012, no. 58, 2851 - 2855 The Longest Common Parameterized …

Parameterized matching is a string searching variant in which two equallength strings
parameterized-match if there exists a bijective function g for which every text symbol in one …

This paper proposes a novel approach for monitoring heterogeneous wireless sensor
networks and to identify hidden correlations between sensors. The technique is tested in an …

Park et al.[TCS 2020] observed that the similarity between two (numerical) strings can be
captured by the Cartesian trees: The Cartesian tree of a string is a binary tree recursively …