A Monte Carlo approach to measure the robustness of Boolean networks (2012)
- Authors:
- Autor USP: HASHIMOTO, RONALDO FUMIO - IME
- Unidade: IME
- DOI: 10.1145/2382936.2383062
- Subjects: ÁLGEBRAS DE BOOLE; BIOINFORMÁTICA; MATEMÁTICA DA COMPUTAÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: ACM International Conference on Bioinformatics, Computational Biology and Biomedicine - BCB' 12
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
LOUZADA, Vitor Hugo e LOPES, Fabrício M e HASHIMOTO, Ronaldo Fumio. A Monte Carlo approach to measure the robustness of Boolean networks. 2012, Anais.. New York: ACM, 2012. Disponível em: https://doi.org/10.1145/2382936.2383062. Acesso em: 12 fev. 2026. -
APA
Louzada, V. H., Lopes, F. M., & Hashimoto, R. F. (2012). A Monte Carlo approach to measure the robustness of Boolean networks. In Proceedings. New York: ACM. doi:10.1145/2382936.2383062 -
NLM
Louzada VH, Lopes FM, Hashimoto RF. A Monte Carlo approach to measure the robustness of Boolean networks [Internet]. Proceedings. 2012 ;[citado 2026 fev. 12 ] Available from: https://doi.org/10.1145/2382936.2383062 -
Vancouver
Louzada VH, Lopes FM, Hashimoto RF. A Monte Carlo approach to measure the robustness of Boolean networks [Internet]. Proceedings. 2012 ;[citado 2026 fev. 12 ] Available from: https://doi.org/10.1145/2382936.2383062 - 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 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
- Growing genetic regulatory networks from seed genes
- 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.1145/2382936.2383062 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
