Indeterminate string inference algorithms

Abstract

Regularities in indeterminate 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 an indeterminate string from a border array. We present two efficient algorithms to reconstruct an indeterminate string from a valid border array - one using an unbounded alphabet and the other using minimum sized alphabet. We also propose an O( n2) algorithm for reconstructing an indeterminate string from suffix array and LCP array. © 2011 Elsevier B.V. All rights reserved.