Discriminating different classes of biological networks by analyzing the graphs spectra distribution (2012)
- Authors:
- USP affiliated authors: FERREIRA, CARLOS EDUARDO - IME ; FUJITA, ANDRÉ - IME
- Unidade: IME
- DOI: 10.1371/journal.pone.0049949
- Assunto: COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: San Francisco
- Date published: 2012
- Source:
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
TAKAHASHI, Daniel Yasumasa et al. Discriminating different classes of biological networks by analyzing the graphs spectra distribution. PLOS ONE, v. 7, n. 12, p. 1-12, 2012Tradução . . Disponível em: https://doi.org/10.1371/journal.pone.0049949. Acesso em: 14 fev. 2026. -
APA
Takahashi, D. Y., Sato, J. R., Ferreira, C. E., & Fujita, A. (2012). Discriminating different classes of biological networks by analyzing the graphs spectra distribution. PLOS ONE, 7( 12), 1-12. doi:10.1371/journal.pone.0049949 -
NLM
Takahashi DY, Sato JR, Ferreira CE, Fujita A. Discriminating different classes of biological networks by analyzing the graphs spectra distribution [Internet]. PLOS ONE. 2012 ; 7( 12): 1-12.[citado 2026 fev. 14 ] Available from: https://doi.org/10.1371/journal.pone.0049949 -
Vancouver
Takahashi DY, Sato JR, Ferreira CE, Fujita A. Discriminating different classes of biological networks by analyzing the graphs spectra distribution [Internet]. PLOS ONE. 2012 ; 7( 12): 1-12.[citado 2026 fev. 14 ] Available from: https://doi.org/10.1371/journal.pone.0049949 - Statistical methods in graphs: parameter estimation, model selection, and hypothesis test
- GEDI: a user-friendly toolbox for analysis of large-scale gene expression data
- Modeling gene expression regulatory networks with the sparse vector autoregressive model
- Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method
- The GATO gene annotation tool for research laboratories
- The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- Some formulations for the group Steiner tree problem
- Formulations and valid inequalities for the node capacitated graph partitioning problem
Informações sobre o DOI: 10.1371/journal.pone.0049949 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2396940.PDF | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
