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: 29 dez. 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 dez. 29 ] -
Vancouver
Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for the all-substrings longest common subsequence problem. Proceedings. 2003 ;[citado 2025 dez. 29 ] - Comprehensive evaluation of a two dimensional configurable array
- Towards a simple construction method for hamiltonian decomposition of the hypercube
- Revisiting cycle shrinking
- Randomized parallel list ranking for distributed memory multiprocessors
- A parallel solution to infer genetic network architectures in gene expression analysis
- A range minima parallel algorithm for coarse grained multicomputers
- Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm
- Message from de guest editors
- Reconhecimento de linguagens regulares por standard cells
- Paralelizacao de lacos encaixados pela tecnica de encolhimento de ciclos
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
