Fast average-case pattern matching by multiplexing sparse tables

DOI10.1016/0304-3975(92)90141-2zbMath0747.68025OpenAlexW2095392206MaRDI QIDQ1190461

Russell W. Quong

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90141-2

zbMATH Keywords

pattern recognition\(k\)-mismatches string searchingaverage-case running time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Cites Work

• Fast two-dimensional pattern matching
• A fast string searching algorithm
• Generalized String Matching
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• The Complexity of Pattern Matching for a Random String
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast average-case pattern matching by multiplexing sparse tables