Related papers: String Cadences
In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms…
We study a periodic vibrating string composed of a finite sequence of string segments connected periodically, with each segment characterized by a constant linear mass density. The main purpose is to provide a configuration that can mimic…
We investigate the following problem: given a sample of classified strings, find a first-order sentence of minimal quantifier rank that is consistent with the sample. We represent strings as successor string structures, that is, finite…
We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings…
Frequency of letters in a symbolic sequence ${\bf u}$ over a finite alphabet is one of the basic characteristics of ${\bf u}$. The notion of $k$-balancedness captures the property that the number of any letter occurring in two arbitrary…
Session types, types for structuring communication between endpoints in distributed systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of…
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
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 the distance (i. e., the gap) between two consecutive symbols of…
Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of strings from cover arrays using the least sized alphabet possible.…
We define a coherent adjunction in a strict $3$-category and we use string diagrams to show that any adjunction can be extended to a coherent adjunction in an essentially unique way.
String matching is the problem of finding all the substrings of a text which match a given pattern. It is one of the most investigated problems in computer science, mainly due to its very diverse applications in several fields. Recently,…
Given a string $w$, another string $v$ is said to be a subsequence of $w$ if $v$ can be obtained from $w$ by removing some of its letters; on the other hand, $v$ is called an absent subsequence of $w$ if $v$ is not a subsequence of $w$. The…
The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one…
The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
A chord of a cycle $C$ is an edge joining two non-consecutive vertices of $C$. A cycle $C$ in a graph $G$ is chorded if the vertex set of $C$ induces at least one chord. In this paper, we prove that if $G$ is a graph with order $n\geq 6$…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-related…
We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…