Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
430591 | Journal of Discrete Algorithms | 2012 | 12 Pages |
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)O(n2) algorithm for reconstructing an indeterminate string from suffix array and LCP array.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz,