On position restricted substring searching in succinct space

DOI10.1016/j.jda.2012.09.002zbMath1267.68102OpenAlexW1989749956MaRDI QIDQ2376796

Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter, Sharma V. Thankachan

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.09.002

zbMATH Keywords

pattern matchingrange searchingsuccint data structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (10)

Top-\(k\) term-proximity in succinct space ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Succinct Non-overlapping Indexing ⋮ Position-restricted substring searching over small alphabets ⋮ Generalized substring compression ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Succinct non-overlapping indexing ⋮ Ranked document selection ⋮ Orthogonal Range Searching for Text Indexing ⋮ Improved and extended locating functionality on compressed suffix arrays

Cites Work

• Unnamed Item
• Efficient worst-case data structures for range searching
• Compressed text indexing with wildcards
• Compressed representations of sequences and full-text indexes
• Substring Range Reporting
• Alphabet-Independent Compressed Text Indexing
• Suffix Arrays: A New Method for On-Line String Searches
• Lower bounds for orthogonal range searching: I. The reporting case
• Position-Restricted Substring Searching
• Indexing compressed text
• A Space-Economical Suffix Tree Construction Algorithm
• Orthogonal range searching on the RAM, revisited
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

This page was built for publication: On position restricted substring searching in succinct space