Structural Pattern Matching - Succinctly.

DOI10.4230/LIPIcs.ISAAC.2017.35zbMath1457.68335OpenAlexW2783828021MaRDI QIDQ5136254

Sharma V. Thankachan, Rahul Shah, Arnab Ganguly

Publication date: 25 November 2020

Full work available at URL: http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#0002ST17

zbMATH Keywords

Burrows-Wheeler transformsuffix treewavelet treeparameterized pattern matchingfully-functional succinct tree

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (4)

Practical space-efficient index for structural pattern matching ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Succinct non-overlapping indexing ⋮ A brief history of parameterized matching problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order-preserving indexing
• Top-\(k\) document retrieval in optimal space
• Wee LCP
• Generalizations of suffix arrays to multi-dimensional matrices.
• Wavelet trees for all
• Fully Functional Static and Dynamic Succinct Trees
• Compressed representations of sequences and full-text indexes
• Alphabet-Independent Compressed Text Indexing
• Fully compressed suffix trees
• On the Size of Succinct Indices
• Indexing compressed text
• Geometric suffix tree
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Algorithms on Strings, Trees and Sequences
• Faster Suffix Tree Construction with Missing Suffix Links
• pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
• Spaces, Trees, and Colors
• A theory of parameterized pattern matching
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

This page was built for publication: Structural Pattern Matching - Succinctly.