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

DOI10.1145/195058.195170zbMath1345.68303OpenAlexW1977531050MaRDI QIDQ2817622

S. Rao Kosaraju

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195170

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Full-fledged real-time indexing for constant size alphabets ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ On-line construction of two-dimensional suffix trees ⋮ Random suffix search trees

This page was built for publication: Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)