Position-Restricted Substring Searching

DOI10.1007/11682462_64zbMath1145.68392OpenAlexW1556371643MaRDI QIDQ3525802

Veli Mäkinen, Gonzalo Navarro

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_64

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (22)

Succinct representations of weighted trees supporting path queries ⋮ On position restricted substring searching in succinct space ⋮ Grammar compressed sequences with rank/select support ⋮ Succinct Non-overlapping Indexing ⋮ Position-restricted substring searching over small alphabets ⋮ Extracting powers and periods in a word from its runs structure ⋮ Efficient index for retrieving top-\(k\) most frequent documents ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Unnamed Item ⋮ Improved algorithms for the range next value problem and applications ⋮ On optimally partitioning a text to improve its compression ⋮ Generalized substring compression ⋮ Wavelet trees for all ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Substring Range Reporting ⋮ Substring range reporting ⋮ Optimal prefix and suffix queries on texts ⋮ Succinct non-overlapping indexing ⋮ Ranked document selection ⋮ Orthogonal Range Searching for Text Indexing ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching ⋮ Practical Compact Indexes for Top-kDocument Retrieval

This page was built for publication: Position-Restricted Substring Searching