DeepAI AI Chat
Log In Sign Up

String Covering: A Survey

by   Neerja Mhaskar, et al.

The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one potential compaction methodology, the cover of a given string x, initially proposed in a simple form in 1990, but increasingly of interest as more sophisticated variants have been discovered. We then consider covering by a seed; that is, a cover of a superstring of x. We conclude with many proposals for research directions that could make significant contributions to string processing in future.


page 1

page 2

page 3

page 4


A Survey on String Constraint Solving

String constraint solving refers to solving combinatorial problems invol...

A New Approach to Regular Indeterminate Strings

In this paper we propose a new, more appropriate definition of regular a...

Longest Property-Preserved Common Factor

In this paper we introduce a new family of string processing problems. W...

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

We characterize those strings whose suffix arrays are based on arithmeti...

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...

Cosmic String Detection with Tree-Based Machine Learning

We explore the use of random forest and gradient boosting, two powerful ...