Substring Range Reporting

DOI10.1007/978-3-642-21458-5_26zbMath1339.68049DBLPconf/cpm/BilleG11arXiv1108.3683OpenAlexW2015586288WikidataQ60554445 ScholiaQ60554445MaRDI QIDQ3011863

Philip Bille, Inge Li Gørtz

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.3683

Mathematics Subject Classification ID

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

Related Items (8)

Document retrieval with one wildcard ⋮ Less space: indexing for queries with wildcards ⋮ On position restricted substring searching in succinct space ⋮ Generalized substring compression ⋮ Simple and efficient LZW-compressed multiple pattern matching ⋮ String indexing for patterns with wildcards ⋮ Orthogonal Range Searching for Text Indexing ⋮ Improved and extended locating functionality on compressed suffix arrays

Cites Work

• Unnamed Item
• Improved data structures for the orthogonal range successor problem
• Property matching and weighted matching
• Optimal prefix and suffix queries on texts
• Errata for ``Faster index for property matching
• Faster index for property matching
• Indexing factors with gaps
• Rank and select revisited and extended
• Time-space trade-offs for predecessor search
• Finding Patterns In Given Intervals
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Position-Restricted Substring Searching
• On dynamic range reporting in one dimension
• Range Non-overlapping Indexing
• Filtering Search: A New Approach to Query-Answering
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Algorithms on Strings, Trees and Sequences
• Optimal static range reporting in one dimension
• On the sorting-complexity of suffix tree construction

This page was built for publication: Substring Range Reporting