Indeterminate string inference algorithms

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 eff...

Full description

Saved in:
Bibliographic Details
Published inJournal of discrete algorithms (Amsterdam, Netherlands) Vol. 10; pp. 23 - 34
Main Authors Nazeen, Sumaiya, Rahman, M. Sohel, Reaz, Rezwana
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2012
Subjects
Border array
Indeterminate string inference
LCP array
Suffix array
LCP array
Suffix array
Indeterminate string inference
Border array
Online AccessGet full text
ISSN1570-8667
1570-8675
DOI10.1016/j.jda.2011.08.002

Cover

More Information
Summary: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 ( n 2 ) algorithm for reconstructing an indeterminate string from suffix array and LCP array.
ISSN:1570-8667
1570-8675
DOI:10.1016/j.jda.2011.08.002