Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)

DOI10.1007/978-3-642-28076-4_17zbMATH Open1351.68318arXiv1108.5422OpenAlexW1882875837MaRDI QIDQ2889909FDOQ2889909

Authors: Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz 

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1108.5422

Recommendations

• Inferring strings from cover arrays
• Cover array string reconstruction
• Computing the cover array in linear time
• Mathematical Foundations of Computer Science 2003
• Computing covers using prefix tables

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (5)

• Mathematical Foundations of Computer Science 2003
• Universal Reconstruction of a String
• Cover array string reconstruction
• Inferring an indeterminate string from a prefix graph
• Inferring strings from cover arrays

This page was built for publication: Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889909)