Indeterminate string inference algorithms

DOI10.1016/J.JDA.2011.08.002MaRDI QIDQ414420zbMATH OpenOpenAlexFDO

Authors Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz

Publication date 11 May 2012

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2011.08.002

zbMATH Keywords

border arrayindeterminate string inferenceLCP arraysuffix array

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Inferring an indeterminate string from a prefix graph
• Fast pattern-matching on indeterminate strings
• Indeterminate strings, prefix arrays \& undirected graphs
• Computing covers using prefix tables
• Inferring strings from cover arrays

Cites work

• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• An adaptive hybrid pattern-matching algorithm on indeterminate strings
• Border array on bounded alphabet
• Counting Parameterized Border Arrays for a Binary Alphabet
• Cover array string reconstruction
• Fast pattern-matching on indeterminate strings
• Generalized String Matching
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1305413 (Why is no real title available?)
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• scientific article; zbMATH DE number 1874382 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Partial words and a theorem of Fine and Wilf revisited
• The Constrained Longest Common Subsequence Problem for Degenerate Strings
• Tree Pattern Matching to Subset Matching in Linear Time
• Verifying a parameterized border array in \(O(n ^{1.5})\) time
• Words over an ordered alphabet and suffix permutations

Cited in

(8)

• Constructing an indeterminate string from its associated graph
• A new approach to regular \& indeterminate strings
• Inferring an indeterminate string from a prefix graph
• Indeterminate string factorizations and degenerate text transformations
• Inferring strings from cover arrays
• Computing covers using prefix tables
• Intelligent Processing of an Unrestricted Text in First Order String Calculus
• Fast pattern-matching on indeterminate strings

This page was built for publication: Indeterminate string inference algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414420)