Indexing and dictionary matching with one error (extended abstract)

Amihood Amir; Dmitry Keselman; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein; Michael Rodeh

doi:10.1007/3-540-48447-7_19

Indexing and dictionary matching with one error (extended abstract)

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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² 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³ 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	https://doi.org/10.1007/3-540-48447-7_19
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

Access to Document

10.1007/3-540-48447-7_19

Cite this

Amir, A., Keselman, D., Landau, G. M., Lewenstein, M., Lewenstein, N., & Rodeh, M. (1999). Indexing and dictionary matching with one error (extended abstract). In F. Dehne, J.-R. Sack, A. Gupta, & R. Tamassia (Eds.), Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings (pp. 181-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1663). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_19

Amir, Amihood ; Keselman, Dmitry ; Landau, Gad M. et al. / Indexing and dictionary matching with one error (extended abstract). Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Arvind Gupta ; Roberto Tamassia. Springer Verlag, 1999. pp. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{21990f8a86e44fd393c7fd25d59da04d,

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 = "English",

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 = "Germany",

}

Amir, A, Keselman, D, Landau, GM, Lewenstein, M, Lewenstein, N & Rodeh, M 1999, Indexing and dictionary matching with one error (extended abstract). in F Dehne, J-R Sack, A Gupta & R Tamassia (eds), Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1663, Springer Verlag, pp. 181-192, 6th International Workshop on Algorithms and Data Structures, WADS 1999, Vancouver, Canada, 11/08/99. https://doi.org/10.1007/3-540-48447-7_19

Indexing and dictionary matching with one error (extended abstract). / Amir, Amihood; Keselman, Dmitry; Landau, Gad M. et al.
Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Arvind Gupta; Roberto Tamassia. Springer Verlag, 1999. p. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1663).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Indexing and dictionary matching with one error (extended abstract)

AU - Amir, Amihood

AU - Keselman, Dmitry

AU - Landau, Gad M.

AU - Lewenstein, Moshe

AU - Lewenstein, Noa

AU - Rodeh, Michael

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84948972034

U2 - 10.1007/3-540-48447-7_19

DO - 10.1007/3-540-48447-7_19

M3 - Conference contribution

AN - SCOPUS:84948972034

SN - 3540662790

SN - 9783540662792

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

SP - 181

EP - 192

BT - Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Gupta, Arvind

A2 - Tamassia, Roberto

PB - Springer Verlag

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

Y2 - 11 August 1999 through 14 August 1999

ER -

Amir A, Keselman D, Landau GM, Lewenstein M, Lewenstein N, Rodeh M. Indexing and dictionary matching with one error (extended abstract). In Dehne F, Sack JR, Gupta A, Tamassia R, editors, Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Springer Verlag. 1999. p. 181-192. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48447-7_19

Indexing and dictionary matching with one error (extended abstract)

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this