## Abstract

There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithm for two dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in O(n^{2} log m) with O(m^{2} log m) preprocessing. We show an algorithm for two dimensional matching with an O(n^{2}) text scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear time string matching algorithm.

Original language | English |
---|---|

Title of host publication | Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |

Publisher | Association for Computing Machinery |

Pages | 59-68 |

Number of pages | 10 |

ISBN (Electronic) | 0897915119 |

DOIs | |

State | Published - 1 Jul 1992 |

Externally published | Yes |

Event | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

Volume | Part F129722 |

ISSN (Print) | 0737-8017 |

### Conference

Conference | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
---|---|

Country/Territory | Canada |

City | Victoria |

Period | 4/05/92 → 6/05/92 |

### Bibliographical note

Publisher Copyright:© 1992 ACM.