A BSP/CGM algorithm for the all-substrings longest common subsequence problem (2003)
Fonte: Proceedings. Nome do evento: International Parallel and Distributed Processing Symposium. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. 2003, Anais.. Los Alamitos: IEEE Computer Society, 2003. . Acesso em: 13 nov. 2025.APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2003). A BSP/CGM algorithm for the all-substrings longest common subsequence problem. In Proceedings. Los Alamitos: IEEE Computer Society.NLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2025 nov. 13 ]Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2025 nov. 13 ]
