Indeterminate string inference algorithms

Authors:
Sumaiya Nazeen;M. Sohel Rahman;Rezwana Reaz
Affiliations:
AEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh;AEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh;AEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 12
Cited 1

Generalized string matching

SIAM Journal on Computing
Tree pattern matching and subset matching in deterministic O(n log3 n)-time

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
String regularities with don't cares

Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
STRING-MATCHING AND OTHER PRODUCTS

STRING-MATCHING AND OTHER PRODUCTS
Border array on bounded alphabet

Journal of Automata, Languages and Combinatorics
Fast pattern-matching on indeterminate strings

Journal of Discrete Algorithms
New Perspectives on the Prefix Array

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Counting Parameterized Border Arrays for a Binary Alphabet

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The constrained longest common subsequence problem for degenerate strings

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Verifying a parameterized border array in O(n1.5) time

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Cover array string reconstruction

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Linear time inference of strings from cover arrays using a binary alphabet

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

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(n^2) algorithm for reconstructing an indeterminate string from suffix array and LCP array.