@inproceedings{3c2a506ce8604ac3a022387184bda222,

title = "Indexing and dictionary matching with one error (extended abstract)",

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 log2 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 log3 d log log d+ tocc), where n is the text size and d the dictionary size.",

author = "Amihood Amir and Dmitry Keselman and Landau, {Gad M.} and Moshe Lewenstein and Noa Lewenstein and Michael Rodeh",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 6th International Workshop on Algorithms and Data Structures, WADS 1999 ; Conference date: 11-08-1999 Through 14-08-1999",

year = "1999",

doi = "10.1007/3-540-48447-7_19",

language = "אנגלית",

isbn = "3540662790",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "181--192",

editor = "Frank Dehne and Jorg-Rudiger Sack and Arvind Gupta and Roberto Tamassia",

booktitle = "Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings",

address = "גרמניה",

}