### 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 patterns are singled out, say intervals. 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 &Ogr;(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 known deterministic upper bound for this problem was &Ogr;(nm ^{1/3} log m log &sgr;) for a general alphabet Z, where &sgr; = min(m, |σ|. Our reduction provides a solution to the pattern matching with swaps problem in time &Ogr;(n log m log &sgr;).

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

Title of host publication | Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms |

Pages | 279-288 |

Number of pages | 10 |

State | Published - Dec 1 2001 |

Event | 2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Other

Other | 2001 Operating Section Proceedings, American Gas Association |
---|---|

Country | United States |

City | Dallas, TX |

Period | 4/30/01 → 5/1/01 |

### Keywords

- Algorithms
- Theory
- Verification

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Overlap matching'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 279-288). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).