Related papers: How Much String to String a Cardioid?
This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$. Given…
Assembly planning is a difficult problem for companies. Many disciplines such as design, planning, scheduling, and manufacturing execution need to be carefully engineered and coordinated to create successful product assembly plans. Recent…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
Structural optimization is a useful and interesting tool. Unfortunately, it can be hard for new researchers to get started on the topic because existing tutorials assume the reader has substantial domain knowledge. They obscure the fact…
The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. The purpose of this short paper is to prove…
We introduce string diagrams for physical duoidal categories (normal $\otimes$-symmetric duoidal categories): they consist of string diagrams with wires forming a zigzag-free partial order and order-preserving nodes whose inputs and outputs…
In this work, we investigate a challenging problem, which has been considered to be an important criterion in designing codewords for DNA computing purposes, namely secondary structure avoidance in single-stranded DNA molecules. In short,…
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at…
A run is a maximal occurrence of a repetition $v$ with a period $p$ such that $2p \le |v|$. The maximal number of runs in a string of length $n$ was studied by several authors and it is known to be between $0.944 n$ and $1.029 n$. We…
Encoding data structures store enough information to answer the queries they are meant to support but not enough to recover their underlying datasets. In this paper we give the first encoding data structure for the challenging problem of…
A cyclic codes of length $n$ over the rings $Z_{2^{m}}$ of integer of modulo $2^{m}$ is a linear code with property that if the codeword $(c_0,c_1,...,c_{n-1})\in \mathcal{C}$ then the cyclic shift $(c_1,c_2,...,c_0)\in \mathcal{C}$.…
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous…
A method is given for creating material with a desired refraction coefficient. The method consists of embedding into a material with known refraction coefficient many small particles of size $a$. The number of particles per unit volume…
We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the…
The problem of reconstructing strings from their substring spectra has a long history and in its most simple incarnation asks for determining under which conditions the spectrum uniquely determines the string. We study the problem of coded…
This paper studies the problem of encoding messages into sequences which can be uniquely recovered from some noisy observations about their substrings. The observed reads comprise consecutive substrings with some given minimum overlap. This…
An order-preserving square in a string is a fragment of the form $uv$ where $u\neq v$ and $u$ is order-isomorphic to $v$. We show that a string $w$ of length $n$ over an alphabet of size $\sigma$ contains $\mathcal{O}(\sigma n)$…
String geometry theory is a candidate of the non-perturbative formulation of string theory. In order to determine the string vacuum, we need to clarify how string backgrounds are described in string geometry theory. In this paper, we show…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it.…