Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
From MaRDI portal
Publication:4577948
DOI10.1145/3129536zbMATH Open1414.68149OpenAlexW2754988343MaRDI QIDQ4577948FDOQ4577948
Authors: 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
Recommendations
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
- Bit-parallel witnesses and their applications to approximate string matching
- Bit-parallel approximate string matching algorithms with transposition
- Average-case optimal approximate circular string matching
- scientific article; zbMATH DE number 710402
- scientific article; zbMATH DE number 2087055
- Bit-parallel approximate string matching algorithms with transposition.
- Parallel string matching with k mismatches
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Cites Work
- Algorithms on Strings, Trees and Sequences
- Approximate Boyer–Moore String Matching
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Average-optimal single and multiple approximate string matching
- Nested Counters in Bit-Parallel String Matching
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Alternative algorithms for bit-parallel string matching.
- NR-grep: A fast and flexible pattern-matching tool
- Title not available (Why is that?)
- Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution
- The wide window string matching algorithm
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Average-case optimal approximate circular string matching
- A fast suffix automata based algorithm for exact online string matching
Cited In (10)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- Bit-parallel witnesses and their applications to approximate string matching
- Fast circular dictionary-matching algorithm
- Average-case optimal approximate circular string matching
- A simple, fast, filter-based algorithm for circular sequence comparison
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
- An encoding for order-preserving matching
- Circular pattern matching with \(k\) mismatches
- Circular pattern matching with \(k\) mismatches
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
This page was built for publication: Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577948)
