Indeterminate string inference algorithms
From MaRDI portal
Publication:414420
DOI10.1016/J.JDA.2011.08.002zbMath1237.68269OpenAlexW2080253576MaRDI QIDQ414420
M. Sohel Rahman, Sumaiya Nazeen, 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
Related Items (4)
Computing covers using prefix tables ⋮ A new approach to regular \& indeterminate strings ⋮ INFERRING STRINGS FROM COVER ARRAYS ⋮ Inferring an indeterminate string from a prefix graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Fast pattern-matching on indeterminate strings
- The Constrained Longest Common Subsequence Problem for Degenerate Strings
- Verifying a Parameterized Border Array in O(n 1.5) Time
- Cover Array String Reconstruction
- Counting Parameterized Border Arrays for a Binary Alphabet
- AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS
- Generalized String Matching
- Tree Pattern Matching to Subset Matching in Linear Time
- Words over an ordered alphabet and suffix permutations
- Mathematical Foundations of Computer Science 2003
- Partial words and a theorem of Fine and Wilf revisited
This page was built for publication: Indeterminate string inference algorithms