K-M-P string matching revisited

DOI10.1016/S0020-0190(97)00173-7MaRDI QIDQ293129zbMATH OpenFDO

Authors Edward M. Reingold, Kenneth J. Urban, David Gries

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(97)00173-7

zbMATH Keywords

analysis of algorithmsmemoizationpattern matchingproof of correctnessstring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Cites work

• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4033041 (Why is no real title available?)
• scientific article; zbMATH DE number 3787987 (Why is no real title available?)
• scientific article; zbMATH DE number 42967 (Why is no real title available?)
• On the computational power of pushdown automata

Cited in

(4)

• Efficient string matching with k mismatches
• A note on mc-DFA and its minimization
• Tree pattern matching from regular tree expressions.
• A concurrent multi-string matching from multi-text algorithm based on the algorithm of Hamiltonian Path Problem and DNA computation

This page was built for publication: K-M-P string matching revisited

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