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

Searching for a set of correlated patterns

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

DOI10.1016/j.jda.2006.02.002zbMath1137.68361OpenAlexW1998081684MaRDI QIDQ924555

Shmuel T. Klein, Yair Kaufman, B. Riva Shalom

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.02.002


zbMATH Keywords

NP-completenesspattern matchingoverlapsmultiple patterns


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05)




Cites Work

  • Fast practical multi-pattern matching
  • A fast string searching algorithm
  • On Finding Lowest Common Ancestors: Simplification and Parallelization
  • Efficient string matching
  • Fast Pattern Matching in Strings
  • An Alphabet Independent Approach to Two-Dimensional Pattern Matching
  • Algorithms and Computation
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Searching for a set of correlated patterns

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:924555&oldid=12893818"
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 17:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki