String Covering: A Survey

11/21/2022
by   Neerja Mhaskar, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2020

A Survey on String Constraint Solving

String constraint solving refers to solving combinatorial problems invol...
research
12/14/2020

A New Approach to Regular Indeterminate Strings

In this paper we propose a new, more appropriate definition of regular a...
research
10/04/2018

Longest Property-Preserved Common Factor

In this paper we introduce a new family of string processing problems. W...
research
07/06/2021

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

We characterize those strings whose suffix arrays are based on arithmeti...
research
02/17/2020

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...
research
06/15/2018

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...
research
01/12/2018

Cosmic String Detection with Tree-Based Machine Learning

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

Please sign up or login with your details

Forgot password? Click here to reset