String matching with variable length gaps

DOI10.1016/j.tcs.2012.03.029zbMath1247.68333DBLPjournals/tcs/BilleGVW12OpenAlexW1986079495WikidataQ60554433 ScholiaQ60554433MaRDI QIDQ442239

Philip Bille, Inge Li Gørtz, David Wind, Hjalte Wedel Vildhøj

Publication date: 10 August 2012

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

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

zbMATH Keywords

string matchingstring algorithmsvariable length gaps

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (8)

Mind the gap! ⋮ Motif matching using gapped patterns ⋮ Longest Common Subsequence with Gap Constraints ⋮ Gapped indexing for consecutive occurrences ⋮ Online parameterized dictionary matching with one gap ⋮ Online recognition of dictionary with one gap ⋮ Unnamed Item ⋮ Dictionary matching with a few gaps

Cites Work

• Unnamed Item
• Unnamed Item
• New techniques for regular expression searching
• Finding Patterns with Variable Length Gaps or Don’t Cares
• New Algorithms for Regular Expression Matching
• Nested Counters in Bit-Parallel String Matching
• Faster Regular Expression Matching
• Efficient string matching
• Fast Pattern Matching in Strings
• A Four Russians algorithm for regular expression pattern matching
• Programming Techniques: Regular expression search algorithm

This page was built for publication: String matching with variable length gaps