Linear time inference of strings from cover arrays using a binary alphabet

Authors:
Tanaeem M. Moosa;Sumaiya Nazeen;M. Sohel Rahman;Rezwana Reaz
Affiliations:
AℓEDA Group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA Group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA Group, Department of CSE, BUET, Dhaka, Bangladesh;AℓEDA Group, Department of CSE, BUET, Dhaka, Bangladesh
Venue:
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Year:
2012

Citing 11
Cited 0

An on-line string superprimitivity test

Information Processing Letters
Efficient detection of quasiperiodicities in strings

Theoretical Computer Science
A fast string searching algorithm

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Of Periods, Quasiperiods, Repetitions and Covers

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Border array on bounded alphabet

Journal of Automata, Languages and Combinatorics
New Perspectives on the Prefix Array

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Counting Parameterized Border Arrays for a Binary Alphabet

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Verifying a parameterized border array in O(n1.5) time

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Cover array string reconstruction

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Indeterminate string inference algorithms

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 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.