String indexing for top-k close consecutive occurrences
From MaRDI portal
Publication:2163391
DOI10.1016/J.TCS.2022.06.004OpenAlexW3042019835MaRDI QIDQ2163391FDOQ2163391
Authors: Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner 
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
Recommendations
- scientific article; zbMATH DE number 2011852
- Fast index for approximate string matching
- Enumerating Neighbour and Closest Strings
- scientific article; zbMATH DE number 2185640
- Approximate string matching using a bidirectional index
- Approximate String Matching Using a Bidirectional Index
- Space-efficient frameworks for top-\(k\) string retrieval
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Cites Work
- A data structure for dynamic trees
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Online sorted range reporting
- Indexing factors with gaps
- Indexes for document retrieval with relevance
- Top-\(k\) document retrieval in external memory
- Space-efficient frameworks for top-\(k\) string retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- Making data structures persistent
- Title not available (Why is that?)
- Sorted range reporting
- Persistent predecessor search and orthogonal point location on the word RAM
- Reporting consecutive substring occurrences under bounded gap constraints
- The tree inclusion problem
- Range Non-overlapping Indexing and Successive List Indexing
- Range non-overlapping indexing
- Minimizing diameters of dynamic trees
- Substring range reporting
- Time bounds for selection
- Time-optimal top-\(k\) document retrieval
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Top-\(k\) document retrieval in optimal space
- Efficient index for retrieving top-\(k\) most frequent documents
- Succinct non-overlapping indexing
- Non-overlapping indexing -- cache obliviously
- Title not available (Why is that?)
- Ranked document retrieval for multiple patterns
- Ranked document selection
- Top-\(k\) term-proximity in succinct space
- Gapped indexing for consecutive occurrences
Cited In (5)
This page was built for publication: String indexing for top-\(k\) close consecutive occurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163391)
