Two-dimensional substring indexing.
From MaRDI portal
Publication:1401971
DOI10.1016/S0022-0000(03)00028-XzbMATH Open1054.68043OpenAlexW2713662453MaRDI QIDQ1401971FDOQ1401971
Authors: D. Massart 
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
Recommendations
- scientific article; zbMATH DE number 1759461
- Position-Restricted Substring Searching
- scientific article; zbMATH DE number 2011852
- The indexing for one-dimensional proportionally-scaled strings
- Efficient indexing algorithms for one-dimensional discretely-scaled strings
- A data structure for substring-substring LCS length queries
- A substring-substring LCS data structure
- Linear-time string indexing and analysis in small space
Cites Work
- The string B-tree
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- Algorithms for parallel memory. II: Hierarchical multilevel memories
Cited In (8)
- Top-\(k\) document retrieval in optimal space
- On hardness of several string indexing problems
- Fast set intersection and two-patterns matching
- One-dimensional and multi-dimensional substring selectivity estimation
- Approximate colored range and point enclosure queries
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Gapped indexing for consecutive occurrences
- Efficient processing of substring match queries with inverted variable-length gram indexes
This page was built for publication: Two-dimensional substring indexing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401971)
