ReP USP - Resultado da busca

Artigo de periodico
A parallel solution to infer genetic network architectures in gene expression analysis (2003)
Ruchkys, Danielle Passos de; Song, Siang Wun
Fonte: International Journal of High Performance Computing Applications. Unidade: IME
Assunto: ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RUCHKYS, Danielle Passos de e SONG, Siang Wun. A parallel solution to infer genetic network architectures in gene expression analysis. International Journal of High Performance Computing Applications, v. 17, n. 2, p. 163-172, 2003Tradução . . Disponível em: https://doi.org/10.1177/1094342003017002006. Acesso em: 09 nov. 2025.
APA
Ruchkys, D. P. de, & Song, S. W. (2003). A parallel solution to infer genetic network architectures in gene expression analysis. International Journal of High Performance Computing Applications, 17( 2), 163-172. doi:10.1177/1094342003017002006
NLM
Ruchkys DP de, Song SW. A parallel solution to infer genetic network architectures in gene expression analysis [Internet]. International Journal of High Performance Computing Applications. 2003 ; 17( 2): 163-172.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1177/1094342003017002006
Vancouver
Ruchkys DP de, Song SW. A parallel solution to infer genetic network architectures in gene expression analysis [Internet]. International Journal of High Performance Computing Applications. 2003 ; 17( 2): 163-172.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1177/1094342003017002006
Trabalho de evento
A CGM/BSP parallel similarity algorithm (2002)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Dehne, Frank; Song, Siang Wun
Fonte: Anais. Nome do evento: Workshop Brasileiro de Bioinformática. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues et al. A CGM/BSP parallel similarity algorithm. 2002, Anais.. Porto Alegre: II-UFRGS, 2002. . Acesso em: 09 nov. 2025.
APA
Alves, C. E. R., Cáceres, E. N., Dehne, F., & Song, S. W. (2002). A CGM/BSP parallel similarity algorithm. In Anais. Porto Alegre: II-UFRGS.
NLM
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2025 nov. 09 ]
Vancouver
Alves CER, Cáceres EN, Dehne F, Song SW. A CGM/BSP parallel similarity algorithm. Anais. 2002 ;[citado 2025 nov. 09 ]
Trabalho de evento
A parallel approximation hitting set algorithm for gene expression analysis (2002)
Ruchkys, Danielle Passos de; Song, Siang Wun
Fonte: Proceedings. Nome do evento: Symposium on Computer Architecture and High Performance Computing. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RUCHKYS, Danielle Passos de e SONG, Siang Wun. A parallel approximation hitting set algorithm for gene expression analysis. 2002, Anais.. Piscataway: IEEE, 2002. Disponível em: https://doi.org/10.1109/CAHPC.2002.1180762. Acesso em: 09 nov. 2025.
APA
Ruchkys, D. P. de, & Song, S. W. (2002). A parallel approximation hitting set algorithm for gene expression analysis. In Proceedings. Piscataway: IEEE. doi:10.1109/CAHPC.2002.1180762
NLM
Ruchkys DP de, Song SW. A parallel approximation hitting set algorithm for gene expression analysis [Internet]. Proceedings. 2002 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1109/CAHPC.2002.1180762
Vancouver
Ruchkys DP de, Song SW. A parallel approximation hitting set algorithm for gene expression analysis [Internet]. Proceedings. 2002 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1109/CAHPC.2002.1180762
Parte de monografia/livro
Parallel graph algorithms for coarse-grained multicomputers (2002)
Song, Siang Wun
Fonte: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SONG, Siang Wun. Parallel graph algorithms for coarse-grained multicomputers. Models for parallel and distributed computation : theory, algorithmic techniques and applications. Tradução . Boston: Springer, 2002. . Disponível em: https://doi.org/10.1007/978-1-4757-3609-0_6. Acesso em: 09 nov. 2025.
APA
Song, S. W. (2002). Parallel graph algorithms for coarse-grained multicomputers. In Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer. doi:10.1007/978-1-4757-3609-0_6
NLM
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
Vancouver
Song SW. Parallel graph algorithms for coarse-grained multicomputers [Internet]. In: Models for parallel and distributed computation : theory, algorithmic techniques and applications. Boston: Springer; 2002. [citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/978-1-4757-3609-0_6
Trabalho de evento
A parallel unrestricted depth search algorithm (2001)
Cáceres, Edson Norberto ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: Proceedings. Nome do evento: International Conference on Parallel and Distributed Processing Techniques and Applications - PDPTA. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A parallel unrestricted depth search algorithm. 2001, Anais.. Las Vegas: Instituto de Matemática e Estatística, Universidade de São Paulo, 2001. . Acesso em: 09 nov. 2025.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A parallel unrestricted depth search algorithm. In Proceedings. Las Vegas: Instituto de Matemática e Estatística, Universidade de São Paulo.
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A parallel unrestricted depth search algorithm. Proceedings. 2001 ;[citado 2025 nov. 09 ]
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A parallel unrestricted depth search algorithm. Proceedings. 2001 ;[citado 2025 nov. 09 ]
Trabalho de evento
A coarse-grained parallel algorithm for maximal cliques in circle graphs (2001)
Cáceres, Edson Norberto ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: Proceedings. Nome do evento: International Conference on Computational Science - ICCS. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. A coarse-grained parallel algorithm for maximal cliques in circle graphs. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-45718-6_69. Acesso em: 09 nov. 2025.
APA
Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2001). A coarse-grained parallel algorithm for maximal cliques in circle graphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45718-6_69
NLM
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
Vancouver
Cáceres EN, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for maximal cliques in circle graphs [Internet]. Proceedings. 2001 ;[citado 2025 nov. 09 ] Available from: https://doi.org/10.1007/3-540-45718-6_69
Artigo de periodico
Parallel range minima on coarse grained multicomputers (1999)
Mongelli, Henrique ; Song, Siang Wun
Fonte: International Journal of Foundations of Computer Science. 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
MONGELLI, Henrique e SONG, Siang Wun. Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, v. 10, n. 4, p. 375-389, 1999Tradução . . Disponível em: https://doi.org/10.1142/S0129054199000277. Acesso em: 09 nov. 2025.
APA
Mongelli, H., & Song, S. W. (1999). Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, 10( 4), 375-389. doi:10.1142/S0129054199000277
NLM
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1142/S0129054199000277
Vancouver
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1142/S0129054199000277

Unidades USP

ReP

Filtros

Autores

Agência de fomento

Afiliação dos autores externos não normalizada