Regular Expression Matching
Regular Expression Matching is a computational method in string algorithms that determines whether a given string conforms to a pattern specified by a regular expression, distinguishing it from other pattern-matching techniques through its foundation in formal language theory and finite automata.
291
Publications
15.7K
Citations
742
Authors
292
Institutions
Publications per year
2017–2026
49
Parents
291
Programming Techniques: Regular expression search algorithm
Thompson Ken · Communications of the ACM · 1968 · 839 citations · Full text
Fast Regular Expression Matching Using FPGAs
Reetinder Sidhu, Viktor K. Prasanna · 2001 · 533 citations
Fast and memory-efficient regular expression matching for deep packet inspection
Yu Fang, Zhifeng Chen, Yanlei Diao et al. · 2006 · 462 citations
NucPred—Predicting nuclear localization of proteins
Markus Brameier, Andrea Krings, Robert M. MacCallum · Bioinformatics · 2007 · 362 citations · Full text
1–5 of 291
742
13
h-index
8
h-index
8
h-index
6
h-index
5
h-index
1–5 of 742
292

Washington University in St. Louis
St Louis, United States
9 h-index
20 publications
2.1K citations
Michigan State University
East Lansing, United States
8 h-index
21 publications
839 citations
Tsinghua University
Beijing, China
7 h-index
24 publications
584 citations
University of Southern California
Los Angeles, United States
6 h-index
13 publications
1.7K citations
University of Wisconsin–Madison
Madison, United States
6 h-index
14 publications
1.1K citations

Chinese Academy of Sciences
Beijing, China
6 h-index
23 publications
578 citations
Brno University of Technology
Brno, Czechia
6 h-index
16 publications
260 citations
Politecnico di Milano
Milan, Italy
6 h-index
18 publications
332 citations
1–8 of 292
PACMPL · 5 publications · 125 citations
5
h-index
5 publications · 339 citations
5
h-index
ENTCS · 4 publications · 148 citations
4
h-index
4 publications · 159 citations
4
h-index
TPDS · 4 publications · 291 citations
4
h-index
1–5