Range Non-overlapping Indexing and Successive List Indexing

DOI10.1007/978-3-540-73951-7_54zbMath1209.68160OpenAlexW1480681399MaRDI QIDQ3603563

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein

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

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (17)

The property suffix tree with dynamic properties ⋮ Reporting consecutive substring occurrences under bounded gap constraints ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Efficient Data Structures for the Orthogonal Range Successor Problem ⋮ Succinct Non-overlapping Indexing ⋮ Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints ⋮ Position-restricted substring searching over small alphabets ⋮ Improved data structures for the orthogonal range successor problem ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Unnamed Item ⋮ Improved algorithms for the range next value problem and applications ⋮ Gapped indexing for consecutive occurrences ⋮ Generalized substring compression ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Succinct non-overlapping indexing ⋮ Orthogonal Range Searching for Text Indexing ⋮ Non-Overlapping Indexing - Cache Obliviously

This page was built for publication: Range Non-overlapping Indexing and Successive List Indexing