Real-time indexing over fixed finite alphabets

Authors:
Amihood Amir;Igor Nor
Affiliations:
Bar-Ilan University, Ramat-Gan, Israel and Johns Hopkins University, Baltimore, MD;Bar-Ilan University, Ramat-Gan, Israel
Venue:
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2008

Citing 7
Cited 4

Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Suffix arrays: a new method for on-line string searches

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition

ACM SIGACT News
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Towards real-time suffix tree construction

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Persistency in suffix trees with applications to string interval problems

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Near real-time suffix tree construction via the fringe marked ancestor problem

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Near real-time suffix tree construction via the fringe marked ancestor problem

Journal of Discrete Algorithms
Full-Fledged real-time indexing for constant size alphabets

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quest for a real-time indexing algorithm is ove three decades old. To date there is no convincing understandable solution to this problem. This paper provides a real-time indexing algorithm over a constant sized alphabet. Assuming the text is arriving at a constant rate, the algorithm spends O(1) time on every text symbol. Whenever a length m pattern is given, the algorithm decides in time O(m) whether there is an occurrence of the pattern in the text thus far.