Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

K-M-P string matching revisited

From MaRDI portal
Publication:293129
Jump to:navigation, search

DOI10.1016/S0020-0190(97)00173-7zbMath1339.68338MaRDI QIDQ293129

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 algorithmsstring matchingpattern matchingmemoizationproof of correctness


Mathematics Subject Classification ID

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


Related Items (3)

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




Cites Work

  • On the computational power of pushdown automata
  • Fast Pattern Matching in Strings
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:293129&oldid=12176099"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki