A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
From MaRDI portal
Publication:3558261
DOI10.1007/978-3-642-12476-1_6zbMATH Open1284.68693OpenAlexW4298404451MaRDI QIDQ3558261FDOQ3558261
Authors: Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis 
Publication date: 4 May 2010
Published in: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_6
Recommendations
- scientific article; zbMATH DE number 710402
- Parallel string matching with k mismatches
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- A constant-time optimal parallel string-matching algorithm
- On the lower bound for parallel string matching
- On the lower bound for parallel string matching
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- A Lower Bound for Parallel String Matching
- scientific article; zbMATH DE number 2112398
- scientific article; zbMATH DE number 1445379
Approximation algorithms (68W25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)
Cited In (11)
- A parallel multistart algorithm for the closest string problem
- Title not available (Why is that?)
- Accurate and efficient methods to improve multiple circular sequence alignment
- Heterogeneous parallel string matching algorithm based on mobile platform
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
- Effective parallel multicore-optimized \(k\)-mers counting algorithm
- On the lower bound for parallel string matching
- Title not available (Why is that?)
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- String Processing and Information Retrieval
- Title not available (Why is that?)
This page was built for publication: A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558261)
