K-M-P string matching revisited

DOI10.1016/S0020-0190(97)00173-7zbMATH Open1339.68338MaRDI QIDQ293129FDOQ293129

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

Publication date: 9 June 2016

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

zbMATH Keywords

analysis of algorithmspattern matchingstring matchingmemoizationproof of correctness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the computational power of pushdown automata
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

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

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)