String indexing for patterns with wildcards

DOI10.1007/S00224-013-9498-4MaRDI QIDQ6828169zbMATH OpenFDO

Authors Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind

Publication date 5 February 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-013-9498-4

zbMATH Keywords

LCP data structurestring indexingsuffix treevariable length gapwildcard

Mathematics Subject Classification ID

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

Cited in

(5)

• String indexing for top-\(k\) close consecutive occurrences
• Gapped string indexing in subquadratic space and sublinear query time
• Longest common extensions with wildcards: trade-off and applications
• Text indexing for simple regular expressions
• Repetition aware text indexing for matching patterns with wildcards

This page was built for publication: String indexing for patterns with wildcards

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