English
Related papers

Related papers: String Covering: A Survey

200 papers

The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or…

Data Structures and Algorithms · Computer Science 2009-12-07 Mugurel Ionut Andreica , Nicolae Tapus

This article surveys some of the highlights in the development of string theory through the first superstring revolution in 1984. The emphasis is on topics in which the author was involved, especially the observation that critical string…

High Energy Physics - Theory · Physics 2009-04-03 John H. Schwarz

Since scientific investigation is one of the most important providers of massive amounts of ordered data, there is a renewed interest in array data processing in the context of Big Data. To the best of our knowledge, a unified resource that…

Databases · Computer Science 2013-02-20 Florin Rusu , Yu Cheng

String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…

High Energy Physics - Theory · Physics 2008-11-26 John H. Schwarz , Nathan Seiberg

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…

Logic in Computer Science · Computer Science 2020-11-02 Lukas Holik , Petr Janku , Anthony W. Lin , Philipp Rümmer , Tomas Vojnar

A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…

Combinatorics · Mathematics 2016-11-15 Bálint Vásárhelyi

We generalize to the case of compactified superstrings a construction given previously for critical superstrings of finite one loop amplitudes that are well-defined for all external momenta. The novel issues that arise for compactified…

High Energy Physics - Theory · Physics 2009-10-30 Gordon Chalmers

The exponential growth of textual data presents substantial challenges in management and analysis, notably due to high storage and processing costs. Text classification, a vital aspect of text mining, provides robust solutions by enabling…

Computation and Language · Computer Science 2025-01-22 Kamal Taha , Paul D. Yoo , Chan Yeun , Aya Taha

Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study…

Data Structures and Algorithms · Computer Science 2015-01-27 Atalay Mert İleri , M. Oğuzhan Külekci , Bojian Xu

String theory contains sources like orientifold planes that support higher derivative interactions. These interactions make possible static flux compactifications which are forbidden in supergravity. They can also lead to violations of the…

High Energy Physics - Theory · Physics 2014-12-19 Stephen R. Green , Emil J. Martinec , Callum Quigley , Savdeep Sethi

In this short review, we outline three sets of developments in understanding heterotic string compactifications. First, we outline recent progress in heterotic analogues of quantum cohomology computations. Second, we discuss a potential…

High Energy Physics - Theory · Physics 2016-08-29 Eric Sharpe

Motivated by the recent interest in the different aspects of the string/field theory duality, we describe an approach for obtaining exact string solutions in general backgrounds, based on two types of string embedding, allowing for…

High Energy Physics - Theory · Physics 2007-05-23 P. Bozhilov

We give an overview of the status of string cosmology. We explain the motivation for the subject, outline the main problems, and assess some of the proposed solutions. Our focus is on those aspects of cosmology that benefit from the…

High Energy Physics - Theory · Physics 2008-11-26 Liam McAllister , Eva Silverstein

String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of…

Combinatorics · Mathematics 2014-08-10 Jiří Matoušek

There are at present two known string theories in $(2,2)$ dimensions. One of them is the well known $N=2$ string, and the other one is a more recently constructed $N=1$ spacetime supersymmetric string. They are both based on certain…

High Energy Physics - Theory · Physics 2010-04-06 H. Lu , C. N. Pope , E. Sezgin

String theory has been the dominating research field in theoretical physics during the last decades. Despite the considerable time elapse, no new testable predictions have been derived by string theorists and it is understandable that…

History and Philosophy of Physics · Physics 2011-10-12 Lars-Göran Johansson , Keizo Matsubara

In this work we provide a self-contained and modern introduction to some of the tools, obstacles and open questions arising in string compactifications. Techniques and current progress are illustrated in the context of smooth heterotic…

High Energy Physics - Theory · Physics 2018-04-25 Lara B. Anderson , Mohsen Karkheiran

String theory is the prime candidate for the theory of everything. However, it must be defined in ten dimensions to be consistent. To get 4D physics, the 6 other dimensions should be curled up in a small compact manifold, this procedure is…

High Energy Physics - Theory · Physics 2022-11-02 Poula Tadros , Iiro Vilja

String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust string barcoding. Our methods enable distinguisher…

Data Structures and Algorithms · Computer Science 2016-08-31 Bhaskar DasGupta , Kishori M. Konwar , Ion I. Mandoiu , Alex A. Shvartsman

We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from longest-common-prefix…

Data Structures and Algorithms · Computer Science 2019-11-20 Nieves R. Brisaboa , Ana Cerdeira-Pena , Guillermo de Bernardo , Gonzalo Navarro