Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended 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.

[1]  Michael K. Gilson,et al.  ASAP, a systematic annotation package for community analysis of genomes , 2003, Nucleic Acids Res..

[2]  Dany Breslauer,et al.  An On-Line String Superprimitivity Test , 1992, Inf. Process. Lett..

[3]  Ayumi Shinohara,et al.  Inferring Strings from Graphs and Arrays , 2003, MFCS.

[4]  Maxime Crochemore,et al.  Cover Array String Reconstruction , 2010, CPM.

[5]  Yin Li,et al.  Computing the Cover Array in Linear Time , 2001, Algorithmica.

[6]  Shu Wang,et al.  New Perspectives on the Prefix Array , 2008, SPIRE.

[7]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[8]  Hideo Bannai,et al.  Verifying a Parameterized Border Array in O(n1.5) Time , 2010, CPM.

[9]  Maxime Crochemore,et al.  Reverse Engineering Prefix Tables , 2009, STACS.

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[11]  Andrzej Ehrenfeucht,et al.  Efficient Detection of Quasiperiodicities in Strings , 1993, Theor. Comput. Sci..

[12]  Hideo Bannai,et al.  Verifying a Parameterized Border Array in O ( n 1 . 5 ) , 2010 .

[13]  Hideo Bannai,et al.  Counting Parameterized Border Arrays for a Binary Alphabet , 2009, LATA.

[14]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[15]  Mohammad Sohel Rahman,et al.  Indeterminate string inference algorithms , 2012, J. Discrete Algorithms.

[16]  W. F. Smyth,et al.  Verifying a border array in linear time , 1999 .

[17]  Alberto Apostolico,et al.  Of Periods, Quasiperiods, Repetitions and Covers , 1997, Structures in Logic and Computer Science.

[18]  Arnaud Lefebvre,et al.  Border Array on Bounded Alphabet , 2002, Stringology.