Bit-Parallel Approximate Matching of Circular Strings with k Mismatches

DOI10.1145/3129536zbMath1414.68149OpenAlexW2754988343MaRDI QIDQ4577948

Tommi Hirvola, Jorma Tarhio

Publication date: 6 August 2018

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3129536

zbMATH Keywords

approximate matchingcircular stringsbit-parallel automata

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, Circular pattern matching with \(k\) mismatches, Quasi-Linear-Time Algorithm for Longest Common Circular Factor, An Encoding for Order-Preserving Matching.

Cites Work

• Unnamed Item
• The wide window string matching algorithm
• NR‐grep: a fast and flexible pattern‐matching tool
• Average-Case Optimal Approximate Circular String Matching
• A Fast Suffix Automata Based Algorithm for Exact Online String Matching
• A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
• Nested Counters in Bit-Parallel String Matching
• Approximate Boyer–Moore String Matching
• Algorithms on Strings, Trees and Sequences
• Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Average-optimal single and multiple approximate string matching
• String Processing and Information Retrieval