## Abstract

We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are singled out. A "match" is a text location where a specified relation between the text and pattern areas is satisfied. In particular we define the structural matching problem of overlap (parity) matching. We seek the text locations where all overlaps of the given pattern and text intervals have even length. We show that this problem can be solved in time O(n log m), where the text length is n and the pattern length is m. As an application of overlap matching, we show how to reduce the string matching with swaps problem to the overlap matching problem. The string matching with swaps problem is the problem of string matching in the presence of local swaps. The best deterministic upper bound known for this problem was O(nm^{1/3} log m log σ) for a general alphabet Σ, where σ = min(m, |Z|). Our reduction provides a solution to the pattern matching with swaps problem in time O(n log m log σ).

Original language | English (US) |
---|---|

Pages (from-to) | 57-74 |

Number of pages | 18 |

Journal | Information and Computation |

Volume | 181 |

Issue number | 1 |

DOIs | |

State | Published - Feb 25 2003 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics