Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet
Data Structures and Algorithms
2011-08-30 v1 Discrete Mathematics
Abstract
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 over a two-letter alphabet whenever a valid cover array 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.
Cite
@article{arxiv.1108.5422,
title = {Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet},
author = {Tanaeem M. Moosa and Sumaiya Nazeen and M. Sohel Rahman and Rezwana Reaz},
journal= {arXiv preprint arXiv:1108.5422},
year = {2011}
}