Prague Stringology Conference 2013

Dipankar Ranjan Baisya, Mir Md. Faysal and Mohammad Sohel Rahman

Degenerate String Reconstruction from Cover Arrays

Regularities in degenerate strings have recently been a matter of interest because of their use in the fields of molecular biology, musical text analysis, cryptanalysis 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.

Download paper: Article in PostScript Article in PDF BibTeX Reference
 PostScript   PDF   BibTeX reference 
Download presentation: Presentation