Alves, C. E., Caceres, E. N., & Song, S. W. (2006). A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem. Algorithmica, 45(3), 301-335. https://doi.org/10.1007/s00453-006-1216-z
Citace podle Chicago (17th ed.)Alves, Carlos E.R., Edson N. Caceres, a Siang Wun Song. "A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem." Algorithmica 45, no. 3 (2006): 301-335. https://doi.org/10.1007/s00453-006-1216-z.
Citace podle MLA (9th ed.)Alves, Carlos E.R., et al. "A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem." Algorithmica, vol. 45, no. 3, 2006, pp. 301-335, https://doi.org/10.1007/s00453-006-1216-z.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..