Less space: indexing for queries with wildcards
type: Item
instance of: scholarly article
title: Less space: indexing for queries with wildcards
zbMATH Open document ID: 1338.68053
author: Moshe Lewenstein
author: J. Ian Munro
author: Venkatesh Raman
author: Sharma V. Thankachan
published in: Theoretical Computer Science
publication date: 2016-06-27T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6598561
zbMATH Keywords: string indexing
zbMATH Keywords: data structures
zbMATH Keywords: wildcards
zbMATH Keywords: range searching
zbMATH Keywords: suffix trees
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.09.003
OpenAlex ID: W1964432965
cites work: Text Indexing and Dictionary Matching with One Error
cites work: Q4633891
cites work: Improved compressed indexes for full-text document retrieval
cites work: Substring Range Reporting
cites work: String indexing for patterns with wildcards
cites work: Compressed indexes for approximate string matching
cites work: Orthogonal range searching on the RAM, revisited
cites work: Geometric BWT: compressed text indexing via sparse suffixes and range searching
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Rank/select operations on large alphabets
cites work: Compressed text indexing with wildcards
cites work: Approximate string matching using compressed suffix arrays
cites work: Indexing factors with gaps
cites work: Medium-Space Algorithms for Inverse BWT
cites work: Space Efficient Indexes for String Matching with Don’t Cares
cites work: Orthogonal Range Searching for Text Indexing
cites work: Less Space: Indexing for Queries with Wildcards
cites work: Document Retrieval with One Wildcard
cites work: Space-Efficient String Indexing for Wildcard Pattern Matching.
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Succinct data structures for flexible text retrieval systems
cites work: Q5417613
cites work: A data structure for dynamic trees
cites work: Compressed indexes for text with wildcards
DOI: 10.1016/J.TCS.2014.09.003
description: scientific article; zbMATH DE number 6598561