An adaptive hybrid pattern-matching algorithm on indeterminate strings

DOI10.1142/S0129054109007005MaRDI QIDQ3655532zbMATH OpenOpenAlexFDO

Authors 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

adaptivehybridindeterminate strings

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Fast pattern-matching on indeterminate strings
• Combinatorial Pattern Matching
• A simple fast hybrid pattern-matching algorithm
• An aggressive algorithm for multiple string matching
• scientific article; zbMATH DE number 1982175

Cites work

• A fast string searching algorithm
• A universal compiler system based on production rules
• Fast Pattern Matching in Strings
• Fast pattern-matching on indeterminate strings
• Generalized String Matching
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)

Cited in

(11)

• Constructing an indeterminate string from its associated graph
• A new approach to regular \& indeterminate strings
• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• Indexing a sequence for mapping reads with a single mismatch
• Computing covers using prefix tables
• Indeterminate string inference algorithms
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• Adaptive Pattern Matching
• Indeterminate strings, prefix arrays \& undirected graphs
• Practical KMP/BM style pattern-matching on indeterminate strings
• Fast pattern-matching on indeterminate strings

This page was built for publication: An adaptive hybrid pattern-matching algorithm on indeterminate strings

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