A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

Carlos E. R. Alves, Edson Cáceres, Siang Wun Song. A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem. Algorithmica, 45(3):301-335, 2006. [doi]

@article{AlvesCS06,
  title = {A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem},
  author = {Carlos E. R. Alves and Edson Cáceres and Siang Wun Song},
  year = {2006},
  doi = {10.1007/s00453-006-1216-z},
  url = {http://dx.doi.org/10.1007/s00453-006-1216-z},
  tags = {e-science},
  researchr = {https://researchr.org/publication/AlvesCS06},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {45},
  number = {3},
  pages = {301-335},
}