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

DOI10.1007/978-3-642-12476-1_6zbMath1284.68693OpenAlexW4298404451MaRDI QIDQ3558261

Maxime Crochemore, Solon P. Pissis, Costas S. Iliopoulos

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

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

Related Items (1)

Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment

This page was built for publication: A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches