Practical space-efficient index for structural pattern matching

DOI10.1007/978-3-031-06678-8_27OpenAlexW4285166871MaRDI QIDQ2169971FDOQ2169971

Authors: Hwan-Gue Cho, SungHwan Kim 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_27

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

zbMATH Keywords

string matchingsuffix arraycompact data structureFM-indexLF-mapping

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Fully functional static and dynamic succinct trees
• Compressed representations of sequences and full-text indexes
• Optimal succinctness for range minimum queries
• Fully-functional succinct trees
• Wavelet trees for all
• Title not available (Why is that?)
• On the Size of Succinct Indices
• Generalization of a suffix tree for RNA structural pattern matching
• Efficient pattern matching for RNA secondary structures
• Title not available (Why is that?)
• Structural Pattern Matching - Succinctly.
• Title not available (Why is that?)

Cited In (3)

• Structural Pattern Matching - Succinctly.
• A new efficient indexing algorithm for one-dimensional real scaled patterns
• spmindex

Uses Software

• GitHub

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)