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

Authors:
S. Rao Kosaraju
Affiliations:
Department of Computer Science, The Johns Hopkins University, Baltimore, MD
Venue:
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Year:
1994

On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
Random suffix search trees

Random Structures & Algorithms
Real-time indexing over fixed finite alphabets

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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

Hi-index	0.00