Practical space-efficient index for structural pattern matching
From MaRDI portal
Publication:2169971
Recommendations
- scientific article; zbMATH DE number 2011852
- Efficient indexes for the positional pattern matching problem and two related problems over small alphabets
- Index structures for fast similarity search for symbol strings
- Space-efficient dictionaries for parameterized and order-preserving pattern matching
- Space-efficient string indexing for wildcard pattern matching
- Index structures for fast similarity search for binary vectors
- Space Efficient Indexes for String Matching with Don’t Cares
Cites work
- scientific article; zbMATH DE number 1617275 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 7765393 (Why is no real title available?)
- Compressed representations of sequences and full-text indexes
- Efficient pattern matching for RNA secondary structures
- Fully functional static and dynamic succinct trees
- Fully-functional succinct trees
- Generalization of a suffix tree for RNA structural pattern matching
- On the Size of Succinct Indices
- Optimal succinctness for range minimum queries
- Structural Pattern Matching - Succinctly.
- Wavelet trees for all
Cited in
(3)
This page was built for publication: Practical space-efficient index for structural pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169971)