Pattern Matching

Pattern Matching is a formal method in computer science that, within the genus of algorithmic problem-solving techniques, specifically identifies occurrences of predefined structural or syntactic forms within data sequences by comparing them against a specified pattern, thereby distinguishing it from general search or parsing methods through its reliance on declarative pattern specifications and recursive decomposition.

2K

Publications

111.6K

Citations

5K

Authors

1.5K

Institutions

Publications per year

2017–2026

344

Authors

5K

  1. AA
    Amihood Amir

    Bar-Ilan University, Israel

    22 publications · 1.2K citations

    19

    h-index

  2. XW
    Xindong Wu

    Hefei University of Technology, China

    15 publications · 324 citations

    13

    h-index

  3. GM
    Gad M. Landau

    University of Haifa, Israel

    14 publications · 473 citations

    13

    h-index

  4. EP
    Ely Porat

    Bar-Ilan University, Israel

    17 publications · 617 citations

    13

    h-index

  5. RB
    Ricardo Baeza‐Yates

    University of Chile, Chile

    12 publications · 1.4K citations

    12

    h-index

1–5 of 5K

Venues

  1. Information Processing Letters

    26 publications · 1.4K citations

    20

    h-index

  2. Theoretical Computer Science

    27 publications · 822 citations

    18

    h-index

  3. SIAM Journal on Computing

    19 publications · 4.3K citations

    17

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 18 publications · 896 citations

    16

    h-index

  5. IEEE Transactions on Pattern Analysis and Machine Intelligence

    TPAMI · 16 publications · 1.4K citations

    15

    h-index

1–5