## Abstract

The indexing problem is the one where a text is preprocessed and subsequent queries of the form: “Find all occurrences of pattern P in the text” are answered in time proportional to the length of the query and the number of occurrences. In the dictionary matching problem a set of patterns is preprocessed and subsequent queries of the form: “Find all occurrences of dictionary patterns in text T” are answered in time proportional to the length of the text and the number of occurrences. In this paper we present a uniform deterministic solution to both the indexing and the general dictionary matching problem with one error. We preprocess the data in time O(n log^{2} n), where n is the text size in the indexing problem and the dictionary size in the dictionary matching problem. Our query time for the indexing problem is O(mlog n log log n+ tocc), where m is the query string size and tocc is the number of occurrences. Our query time for the dictionary matching problem is O(n log^{3} d log log d+ tocc), where n is the text size and d the dictionary size.

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

Title of host publication | Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings |

Editors | Frank Dehne, Jorg-Rudiger Sack, Arvind Gupta, Roberto Tamassia |

Publisher | Springer Verlag |

Pages | 181-192 |

Number of pages | 12 |

ISBN (Print) | 3540662790, 9783540662792 |

DOIs | |

State | Published - 1999 |

Event | 6th International Workshop on Algorithms and Data Structures, WADS 1999 - Vancouver, Canada Duration: 11 Aug 1999 → 14 Aug 1999 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1663 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 6th International Workshop on Algorithms and Data Structures, WADS 1999 |
---|---|

Country/Territory | Canada |

City | Vancouver |

Period | 11/08/99 → 14/08/99 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.

## ASJC Scopus subject areas

- Theoretical Computer Science
- General Computer Science