Parallel Pattern Matching is a computational method that belongs to the class of parallel algorithms, specifically designed to simultaneously compare multiple segments of a text against a pattern by distributing the matching process across concurrent processing units to enhance search efficiency.
107
Publications
3.5K
Citations
307
Authors
145
Institutions
Publications per year
2017–2026
16
Parents
Publications
107
GenieHD: Efficient DNA Pattern Matching Accelerator Using Hyperdimensional Computing
Yeseong Kim, Mohsen Imani, Niema Moshiri et al. · 2020 · 98 citations
1–5 of 107
Authors
307
- ZG
5
h-index
- MI
4
h-index
- SMS. Muthukrishnan
Rutgers, The State University of New Jersey, United States
4 publications · 128 citations
4
h-index
- PW
3
h-index
- AA
3
h-index
1–5 of 307
Institutions
145
Zhejiang University
Hangzhou, China
4 h-index
15 publications
412 citations
Yonsei University
Seoul, South Korea
4 h-index
11 publications
217 citations
University of Sheffield
Sheffield, United Kingdom
3 h-index
11 publications
216 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
445 citations
New York University
New York, United States
3 h-index
3 publications
124 citations
University of Florida
Gainesville, United States
3 h-index
4 publications
72 citations
Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
211 citations
National Tsing Hua University
Hsinchu, Taiwan
3 h-index
11 publications
589 citations
1–8 of 145
Venues
- SIAM Journal on Computing
5 publications · 156 citations
5
h-index
- IEEE Transactions on Pattern Analysis and Machine Intelligence
TPAMI · 2 publications · 57 citations
2
h-index
- Applied Optics
2 publications · 29 citations
2
h-index
- Figshare
Repository · 2 publications · 23 citations
2
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 206 citations
2
h-index
1–5