Parameterized dictionary matching and recognition with one gap

DOI10.1016/j.tcs.2020.11.017zbMath1477.68557OpenAlexW3108065073MaRDI QIDQ2220853

B. Riva Shalom

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.017

zbMATH Keywords

dictionary matchingparameterized matchinggapped pattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

Cites Work

• Unnamed Item
• Unnamed Item
• On the parameterised complexity of string morphism problems
• Multiple matching of parameterized patterns
• A faster algorithm for matching a set of patterns with variable length don't cares
• On the longest common parameterized subsequence
• Alphabet dependence in parameterized matching
• Dynamic dictionary matching
• Matching a set of strings with variable length don't cares
• Dictionary matching with a bounded gap in pattern or in text
• Improved dynamic dictionary matching
• Online recognition of dictionary with one gap
• Dictionary matching with a few gaps
• Mind the gap!
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• Fast circular dictionary-matching algorithm
• The string B-tree
• Efficient string matching
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Alphabet-Independent and Scaled Dictionary Matching
• Text Indexing and Dictionary Matching with One Error
• Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
• A theory of parameterized pattern matching
• A Framework for Dynamic Parameterized Dictionary Matching

This page was built for publication: Parameterized dictionary matching and recognition with one gap