Range Non-overlapping Indexing and Successive List Indexing
From MaRDI portal
Publication:3603563
DOI10.1007/978-3-540-73951-7_54zbMATH Open1209.68160OpenAlexW1480681399MaRDI QIDQ3603563FDOQ3603563
Orgad Keller, Moshe Lewenstein, Tsvi Kopelowitz
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_54
Recommendations
Cited In (19)
- Title not available (Why is that?)
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Improved algorithms for the range next value problem and applications
- Reporting consecutive substring occurrences under bounded gap constraints
- The property suffix tree with dynamic properties
- New algorithms on wavelet trees and applications to information retrieval
- I/O-efficient data structures for non-overlapping indexing
- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
- Improved data structures for the orthogonal range successor problem
- Succinct non-overlapping indexing
- String indexing for top-\(k\) close consecutive occurrences
- Range non-overlapping indexing
- Succinct Non-overlapping Indexing
- Position-restricted substring searching over small alphabets
- Gapped indexing for consecutive occurrences
- Generalized substring compression
- Orthogonal Range Searching for Text Indexing
- Non-Overlapping Indexing - Cache Obliviously
- Non-overlapping indexing in BWT-runs bounded space
This page was built for publication: Range Non-overlapping Indexing and Successive List Indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603563)