Structural Pattern Matching - Succinctly.
From MaRDI portal
Publication:5136254
DOI10.4230/LIPICS.ISAAC.2017.35zbMATH Open1457.68335OpenAlexW2783828021MaRDI QIDQ5136254FDOQ5136254
Authors: Arnab Ganguly, Rahul Shah, Sharma V. Thankachan 
Publication date: 25 November 2020
Full work available at URL: http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#0002ST17
Recommendations
- Pattern Matching
- Contextual Pattern Matching
- Constrained pattern matching
- Practical space-efficient index for structural pattern matching
- Exact pattern matching. Current achievements and research
- Compressed parameterized pattern matching
- scientific article; zbMATH DE number 7650903
- Optimizing pattern matching
- Multiple matching of parameterized patterns
- scientific article; zbMATH DE number 1045405
suffix treewavelet treeBurrows-Wheeler transformparameterized pattern matchingfully-functional succinct tree
Cites Work
- Algorithms on Strings, Trees and Sequences
- Fully functional static and dynamic succinct trees
- Compressed representations of sequences and full-text indexes
- Indexing compressed text
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Fully compressed suffix trees
- Alphabet-independent compressed text indexing
- Title not available (Why is that?)
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Wavelet trees for all
- Order-preserving indexing
- Faster Suffix Tree Construction with Missing Suffix Links
- Title not available (Why is that?)
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- On the Size of Succinct Indices
- Top-\(k\) document retrieval in optimal space
- A theory of parameterized pattern matching
- Wee LCP
- Generalizations of suffix arrays to multi-dimensional matrices.
- pBWT: achieving succinct data structures for parameterized pattern matching and related problems
- Title not available (Why is that?)
- Geometric suffix tree: indexing protein 3-D structures
Cited In (5)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Succinct non-overlapping indexing
- Practical space-efficient index for structural pattern matching
- pBWT: achieving succinct data structures for parameterized pattern matching and related problems
- A brief history of parameterized matching problems
This page was built for publication: Structural Pattern Matching - Succinctly.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136254)
