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

Authors

35

  1. HH
    Heikki Hyyrö

    Tampere University, Finland

    3 publications · 71 citations

    3

    h-index

  2. GN
    Gonzalo Navarro

    University of Chile, Chile

    2 publications · 58 citations

    2

    h-index

  3. KN
    Koji Nakano

    Hiroshima University, Japan

    2 publications · 39 citations

    2

    h-index

  4. NR
    N. Ranganathan

    University of South Florida, United States

    2 publications · 46 citations

    2

    h-index

  5. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    2 publications · 455 citations

    2

    h-index

1–5 of 35

Venues

  1. Journal of Computer Science

    1 publications · 16 citations

    1

    h-index

  2. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 32 citations

    1

    h-index

  3. Journal of Discrete Algorithms

    1 publications · 13 citations

    1

    h-index

  4. Procedia Computer Science

    1 publications · 26 citations

    1

    h-index

  5. PLoS ONE

    1 publications · 29 citations

    1

    h-index

1–5