Parallel Approximate String Matching
Parallel Approximate String Matching is a computational method within the field of parallel searching that identifies inexact matches of a pattern within a text by leveraging concurrent processing to accelerate the evaluation of potential alignments under defined similarity metrics.
18
Publications
789
Citations
35
Authors
21
Institutions
Publications per year
2017–2026
2
Parents
18
Fast parallel and serial approximate string matching
Gad M. Landau, Uzi Vishkin · Journal of Algorithms · 1989 · 333 citations
1–5 of 18
35
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 35
21

Tampere University
Tampere, Finland
3 h-index
3 publications
71 citations
University of Chile
Santiago, Chile
2 h-index
2 publications
58 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
910 citations
University of South Florida
Tampa, United States
2 h-index
4 publications
92 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
3 publications
788 citations

University of Eastern Finland
Joensuu, Finland
2 h-index
2 publications
44 citations

Hiroshima University
Hiroshima, Japan
2 h-index
4 publications
77 citations

University of Science and Technology Beijing
Beijing, China
1 h-index
2 publications
52 citations
1–8 of 21
1 publications · 16 citations
1
h-index
JEA · 1 publications · 32 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 29 citations
1
h-index
1–5