A parallel solution to infer genetic network architectures in gene expression analysis (2003)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1177/1094342003017002006
- Assunto: ALGORITMOS GENÉTICOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: International Journal of High Performance Computing Applications
- ISSN: 1094-3420
- Volume/Número/Paginação/Ano: v. 17, n. 2, p. 163-172, 2003
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
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: 27 abr. 2024. -
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 2024 abr. 27 ] 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 2024 abr. 27 ] Available from: https://doi.org/10.1177/1094342003017002006 - Comprehensive evaluation of a two dimensional configurable array
- Towards a simple construction method for hamiltonian decomposition of the hypercube
- Reconhecimento de linguagens regulares por standard cells
- Paralelizacao de lacos encaixados pela tecnica de encolhimento de ciclos
- Revisiting cycle shrinking
- Randomized parallel list ranking for distributed memory multiprocessors
- A BSP/CGM algorithm for the all-substrings longest common subsequence problem
- 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
Informações sobre o DOI: 10.1177/1094342003017002006 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
