Succincter Text Indexing with Wildcards

DOI10.1007/978-3-642-21458-5_5zbMath1339.68339OpenAlexW1821928658MaRDI QIDQ3011841

Chris Thachuk

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_5

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (3)

Compressed indexes for text with wildcards ⋮ On the average-case complexity of pattern matching with wildcards ⋮ Compressed text indexing with wildcards

Cites Work

• Unnamed Item
• Unnamed Item
• Faster entropy-bounded compressed suffix trees
• Succinct Representation of Balanced Parentheses and Static Trees
• Compressed representations of sequences and full-text indexes
• 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)
• A Compressed Enhanced Suffix Array Supporting Fast String Matching
• 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

This page was built for publication: Succincter Text Indexing with Wildcards