Related papers: Generalization of Repetitiveness Measures for Two-…
A $\lambda$-cover of a string $S$ is a set of strings $\{C_i\}_1^\lambda$ such that every index in $S$ is contained in an occurrence of at least one string $C_i$. The existence of a $1$-cover defines a well-known class of quasi-periodic…
The actions of the ``$R=T$'' and string-inspired theories of gravity in (1+1) dimensions are generalized into one single action which is characterized by two functions. We discuss differing interpretations of the matter stress-energy…
The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string $w$ into another string $\mathsf{BWT}(w)$. The size of the run-length encoded BWT (RLBWT) can be interpreted as a measure of repetitiveness in the class of…
We propose a twistor--like formulation of N=1, D=3,4,6 and 10 null superstrings. The model possesses N=1 target space supersymmetry and n=D-2 local worldsheet supersymmetry, the latter replaces the kappa-symmetry of the conventional…
We propose string compressibility as a descriptor of temporal structure in audio, for the purpose of determining musical similarity. Our descriptors are based on computing track-wise compression rates of quantised audio features, using…
A string theory in $3$ euclidean spacetime dimensions is found to describe the semiclassical behavior of a certain exact physical state of quantum general relativity in $4$ dimensions. Both the worldsheet and the three dimensional metric…
We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically, the new model refers to testing properties of distributions, but these are…
The random access problem for compressed strings is to build a data structure that efficiently supports accessing the character in position $i$ of a string given in compressed form. Given a grammar of size $n$ compressing a string of size…
We reformulate the compatibility condition between a generalized metric and a small (non-maximal rank) Dirac structure in an exact Courant algebroid found in the context of the gauging of strings and formulated by means of two connections…
String theory in d dimensions has n+1=11-d parameters that may be thought of as being inherited from the geometry of an n+1 torus which may be used to construct the theory using dimensional reduction from eleven dimensions. We give the…
Given a string $S$ of length $N$ on a fixed alphabet of $\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$. In this paper we describe data structures to support the…
A robust summarization system should be able to capture the gist of the document, regardless of the specific word choices or noise in the input. In this work, we first explore the summarization models' robustness against perturbations…
The target space theory of the N=(2,1) heterotic string may be interpreted as a theory of gravity coupled to matter in either $1+1$ or $2+1$ dimensions. Among the target space theories in $1+1$ dimensions are the bosonic, type II, and…
The well known N=2 string theory describes self-dual gravity, as was shown by Ooguri and Vafa sometime ago. In search of a variant of this theory which would describe self-dual supergravity in 2+2 dimensions, we have constructed two new N=2…
Symmetry transformations of the space-time fields of string theory are generated by certain similarity transformations of the stress-tensor of the associated conformal field theories. This observation is complicated by the fact that, as we…
Given the vast reservoirs of data stored worldwide, efficient mining of data from a large information store has emerged as a great challenge. Many databases like that of intrusion detection systems, web-click records, player statistics,…
Dynamic Time Warping (DTW) is a widely used similarity measure for comparing strings that encode time series data, with applications to areas including bioinformatics, signature verification, and speech recognition. The standard…
String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting (XSS). A popular string analysis technique includes symbolic…
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between…
The notions of periodicity and repetitions in strings, and hence these of runs and squares, naturally extend to two-dimensional strings. We consider two types of repetitions in 2D-strings: 2D-runs and quartics (quartics are a 2D-version of…