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

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

doi:10.1007/978-3-642-12476-1_6

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

Reference:

M. Crochemore, C. S. Iliopoulos, S. P. Pissis, "A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches", in Algorithms and Applications, T. Elomaa, H. Mannila, P. Orponen, Eds., Springer Berlin Heidelberg, 2010, pp. 92-101.

Bibtex Entry:

@incollection{aa2010,
year={2010},
isbn={978-3-642-12475-4},
booktitle={Algorithms and Applications},
volume={6060},
series={Lecture Notes in Computer Science},
editor={Elomaa, Tapio and Mannila, Heikki and Orponen, Pekka},
doi={10.1007/978-3-642-12476-1_6},
title={A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches},
keywords={string algorithms; parallel algorithms; approximate string-matching},
author={Crochemore, Maxime and Iliopoulos, Costas S. and Pissis, Solon P.},
pages={92-101},
publisher={Springer Berlin Heidelberg}
}