String indexing for top-\(k\) close consecutive occurrences
From MaRDI portal
Publication:2163391
DOI10.1016/j.tcs.2022.06.004OpenAlexW3042019835MaRDI QIDQ2163391
Eva Rotenberg, Philip Bille, Inge Li Gørtz, Teresa Anna Steiner, Max Rishøj Pedersen
Publication date: 10 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.04128
Cites Work
- Unnamed Item
- Unnamed Item
- Reporting consecutive substring occurrences under bounded gap constraints
- Top-\(k\) document retrieval in optimal space
- Substring range reporting
- Efficient index for retrieving top-\(k\) most frequent documents
- Making data structures persistent
- Time bounds for selection
- Ranked document retrieval for multiple patterns
- A data structure for dynamic trees
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- String indexing for patterns with wildcards
- Succinct non-overlapping indexing
- Ranked document selection
- Top-\(k\) term-proximity in succinct space
- Indexing factors with gaps
- Indexes for Document Retrieval with Relevance
- Top-k Document Retrieval in External Memory
- Sorted Range Reporting
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
- Time-Optimal Top-$k$ Document Retrieval
- The tree inclusion problem
- Space-Efficient Frameworks for Top- k String Retrieval
- Range Non-overlapping Indexing and Successive List Indexing
- Online Sorted Range Reporting
- Range Non-overlapping Indexing
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- Minimizing diameters of dynamic trees
- Non-Overlapping Indexing - Cache Obliviously
- Spaces, Trees, and Colors
- Gapped indexing for consecutive occurrences
This page was built for publication: String indexing for top-\(k\) close consecutive occurrences
