Growing genetic regulatory networks from seed genes (2004)
- Authors:
- Autor USP: HASHIMOTO, RONALDO FUMIO - IME
- Unidade: IME
- DOI: 10.1093/bioinformatics/bth074
- Subjects: BIOINFORMÁTICA; COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Source:
- Título: Bioinformatics
- ISSN: 1367-4803
- Volume/Número/Paginação/Ano: v. 20, n. 8, p. 1241-1247, 2004
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
HASHIMOTO, Ronaldo Fumio et al. Growing genetic regulatory networks from seed genes. Bioinformatics, v. 20, n. 8, p. 1241-1247, 2004Tradução . . Disponível em: https://doi.org/10.1093/bioinformatics/bth074. Acesso em: 12 fev. 2026. -
APA
Hashimoto, R. F., Kim, S., Shumulevich, I., Zhang, W., Bittner, M. L., & Dougherty, E. R. (2004). Growing genetic regulatory networks from seed genes. Bioinformatics, 20( 8), 1241-1247. doi:10.1093/bioinformatics/bth074 -
NLM
Hashimoto RF, Kim S, Shumulevich I, Zhang W, Bittner ML, Dougherty ER. Growing genetic regulatory networks from seed genes [Internet]. Bioinformatics. 2004 ; 20( 8): 1241-1247.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1093/bioinformatics/bth074 -
Vancouver
Hashimoto RF, Kim S, Shumulevich I, Zhang W, Bittner ML, Dougherty ER. Growing genetic regulatory networks from seed genes [Internet]. Bioinformatics. 2004 ; 20( 8): 1241-1247.[citado 2026 fev. 12 ] Available from: https://doi.org/10.1093/bioinformatics/bth074 - Pattern recognition based on straight line segments
- Growing seed genes from time series data and thresholded Boolean networks with perturbation
- Segmentation of retinal blood vessels based on ultimate elongation opening
- A Monte Carlo approach to measure the robustness of Boolean networks
- A new training algorithm for pattern recognition technique based on straight line segments
- An approach to growth delimitation of straight line segment classifiers based on a minimum bounding box
- Is cross-validation better than resubstitution for ranking genes?
- Inference of restricted stochastic Boolean GRN' s by Bayesian error and entropy based criteria
- Circuitos e caminhos pares/impares em grafos e digrafos - algoritmo e complexidade computacional
- Efficient incremental computation of attributes based on locally countable patterns in component trees
Informações sobre o DOI: 10.1093/bioinformatics/bth074 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
