Compressed indexes for text with wildcards

DOI10.1016/J.TCS.2012.08.011zbMath1292.68185OpenAlexW2007240595MaRDI QIDQ390873

Chris Thachuk

Publication date: 9 January 2014

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

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

zbMATH Keywords

text searchcompressed indexesdictionary matchingwildcard matching

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Data structures (68P05) Algorithms on strings (68W32)

Related Items (1)

Less space: indexing for queries with wildcards

Cites Work

• Unnamed Item
• Unnamed Item
• Faster entropy-bounded compressed suffix trees
• Faster compressed dictionary matching
• Compressed text indexing with wildcards
• Succinct Representation of Balanced Parentheses and Static Trees
• Compressed representations of sequences and full-text indexes
• Succincter Text Indexing with Wildcards
• Alphabet-Independent Compressed Text Indexing
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Bidirectional Search in a String with Wavelet Trees
• Succinct Dictionary Matching with No Slowdown
• Dictionary matching and indexing with errors and don't cares
• Fast Pattern Matching in Strings
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Space Efficient Indexes for String Matching with Don’t Cares
• Orthogonal range searching on the RAM, revisited

This page was built for publication: Compressed indexes for text with wildcards