Nested Counters in Bit-Parallel String Matching

DOI10.1007/978-3-642-00982-2_29zbMath1234.68456OpenAlexW1600024060MaRDI QIDQ3618593

Kimmo Fredriksson, Szymon Grabowski

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_29

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Algorithms on strings (68W32)

Related Items (4)

Bit-Parallel Approximate Matching of Circular Strings with k Mismatches ⋮ Motif matching using gapped patterns ⋮ String matching with variable length gaps ⋮ String indexing for patterns with wildcards

Cites Work

• Efficient string matching with k mismatches
• Surpassing the information theoretic bound with fusion trees
• Bit-parallel witnesses and their applications to approximate string matching
• Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Nested Counters in Bit-Parallel String Matching