A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers (2005)
Unidade: IMEAssunto: ALGORITMOS E ESTRUTURAS DE DADOS
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf. Acesso em: 28 ago. 2024. , 2005APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdfNLM
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 ago. 28 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdfVancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguos subsequences of a sequence of numbers [Internet]. 2005 ;[citado 2024 ago. 28 ] Available from: https://repositorio.usp.br/directbitstream/ef5e9997-cd98-4742-b72d-f10d5a9a7847/1419659.pdf