Ranked document retrieval with forbidden pattern
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- Algorithms on Strings, Trees and Sequences
- Bottom-\(k\) document retrieval
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Document listing for queries with excluded pattern
- Efficient Storage and Retrieval by Content and Address of Static Files
- Fast set intersection and two-patterns matching
- Forbidden patterns
- Introduction to algorithms
- Linear-space data structures for range frequency queries on arrays and trees
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- On Hardness of Several String Indexing Problems
- Optimal static range reporting in one dimension
- Space-Efficient Framework for Top-k String Retrieval Problems
- Space-efficient frameworks for top-k string retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Top-\(k\) document retrieval in optimal time and linear space
- Weighted ancestors in suffix trees
Cited in
(4)
This page was built for publication: Ranked document retrieval with forbidden pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942247)