Related papers: String Covering: A Survey
In this paper we make further refinements to the duality proposed between N=1 SQCD and certain string (supergravity plus branes) backgrounds, working in the regime of comparable large number of colors and flavors. Using the string theory…
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…
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text $T$, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in $T$…
Strings are ubiquitous in code. Not all strings are created equal, some contain structure that makes them incompatible with other strings. CSS units are an obvious example. Worse, type checkers cannot see this structure: this is the latent…
We give a short review of a large class of warped string geometries, obtained via F-theory compactified on Calabi-Yau fourfolds, that upon reduction to 5 dimensions give consistent supersymmetric realizations of the RS compactification…
A seed in a word is a relaxed version of a period in which the occurrences of the repeating subword may overlap. We show a linear-time algorithm computing a linear-size representation of all the seeds of a word (the number of seeds might be…
We consider the problem of finding quasiperiodicities in a Fibonacci string. A factor u of a string y is a cover of y if every letter of y falls within some occurrence of u in y. A string v is a seed of y, if it is a cover of a superstring…
In recent years, there has been an exponential growth in the number of complex documents and texts that require a deeper understanding of machine learning methods to be able to accurately classify texts in many applications. Many machine…
There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pages remains, in most cases, a long-term objective, tasks such…
This article is devoted to an overview of superstring perturbation theory from the point of view of super Riemann surfaces. We aim to elucidate some of the subtleties of superstring perturbation that caused difficulty in the early…
Spaced seeds are important tools for similarity search in bioinformatics, and using several seeds together often significantly improves their performance. With existing approaches, however, for each seed we keep a separate linear-size data…
A superstring of a set of strings correspond to a string which contains all the other strings as substrings. The problem of finding the Shortest Linear Superstring is a well-know and well-studied problem in stringology. We present here a…
The physical motivations and the basic construction rules for Type I strings and M-theory compactifications are reviewed in light of the recent developments. The first part contains the basic theoretical ingredients needed for building…
We review recent work in which compactifications of string and M theory are constructed in which all scalar fields (moduli) are massive, and supersymmetry is broken with a small positive cosmological constant, features needed to reproduce…
This review summarizes the recent developments in topological string theory from the author's perspective, mostly focused on aspects of research in which the author is involved. After a brief overview of the theory, we discuss two aspects…
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…
This note is intended to serve as a reference for conventions used in the literature on string compactifications, and how to move between them, collected in a single and easy-to-find place, using type IIB as an illustrative example. We hope…
Natural language processing methods have been applied in a variety of music studies, drawing the connection between music and language. In this paper, we expand those approaches by investigating \textit{chord embeddings}, which we apply in…
Calculating leaf area is very important. Computer aided image processing can make this faster and more accurate. This include scanning the leaf , converting it to binary image and calculation of number of pixels covered. Later this is…
We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending…