A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

DOI10.1007/S00453-006-1216-ZzbMath1097.68144OpenAlexW2147602940MaRDI QIDQ2502283

C. E. R. Alves, E. N. Cáceres, Siang W. Song

Publication date: 12 September 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-1216-z

zbMATH Keywords

Coarse-Grained Multicomputer

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

This page was built for publication: A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem