Compressed indexes for text with wildcards
From MaRDI portal
Publication:390873
DOI10.1016/J.TCS.2012.08.011zbMATH Open1292.68185OpenAlexW2007240595MaRDI QIDQ390873FDOQ390873
Authors: 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
Recommendations
Cites Work
- Succinct representation of balanced parentheses and static trees
- Compressed representations of sequences and full-text indexes
- Dictionary matching and indexing with errors and don't cares
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Alphabet-independent compressed text indexing
- Fast Pattern Matching in Strings
- Space Efficient Indexes for String Matching with Don’t Cares
- Orthogonal range searching on the RAM, revisited
- Compressed text indexing with wildcards
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Title not available (Why is that?)
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Faster entropy-bounded compressed suffix trees
- Faster compressed dictionary matching
- Succincter text indexing with wildcards
- Title not available (Why is that?)
- Bidirectional search in a string with wavelet trees
- Succinct Dictionary Matching with No Slowdown
Cited In (4)
This page was built for publication: Compressed indexes for text with wildcards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390873)
