Two-dimensional substring indexing.
From MaRDI portal
Publication:1401971
DOI10.1016/S0022-0000(03)00028-XzbMath1054.68043OpenAlexW2713662453MaRDI QIDQ1401971
Publication date: 19 August 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00028-x
Related Items (6)
Top-\(k\) document retrieval in optimal space ⋮ Gapped indexing for consecutive occurrences ⋮ Spaces, Trees, and Colors ⋮ Fast set intersection and two-patterns matching ⋮ Approximate colored range and point enclosure queries ⋮ On hardness of several string indexing problems
Cites Work
- Unnamed Item
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- A Space-Economical Suffix Tree Construction Algorithm
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
This page was built for publication: Two-dimensional substring indexing.
