Related papers: Sensitivity of Repetitiveness Measures to String R…
Recently, it was demonstrated that one-loop energy shifts of spinning superstrings on AdS5xS5 agree with certain Bethe equations for quantum strings at small effective coupling. However, the string result required artificial regularization…
Indexing very large collections of strings, such as those produced by the widespread next generation sequencing technologies, heavily relies on multistring generalization of the Burrows-Wheeler Transform (BWT): large requirements of…
Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic time warping. These measures can be computed by simple…
The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several area in science and…
This work proves new results on the ability of binary Reed-Muller codes to decode from random errors and erasures. We obtain these results by proving improved bounds on the weight distribution of Reed-Muller codes of high degrees.…
A long-standing problem in string phenomenology has been the fact that the string unification scale disagrees with the GUT scale obtained by extrapolating low-energy data within the framework of the minimal supersymmetric standard model…
While the inverse probability of treatment weighting (IPTW) is a commonly used approach for treatment comparisons in observational data, the resulting estimates may be subject to bias and excessively large variance when there is lack of…
We prove that all open string theory disc amplitudes in a flat background obey Britto-Cachazo-Feng-Witten (BCFW) on-shell recursion relations, up to a possible reality condition on a kinematic invariant. Arguments that the same holds for…
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
The Burrows-Wheeler Transform (BWT) is an efficient invertible text transformation algorithm with the properties of tending to group identical characters together in a run, and enabling search of the text. This transformation has extensive…
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT (BBWT) is a bijective variant of it. Although it is known that the BWT can be constructed in…
Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a fundamental data structure on strings with applications in text pattern searching, data compression, and pattern discovery. Intuitively, the CDAWG of a string $T$ is…
The minimizers sampling mechanism is a popular mechanism for string sampling introduced independently by Schleimer et al. [SIGMOD 2003] and by Roberts et al. [Bioinf. 2004]. Given two positive integers $w$ and $k$, it selects the…
A degenerate or indeterminate string on an alphabet $\Sigma$ is a sequence of non-empty subsets of $\Sigma$. Given a degenerate string $t$ of length $n$, we present a new method based on the Burrows--Wheeler transform for searching for a…
One-string-loop (torus topology) corrections to black-string backgrounds corresponding to gauged ${SL(2,R)\times R}/R$ WZW model are calculated using $\beta$-function equations derived from string-loop-corrected effective action.…
We show tight bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is…
It has been known for some time that the SL(2,R) WZWN model reduces to Liouville theory. Here we give a direct and physical derivation of this result based on the classical string equations of motion and the proper string size. This allows…
We performed a detailed analysis of the process $e^+e^-\to \ell \nu q\bar{q}'$ to determine its sensitivity to anomalous trilinear gauge boson couplings of the $WW\gamma$ and $WWZ$ vertices and how the sensitivity varies with energy and…
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-time algorithms for several classical problems on strings,…
Effective theories with the matter content of the minimal supersymmetric Standard Model below the string scale M_string predict a wrong value for the weak--mixing angle sin^2\theta_W and strong coupling constant \alpha_S at the scale M_Z.…