A parameterized string (p-string) is a string over an alphabet (Σ_s∪Σ_p)...
Palindrome pattern matching (pal-matching) problem is a generalized patt...
Let S_T(k) denote the set of distinct substrings of length k in a
string...
In this study, we propose a simple and effective preprocessing method fo...
We present an algorithm computing the longest periodic subsequence of a
...
Given a string T with length n whose characters are drawn from an ordere...
In this paper, we propose a secure multiparty protocol for the feature
s...
We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional
sc...
We propose a B tree representation storing n keys, each of k bits, in
ei...
Computing the matching statistics of patterns with respect to a text is ...
Shape grammars are well known in the graphics and design communities but...
Re-Pair is a grammar compression scheme with favorably good compression
...
Data compression is a powerful tool for managing massive but repetitive
...
Given a string T of length N, the goal of grammar compression is to
cons...
We propose a new generalization of palindromes and gapped palindromes ca...