Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet

Details Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet

2011-08-27

arxiv.org/abs/1108.5422v1

Computer Science

Data Structures and Algorithms

Scientific paper

Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of strings from cover arrays using the least sized alphabet possible. We present an algorithm that can reconstruct a string $x$ over a two-letter alphabet whenever a valid cover array $C$ is given as an input. This algorithm uses several interesting combinatorial properties of cover arrays and an interesting relation between border array and cover array to achieve this. Our algorithm runs in linear time.

Affiliated with

Also associated with

No associations

Rating

Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-613912