A BSP/CGM algorithm for the all-substrings longest common subsequence problem (2003)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
- Language: Inglês
- Imprenta:
- Publisher: IEEE Computer Society
- Publisher place: Los Alamitos
- Date published: 2003
- Source:
- Título: Proceedings
- Conference titles: International Parallel and Distributed Processing Symposium
-
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: 05 mar. 2026. -
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 2026 mar. 05 ] -
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2026 mar. 05 ] - An all-substrings common subsequence algorithm
- Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds
- Efficient two-dimensional parallel pattern matching with scaling
- Real time systolic algorithm for one-the-fly hidden surface removal
- Resultados recentes para encolhimento de ciclos em malhas encaixadas
- Algoritmo de multiplicação de matrizes para implementação em VLSI
- Disposicoes compactas de arvores no plano
- Complexidade de e/s e projetos optimais de dispositivos para ordenação
- Highly configurable architecture for powerful processors
- Efficient embeddings into the hypercube using matrix transformations
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
