# Matching Patterns with Variables

## TL;DR

This paper reviews recent advances in efficiently matching variable-containing patterns to words, highlighting polynomial-time solutions for specific pattern classes despite the general NP-completeness.

## Contribution

It provides an overview of recent results and extensions concerning polynomial-time matching algorithms for structured variable patterns.

## Key findings

- Efficient matching algorithms exist for certain restricted pattern classes.
- Matching problem is NP-complete in general but tractable in specific cases.
- Extensions of pattern matching broaden applicability to more complex patterns.

## Abstract

A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with restricted structure. In this paper we overview a series of recent results related to efficient matching for patterns with variables, as well as a series of extensions of this problem.