Less space: indexing for queries with wildcards

DOI10.1016/J.TCS.2014.09.003zbMATH Open1338.68053OpenAlexW1964432965MaRDI QIDQ300263FDOQ300263

Authors: Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan 

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.003

Recommendations

• Less space: indexing for queries with wildcards
• String indexing for patterns with wildcards
• Space-efficient string indexing for wildcard pattern matching
• String indexing for patterns with wildcards
• Space Efficient Indexes for String Matching with Don’t Cares

zbMATH Keywords

data structuresrange searchingsuffix treeswildcardsstring indexing

Mathematics Subject Classification ID

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

Cites Work

• A data structure for dynamic trees
• Improved compressed indexes for full-text document retrieval
• Dictionary matching and indexing with errors and don't cares
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Fully-functional succinct trees
• Text Indexing and Dictionary Matching with One Error
• String indexing for patterns with wildcards
• Indexing factors with gaps
• Orthogonal range searching for text indexing
• Less space: indexing for queries with wildcards
• Document retrieval with one wildcard
• Space-efficient string indexing for wildcard pattern matching
• Substring Range Reporting
• Suffix Arrays: A New Method for On-Line String Searches
• Space Efficient Indexes for String Matching with Don’t Cares
• Orthogonal range searching on the RAM, revisited
• Approximate string matching using compressed suffix arrays
• Succinct data structures for flexible text retrieval systems
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Compressed text indexing with wildcards
• Rank/select operations on large alphabets
• Medium-Space Algorithms for Inverse BWT
• Compressed indexes for text with wildcards
• Title not available (Why is that?)
• Compressed indexes for approximate string matching

Cited In (12)

• On the average-case complexity of pattern matching with wildcards
• Reordering columns for smaller indexes
• Document retrieval with one wildcard
• Document retrieval with one wildcard
• Less space: indexing for queries with wildcards
• Space Efficient Indexes for String Matching with Don’t Cares
• Succincter text indexing with wildcards
• On character-based index schemes for complex wildcard search in peer-to-peer networks
• Compressed indexes for text with wildcards
• Space-efficient string indexing for wildcard pattern matching
• String indexing for patterns with wildcards
• Pattern masking for dictionary matching: theory and practice

This page was built for publication: Less space: indexing for queries with wildcards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300263)