AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS

DOI10.1142/S0129054109007005zbMath1187.68186OpenAlexW2053288014MaRDI QIDQ3655532

W. F. Smyth, Shu Wang

Publication date: 8 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109007005

zbMATH Keywords

hybridadaptiveindeterminate strings

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (10)

Computing covers using prefix tables ⋮ Covering problems for partial words and for indeterminate strings ⋮ Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ Indeterminate string inference algorithms ⋮ Constructing an indeterminate string from its associated graph ⋮ A new approach to regular \& indeterminate strings ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences ⋮ Efficient pattern matching in elastic-degenerate strings

Cites Work

• Unnamed Item
• Fast pattern-matching on indeterminate strings
• A fast string searching algorithm
• Generalized String Matching
• Fast Pattern Matching in Strings
• A universal compiler system based on production rules

This page was built for publication: AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS