Related papers: String Covering: A Survey
In these lectures we give a brief introduction to perturbative and non-perturbative string theory. The outline is the following: 1. Introduction to perturbative string theory 1.1 From point particle to extended objects 1.2 Free closed and…
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
In this paper we present a general method for information extraction that exploits the features of data compression techniques. We first define and focus our attention on the so-called "dictionary" of a sequence. Dictionaries are…
Cosmic strings provide a radically different paradigm for the formation of structure to the prevailing inflationary one. They afford some extra technical complications: for example, the calculation of the power spectrum of matter and…
We study the compactification of the pure spinor superstring down to four dimensions. We find that the compactified string is described by a conformal invariant system for both the four dimensional and for the compact six dimensional…
These notes on string theory are based on a series of talks I gave during my graduate studies. As the talks, this introductory essay is intended for young students and non-string theory physicists.
We provide a detailed analysis of the problems and prospects of superstring theory c. 1986, anticipating much of the progress of the decades to follow.
Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…
We address the problem of counting the number of strings in a collection where a given pattern appears, which has applications in information retrieval and data mining. Existing solutions are in a theoretical stage. We implement these…
I review some of the recent progress in two-dimensional string theory, which is formulated as a sum over surfaces embedded in one dimension.
In this master thesis we analyze the complexity of sorting a set of strings. It was shown that the complexity of sorting strings can be naturally expressed in terms of the prefix trie induced by the set of strings. The model of computation…
We review the existence, formation and properties of cosmic strings in string theory, the wide variety of observational techniques that are being employed to detect them, and the constraints that current observations impose on string theory…
We critically assess the twin prospects of describing the observed universe in string theory, and using cosmological experiments to probe string theory. For the purposes of this short review, we focus on the limitations imposed by our…
Type IIB string theory admits a BPS configuration in which three strings (of different type) meet at a point. Using this three string configuration we construct a string network and study its properties. In particular we prove supersymmetry…
Motivated also by recent revival of interest about metastable string states (as cosmic strings or in accelerator physics), we study the decay, in presence of dimensional compactification, of a particular superstring state, which was proven…
Some physicists hope to use string/M-theory to construct a comprehensive underlying theory of our physical world a "final theory". Can such a theory be tested? A quantum theory of gravity must be formulated in 10 dimensions, so obviously…
The amount of text that is generated every day is increasing dramatically. This tremendous volume of mostly unstructured text cannot be simply processed and perceived by computers. Therefore, efficient and effective techniques and…
Clustering is a fundamental machine learning task which has been widely studied in the literature. Classic clustering methods follow the assumption that data are represented as features in a vectorized form through various representation…
This is the written version of a set of introductory lectures on string theory.