Pattern matching

Known as: Matching, Pattern matching (functional programming), Pattern matches 
In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applications… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In today's Internet, worms and viruses cause service disruptions with enormous economic impact. Current attack prevention… (More)
  • table 1
  • figure 3
  • table 2
  • table 6
  • table 7
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we present a scalable FPGA design methodology for searching network packet payloads for a large number of patterns… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
XML employs a tree-structured data model, and, naturally, XML queries specify patterns of selection predicates on multiple… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Introduction Pattern matching is a very powerful and useful device in programming. In functional languages it emerged in SASL… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
ABSTgACT. Tree pattern matching is an interesting special problem which occurs as a crucial step m a number of programmmg tasks… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 7
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Let .i = P,, . . ., P,. and .2 = Q Q, be two patterns of points . Each pairing (P r, Q,) of a point of :P with a point of .2… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An algorithm is presented which finds all occurrences of one. given string within another, in running time proportional to the… (More)
  • table 3
Is this relevant?