Automatic spelling correction has been receiving sustained research attention. Although
each article contains a brief introduction to the topic, there is a lack of work that would …

In low-depth circuit complexity, the polynomial method is a way to prove lower bounds by
translating weak circuits into low-degree polynomials, then analyzing properties of these …

We study quantum algorithms for several fundamental string problems, including Longest
Common Substring, Lexicographically Minimal String Rotation, and Longest Square …

The selfdestruct function is provided by Ethereum smart contracts to destroy a contract on
the blockchain system. However, it is a double-edged sword for developers. On the one …

Given two strings S and T, each of length at most n, the longest common substring (LCS)
problem is to find a longest substring common to S and T. This is a classical problem in …

In the classic longest common substring (LCS) problem, we are given two strings $ S $ and
$ T $, each of length at most $ n $, over an alphabet of size $\sigma $, and we are asked to …

Alignment-free sequence comparison methods are attracting persistent interest, driven by
data-intensive applications in genome-wide molecular taxonomy and phylogenetic …

Background Alignment-free sequence comparison approaches have been garnering
increasing interest in various data-and compute-intensive applications such as phylogenetic …

It is well known that the longest common factor (LCF) of two strings over an integer alphabet
can be computed in time linear in the total length of the two strings. Our aim here is to …

Alignment-free approaches are gaining persistent interest in many sequence analysis
applications such as phylogenetic inference and metagenomic classification/clustering …