Structural Pattern Matching - Succinctly.

DOI10.4230/LIPICS.ISAAC.2017.35MaRDI QIDQ5136254zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

suffix treewavelet treeBurrows-Wheeler transformparameterized pattern matchingfully-functional succinct tree

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1617275 (Why is no real title available?)
• scientific article; zbMATH DE number 437565 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• A theory of parameterized pattern matching
• Algorithms on Strings, Trees and Sequences
• Alphabet-independent compressed text indexing
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressed representations of sequences and full-text indexes
• Faster Suffix Tree Construction with Missing Suffix Links
• Fully compressed suffix trees
• Fully functional static and dynamic succinct trees
• Generalizations of suffix arrays to multi-dimensional matrices.
• Geometric suffix tree: indexing protein 3-D structures
• Indexing compressed text
• On the Size of Succinct Indices
• Order-preserving indexing
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Top-\(k\) document retrieval in optimal space
• Wavelet trees for all
• Wee LCP
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems

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)