A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (2006)
Source: Algorithmica. Unidade: IME
Assunto: ALGORITMOS
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, v. 45, n. 3, p. 301-335, 2006Tradução . . Disponível em: https://doi.org/10.1007/s00453-006-1216-z. Acesso em: 09 out. 2024.APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica, 45( 3), 301-335. doi:10.1007/s00453-006-1216-zNLM
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s00453-006-1216-zVancouver
Alves CER, Cáceres EN, Song SW. A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem [Internet]. Algorithmica. 2006 ; 45( 3): 301-335.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s00453-006-1216-z