Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed… 
Review
2012
Review
2012
Graph pattern matching is fundamental to social network analysis. Traditional techniques are subgraph isomorphism and graph… 
Highly Cited
2011
Highly Cited
2011
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity… 
Review
2006
Review
2006
  • P. Christen
  • 2006
  • Corpus ID: 8957482
Finding and matching personal names is at the core of an increasing number of applications: from text and Web mining, search… 
Review
2006
Review
2006
As the counterfactual model of causality has increased in popularity, sociologists have returned to matching as a research… 
Highly Cited
2006
Highly Cited
2006
We present and evaluate an architecture for high-throughput pattern matching of regular expressions. Our approach matches… 
Highly Cited
2004
Highly Cited
2004
In today's Internet, worms and viruses cause service disruptions with enormous economic impact. Current attack prevention… 
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… 
Highly Cited
1997
Highly Cited
1997
A myriad of textual problems have been considered in the pattern matching field with many non-trivial results. Nevertheless… 
Highly Cited
1990
Highly Cited
1990