Indeterminate string inference algorithms

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Nazeen, S., Rahman, M. S., & Reaz, R. (2012). Indeterminate string inference algorithms. Journal of Discrete Algorithms, 10(1), 23–34. https://doi.org/10.1016/j.jda.2011.08.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free