A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches

DOI10.1007/978-3-642-12476-1_6MaRDI QIDQ3558261zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

parallel algorithmsstring algorithmsapproximate string-matching

Mathematics Subject Classification ID

Approximation algorithms (68W25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

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

Cited in

(11)

• scientific article; zbMATH DE number 2112398 (Why is no real title available?)
• A parallel multistart algorithm for the closest string problem
• On the lower bound for parallel string matching
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• scientific article; zbMATH DE number 710402 (Why is no real title available?)
• Accurate and efficient methods to improve multiple circular sequence alignment
• String Processing and Information Retrieval
• scientific article; zbMATH DE number 1948479 (Why is no real title available?)
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
• Effective parallel multicore-optimized \(k\)-mers counting algorithm
• Heterogeneous parallel string matching algorithm based on mobile platform

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)