Compressed indexes for text with wildcards
type: Item
instance of: scholarly article
title: Compressed indexes for text with wildcards
zbMATH Open document ID: 1292.68185
author: Chris Thachuk
published in: Theoretical Computer Science
publication date: 2014-01-09T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6243774
zbMATH Keywords: compressed indexes
zbMATH Keywords: text search
zbMATH Keywords: wildcard matching
zbMATH Keywords: dictionary matching
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.08.011
OpenAlex ID: W2007240595
cites work: Succincter Text Indexing with Wildcards
cites work: Fast Pattern Matching in Strings
cites work: Q3138909
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Space Efficient Indexes for String Matching with Don’t Cares
cites work: Succinct Dictionary Matching with No Slowdown
cites work: Faster compressed dictionary matching
cites work: Bidirectional Search in a String with Wavelet Trees
cites work: Compressed text indexing with wildcards
cites work: Compressed representations of sequences and full-text indexes
cites work: Q4471381
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Succinct representation of balanced parentheses and static trees
cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
cites work: Faster entropy-bounded compressed suffix trees
cites work: Alphabet-Independent Compressed Text Indexing
cites work: Orthogonal range searching on the RAM, revisited
DOI: 10.1016/J.TCS.2012.08.011
description: scientific article; zbMATH DE number 6243774