Can We Recover the Cover?

Data analysis typically involves error recovery and detection of regularities as two different key tasks. In this paper we show that there are data types for which these two tasks can be powerfully combined. A common notion of regularity in strings is that of a cover. Data describing measures of a natural coverable phenomenon may be corrupted by errors caused by the measurement process, or by the inexact features of the phenomenon itself. Due to this reason, different variants of approximate covers have been introduced, some of which are $$\mathcal {NP}$$NP-hard to compute. In this paper we assume that the Hamming distance metric measures the amount of corruption experienced, and study the problem of recovering the correct cover from data corrupted by mismatch errors, formally defined as the cover recovery problem (CRP). We show that for the Hamming distance metric, coverability is a powerful property allowing detecting the original cover and correcting the data, under suitable conditions. We also study a relaxation of another problem, which is called the approximate cover problem (ACP). Since the ACP is proved to be $$\mathcal {NP}$$NP-hard (Amir et al. in: Approximate cover of strings. CPM, 2017), we study a relaxation, which we call the candidate-relaxation of the ACP, and show it has a polynomial time complexity. As a result, we get that the ACP also has a polynomial time complexity in many practical situations. An important application of our ACP relaxation study is also a polynomial time algorithm for the CRP.

[1]  Costas S. Iliopoulos,et al.  Enhanced string covering , 2013, Theor. Comput. Sci..

[2]  Costas S. Iliopoulos,et al.  Quasiperiodicity and String Covering , 1999, Theor. Comput. Sci..

[3]  Gad M. Landau,et al.  Period Recovery over the Hamming and Edit Distances , 2016, LATIN.

[4]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[5]  Costas S. Iliopoulos,et al.  Optimal Superprimitivity Testing for Strings , 1991, Inf. Process. Lett..

[6]  Borivoj Melichar,et al.  Searching all approximate covers and their distance using finite automata , 2008, ITAT.

[7]  Amihood Amir,et al.  Approximate periodicity , 2015, Inf. Comput..

[8]  Costas S. Iliopoulos,et al.  Varieties of Regularities in Weighted Sequences , 2010, AAIM.

[9]  Maxime Crochemore,et al.  Algorithms for computing evolutionary chains in molecular and musical sequences , 1998 .

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

[11]  Jeong Seop Sim,et al.  Approximate Seeds of Strings , 2003, Stringology.

[12]  William F. Smyth,et al.  String covering with optimal covers , 2018, J. Discrete Algorithms.

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

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

[15]  William F. Smyth,et al.  An Optimal Algorithm to Compute all the Covers of a String , 1994, Inf. Process. Lett..

[16]  Jeong Seop Sim,et al.  Approximate periods of strings , 2001, Theor. Comput. Sci..

[17]  Gad M. Landau,et al.  An Algorithm for Approximate Tandem Repeats , 2001, J. Comput. Biol..

[18]  Gregory Kucherov,et al.  Finding Approximate Repetitions under Hamming Distance , 2001, ESA.

[19]  Costas S. Iliopoulos,et al.  Covering a String , 1993, CPM.

[20]  Eric Rivals,et al.  A linear time algorithm for Shortest Cyclic Cover of Strings , 2016, J. Discrete Algorithms.

[21]  Rajeev Raman,et al.  String-Matching techniques for musical similarity and melodic recognition , 1998 .

[22]  Costas S. Iliopoulos,et al.  Covering a string , 2005, Algorithmica.

[23]  Wojciech Rytter,et al.  Fast Algorithm for Partial Covers in Words , 2013, CPM.

[24]  Karl R. Abrahamson.  Generalized String Matching , 1987, SIAM J. Comput..

[25]  William F. Smyth,et al.  Repetitive perhaps, but certainly not boring , 2000, Theor. Comput. Sci..

[26]  William F. Smyth,et al.  A Correction to "An Optimal Algorithm to Compute all the Covers of a String" , 1995, Inf. Process. Lett..

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

[28]  Dany Breslauer,et al.  Testing String Superprimitivity in Parallel , 1994, Inf. Process. Lett..

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

[30]  Bořivoj Melichar,et al.  Using Finite Automata Approach for Searching Approximate Seeds of Strings , 2009 .

[31]  Costas S. Iliopoulos,et al.  Algorithms for Computing the lambda-regularities in Strings , 2008, Fundam. Informaticae.

[32]  Ely Porat,et al.  Cycle Detection and Correction , 2010, ICALP.

[33]  Costas S. Iliopoulos,et al.  Algorithms for Computing the λ-regularities in Strings , 2008 .

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

[35]  Gad M. Landau,et al.  Conservative String Covering of Indeterminate Strings , 2008, Stringology.

[36]  Ely Porat,et al.  Approximate Cover of Strings , 2017, CPM.