Degenerate String Reconstruction from Cover Arrays.
Dipankar Ranjan Baisya, Mir Md. Faysal, M. Sohel Rahman · 2013
Abstract. Regularities in degenerate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanaly-sis and so on. In this paper, we study the problem of reconstructing a degenerate string from a cover array. We present two efficient algorithms to reconstruct a degenerate string from a valid cover array one using an unbounded alphabet and the other using minimum sized alphabet.