Simpler FM-index for parameterized string matching

DOI10.1016/J.IPL.2020.106026MaRDI QIDQ2224844zbMATH OpenOpenAlexFDO

Authors Hwan-Gue Cho, SungHwan Kim

Publication date 4 February 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2020.106026

zbMATH Keywords

data structuressuccinct data structuresuffix arrayBurrows-Wheeler transformparameterized string matching

Mathematics Subject Classification ID

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

Recommendations

• A framework for dynamic parameterized dictionary matching
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems
• Space-efficient dictionaries for parameterized and order-preserving pattern matching
• Efficient parameterized string matching
• Fast parameterized matching with \(q\)-grams

Cites work

• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• Parameterized pattern matching: Algorithms and applications
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Wavelet trees for all
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems

Cited in

(4)

• A framework for dynamic parameterized dictionary matching
• Parameterized DAWGs: efficient constructions and bidirectional pattern searches
• Computing the parameterized Burrows-Wheeler transform online
• Position heaps for parameterized strings

This page was built for publication: Simpler FM-index for parameterized string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224844)