Related papers: Generalization of Repetitiveness Measures for Two-…
Approximate pattern matching is a natural and well-studied problem on strings: Given a text $T$, a pattern $P$, and a threshold $k$, find (the starting positions of) all substrings of $T$ that are at distance at most $k$ from $P$. We…
The past decade has witnessed substantial developments in string solving. Motivated by the complexity of string solving strategies adopted in existing string solvers, we investigate a simple and generic method for solving string…
Relative compression, where a set of similar strings are compressed with respect to a reference string, is a very effective method of compressing DNA datasets containing multiple similar sequences. Relative compression is fast to perform…
Topological Data Analysis (TDA) provides a toolkit for the study of the shape of high dimensional and complex data. While operating on a space of persistence diagrams is cumbersome, persistence norms provide a simple real value measure of…
Four-dimensional compactifications of string theory provide a controlled set of possible gauge representations accounting for BSM particles and dark sector components. In this review, constraints from perturbative Type II string…
We review some of the recent progress in the continuum formulation of two-dimensional string theory, i.e. two-dimensional quantum gravity coupled to $c=1$ matter. Special attention is devoted to the discrete states and to the $w_\infty$…
I consider a three-dimensional string theory whose action, besides the standard area term, contains one of the form $\int_{\Sigma} \epsilon_{\mu\nu\sigma} X^{\mu} d X^{\nu} \wedge d X^{\sigma}$. In the case of closed strings this extra term…
We show that $4$-dimensional Robertson-Walker spacetimes can be constructed for which all of the beta functions vanish to leading order, yielding consistent string theory without extra dimensions. We find that there is a unique static…
In six spacetime dimensions, the heterotic string is dual to a Type $IIA$ string. On further toroidal compactification to four spacetime dimensions, the heterotic string acquires an $SL(2,\BbbZ)_S$ strong/weak coupling duality and an…
The Ward identities of the $W_{\infty}$ symmetry in 2D string theory in the tachyon background are studied in the continuum approach. Comparing the solutions with the matrix model results, it is verified that 2D string amplitudes are…
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other…
Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct application in relative compression algorithms for genome and…
The normalized substring complexity $\delta$ of a string is defined as $\max_k \{c[k]/k\}$, where $c[k]$ is the number of \textit{distinct} substrings of length $k$. This simply defined measure has recently attracted attention due to its…
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…
We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…
We propose `Dracula', a new framework for unsupervised feature selection from sequential data such as text. Dracula learns a dictionary of $n$-grams that efficiently compresses a given corpus and recursively compresses its own dictionary;…
Using a world-sheet covariant formalism, we derive the equations of motion for second order perturbations of a generic macroscopic string, thus generalizing previous results for first order perturbations. We give the explicit results for…
The notion of signal sparsity has been gaining increasing interest in information theory and signal processing communities. As a consequence, a plethora of sparsity metrics has been presented in the literature. The appropriateness of these…
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort has been put into…
The replicability crisis is a major issue across nearly all areas of empirical science, calling for the formal study of replicability in statistics. Motivated in this context, [Impagliazzo, Lei, Pitassi, and Sorrell STOC 2022] introduced…