Finding Patterns with Variable Length Gaps or Don’t Cares

DOI10.1007/11809678_17zbMath1162.68810OpenAlexW1516545470MaRDI QIDQ3591351

M. Sohel Rahman, Inbok Lee, Costas S. Iliopoulos, W. F. Smyth, Manal Mohamed

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_17

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (8)

Indexing factors with gaps ⋮ Motif matching using gapped patterns ⋮ Online parameterized dictionary matching with one gap ⋮ String matching with variable length gaps ⋮ String indexing for patterns with wildcards ⋮ Optimal prefix and suffix queries on texts ⋮ Efficient pattern matching in elastic-degenerate strings ⋮ Dictionary matching with a few gaps

This page was built for publication: Finding Patterns with Variable Length Gaps or Don’t Cares