Full-Fledged real-time indexing for constant size alphabets

Authors:
Gregory Kucherov;Yakov Nekrich
Affiliations:
Laboratoire d'Informatique Gaspard Monge, Université Paris-Est & CNRS, Paris, France,Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel;Department of Electrical Engineering & Computer Science, University of Kansas
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Year:
2013

Citing 13
Cited 0

Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
String Matching in Real Time

Journal of the ACM (JACM)
Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic weighted ancestors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Real-time indexing over fixed finite alphabets

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

ACM Transactions on Algorithms (TALG)
Simple real-time constant-space string matching

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
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
Top-k document retrieval in optimal time and linear space

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards real-time suffix tree construction

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Cross-Document pattern matching

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet of constant size. Each new symbol can be prepended to T in O(1) expected worst-case time. At any moment, we can report all occurrences of a pattern P in the current text in O(|P|+k) time, where |P| is the length of P and k is the number of occurrences. This resolves, under assumption of constant size alphabet, a long-standing open problem of existence of a real-time indexing method for string matching (see [2]).