Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Adriano Velasque Werhli is active.

Publication


Featured researches published by Adriano Velasque Werhli.


Statistical Applications in Genetics and Molecular Biology | 2007

Reconstructing gene regulatory networks with bayesian networks by combining expression data with multiple sources of prior knowledge.

Adriano Velasque Werhli; Dirk Husmeier

There have been various attempts to reconstruct gene regulatory networks from microarray expression data in the past. However, owing to the limited amount of independent experimental conditions and noise inherent in the measurements, the results have been rather modest so far. For this reason it seems advisable to include biological prior knowledge, related, for instance, to transcription factor binding locations in promoter regions or partially known signalling pathways from the literature. In the present paper, we consider a Bayesian approach to systematically integrate expression data with multiple sources of prior knowledge. Each source is encoded via a separate energy function, from which a prior distribution over network structures in the form of a Gibbs distribution is constructed. The hyperparameters associated with the different sources of prior knowledge, which measure the influence of the respective prior relative to the data, are sampled from the posterior distribution with MCMC. We have evaluated the proposed scheme on the yeast cell cycle and the Raf signalling pathway. Our findings quantify to what extent the inclusion of independent prior knowledge improves the network reconstruction accuracy, and the values of the hyperparameters inferred with the proposed scheme were found to be close to optimal with respect to minimizing the reconstruction error.


Journal of Bioinformatics and Computational Biology | 2008

Gene regulatory network reconstruction by Bayesian integration of prior knowledge and/or different experimental conditions.

Adriano Velasque Werhli; Dirk Husmeier

There have been various attempts to improve the reconstruction of gene regulatory networks from microarray data by the systematic integration of biological prior knowledge. Our approach is based on pioneering work by Imoto et al. where the prior knowledge is expressed in terms of energy functions, from which a prior distribution over network structures is obtained in the form of a Gibbs distribution. The hyperparameters of this distribution represent the weights associated with the prior knowledge relative to the data. We have derived and tested a Markov chain Monte Carlo (MCMC) scheme for sampling networks and hyperparameters simultaneously from the posterior distribution, thereby automatically learning how to trade off information from the prior knowledge and the data. We have extended this approach to a Bayesian coupling scheme for learning gene regulatory networks from a combination of related data sets, which were obtained under different experimental conditions and are therefore potentially associated with different active subpathways. The proposed coupling scheme is a compromise between (1) learning networks from the different subsets separately, whereby no information between the different experiments is shared; and (2) learning networks from a monolithic fusion of the individual data sets, which does not provide any mechanism for uncovering differences between the network structures associated with the different experimental conditions. We have assessed the viability of all proposed methods on data related to the Raf signaling pathway, generated both synthetically and in cytometry experiments.


computational systems bioinformatics | 2007

Bayesian integration of biological prior knowledge into the reconstruction of gene regulatory networks with Bayesian networks.

Dirk Husmeier; Adriano Velasque Werhli

There have been various attempts to improve the reconstruction of gene regulatory networks from microarray data by the systematic integration of biological prior knowledge. Our approach is based on pioneering work by Imoto et al., where the prior knowledge is expressed in terms of energy functions, from which a prior distribution over network structures is obtained in the form of a Gibbs distribution. The hyperparameters of this distribution represent the weights associated with the prior knowledge relative to the data. To complement the work of Imoto et al., we have derived and tested an MCMC scheme for sampling networks and hyperparameters simultaneously from the posterior distribution. We have assessed the viability of this approach by reconstructing the RAF pathway from cytometry protein concentrations and prior knowledge from KEGG.


RSC Advances | 2016

Predicting the binding properties of single walled carbon nanotubes (SWCNT) with an ADP/ATP mitochondrial carrier using molecular docking, chemoinformatics, and nano-QSBR perturbation theory

Michael González-Durruthy; Adriano Velasque Werhli; Luisa Rodrigues Cornetet; Karina S. Machado; Humberto González-Díaz; Wilson Wasiliesky; Caroline Pires Ruas; Marcos A. Gelesky; José M. Monserrat

Interactions between the single walled carbon nanotube (SWCNT) family and a mitochondrial ADP/ATP carrier (ANT-1) were evaluated using constitutional (functional groups, number of carbon atoms, etc.) and electronic nanodescriptors defined by (n, m)-Hamada indexes (armchair, zig-zag and chiral). The Free Energy of Binding (FEB) was determined by molecular docking simulation and the results showed that FEB was statistically more negative (p SWCNT-OH > SWCNT, suggesting that polar groups favor the anchorage to ANT-1. In this regard, it was showed that key ANT-1 amino acids (Arg 79, Asn 87, Lys 91, Arg 187, Arg 234 and Arg 279) responsible for ADP-transport were conserved in ANT-1 from different species examined to predict SWCNT interactions, including shrimp Litopenaeus vannamei and fish Danio rerio commonly employed in ecotoxicology. The SWCNT-ANT-1 inter-atomic distances for the key ANT-1 amino acids were similar to that with carboxyatractyloside, a classical inhibitor of ANT-1. Significant linear relationships between FEB and n-Hamada index were found for zig-zag SWCNT and SWCNT-COOH (R2 = 0.95 in both cases). A Perturbation Theory-Nano-Quantitative Structure-Binding Relationship (PT-NQSBR) model was fitted that was able to distinguish between strong (FEB < −14.7 kcal mol−1) and weak (FEB ≥ −14.7 kcal mol−1) SWCNT–ANT-1 interactions. A simple ANT-1-inhibition respiratory assay employing mitochondria suspension from L. vannamei, showed good accordance with the predicted model. These results indicate that this methodology can be employed in massive virtual screenings and used for making regulatory decisions in nanotoxicology.


BMC Genomics | 2012

Comparing the reconstruction of regulatory pathways with distinct Bayesian networks inference methods

Adriano Velasque Werhli

BackgroundInference of biological networks has become an important tool in Systems Biology. Nowadays it is becoming clearer that the complexity of organisms is more related with the organization of its components in networks rather than with the individual behaviour of the components. Among various approaches for inferring networks, Bayesian Networks are very attractive due to their probabilistic nature and flexibility to incorporate interventions and extra sources of information. Recently various attempts to infer networks with different Bayesian Networks approaches were pursued. The specific interest in this paper is to compare the performance of three different inference approaches: Bayesian Networks without any modification; Bayesian Networks modified to take into account specific interventions produced during data collection; and a probabilistic hierarchical model that allows the inclusion of extra knowledge in the inference of Bayesian Networks. The inference is performed in three different types of data: (i) synthetic data obtained from a Gaussian distribution, (ii) synthetic data simulated with Netbuilder and (iii) Real data obtained in flow cytometry experiments.ResultsBayesian Networks with interventions and Bayesian Networks with inclusion of extra knowledge outperform simple Bayesian Networks in all data sets when considering the reconstruction accuracy and taking the edge directions into account. In the Real data the increase in accuracy is also observed when not taking the edge directions into account.ConclusionsAlthough it comes with a small extra computational cost the use of more refined Bayesian network models is justified. Both the inclusion of extra knowledge and the use of interventions have outperformed the simple Bayesian network model in simulated and Real data sets. Also, if the source of extra knowledge used in the inference is not reliable the inferred network is not deteriorated. If the extra knowledge has a good agreement with the data there is no significant difference in using the Bayesian networks with interventions or Bayesian networks with the extra knowledge.


BMC Bioinformatics | 2015

Inference of regulatory networks with a convergence improved MCMC sampler

Nilzair Agostinho; Karina S. Machado; Adriano Velasque Werhli

BackgroundOne of the goals of the Systems Biology community is to have a detailed map of all biological interactions in an organism. One small yet important step in this direction is the creation of biological networks from post-genomic data. Bayesian networks are a very promising model for the inference of regulatory networks in Systems Biology. Usually, Bayesian networks are sampled with a Markov Chain Monte Carlo (MCMC) sampler in the structure space. Unfortunately, conventional MCMC sampling schemes are often slow in mixing and convergence. To improve MCMC convergence, an alternative method is proposed and tested with different sets of data. Moreover, the proposed method is compared with the traditional MCMC sampling scheme.ResultsIn the proposed method, a simpler and faster method for the inference of regulatory networks, Graphical Gaussian Models (GGMs), is integrated into the Bayesian network inference, trough a Hierarchical Bayesian model. In this manner, information about the structure obtained from the data with GGMs is taken into account in the MCMC scheme, thus improving mixing and convergence. The proposed method is tested with three types of data, two from simulated models and one from real data. The results are compared with the results of the traditional MCMC sampling scheme in terms of network recovery accuracy and convergence. The results show that when compared with a traditional MCMC scheme, the proposed method presents improved convergence leading to better network reconstruction with less MCMC iterations.ConclusionsThe proposed method is a viable alternative to improve mixing and convergence of traditional MCMC schemes. It allows the use of Bayesian networks with an MCMC sampler with less iterations. The proposed method has always converged earlier than the traditional MCMC scheme. We observe an improvement in accuracy of the recovered networks for the Gaussian simulated data, but this improvement is absent for both real data and data simulated from ODE.


multi agent systems and agent based simulation | 2013

Multi-Agent-Based Simulation of Mycobacterium Tuberculosis Growth

Pablo Werlang; Michel Q. Fagundes; Diana Francisca Adamatti; Karina S. Machado; Andrea von Groll; Pedro Eduardo Almeida da Silva; Adriano Velasque Werhli

Tuberculosis is an infectious disease that still causes many deaths around the world nowadays. It is caused by the M. tuberculosis bacillus. The study of the growth curve of this infectious organism is relevant as it has wide applications in tuberculosis research. In this work a Multi-Agent-Based Simulation is proposed to pursue the reproduction in silico of the observed in vitro M. tuberculosis growth curves. Simulation results are qualitatively compared with growth curves obtained in vitro with a recent proposed methodology. The results are promising and indicate that the chosen simulation methodology has the potential to serve as a platform for testing different bacterial growing behaviour as well as bacteria growth under different conditions.


Scientific Reports | 2017

Decrypting Strong and Weak Single-Walled Carbon Nanotubes Interactions with Mitochondrial Voltage-Dependent Anion Channels Using Molecular Docking and Perturbation Theory

Michael González-Durruthy; Adriano Velasque Werhli; Vinicius Seus; Karina S. Machado; Alejandro Pazos; Cristian R. Munteanu; Humberto González-Díaz; José M. Monserrat

The current molecular docking study provided the Free Energy of Binding (FEB) for the interaction (nanotoxicity) between VDAC mitochondrial channels of three species (VDAC1-Mus musculus, VDAC1-Homo sapiens, VDAC2-Danio rerio) with SWCNT-H, SWCNT-OH, SWCNT-COOH carbon nanotubes. The general results showed that the FEB values were statistically more negative (p < 0.05) in the following order: (SWCNT-VDAC2-Danio rerio) > (SWCNT-VDAC1-Mus musculus) > (SWCNT-VDAC1-Homo sapiens) > (ATP-VDAC). More negative FEB values for SWCNT-COOH and OH were found in VDAC2-Danio rerio when compared with VDAC1-Mus musculus and VDAC1-Homo sapiens (p < 0.05). In addition, a significant correlation (0.66 > r2 > 0.97) was observed between n-Hamada index and VDAC nanotoxicity (or FEB) for the zigzag topologies of SWCNT-COOH and SWCNT-OH. Predictive Nanoparticles-Quantitative-Structure Binding-Relationship models (nano-QSBR) for strong and weak SWCNT-VDAC docking interactions were performed using Perturbation Theory, regression and classification models. Thus, 405 SWCNT-VDAC interactions were predicted using a nano-PT-QSBR classifications model with high accuracy, specificity, and sensitivity (73–98%) in training and validation series, and a maximum AUROC value of 0.978. In addition, the best regression model was obtained with Random Forest (R2 of 0.833, RMSE of 0.0844), suggesting an excellent potential to predict SWCNT-VDAC channel nanotoxicity. All study data are available at https://doi.org/10.6084/m9.figshare.4802320.v2.


acm symposium on applied computing | 2016

A framework for virtual screening

Vinicius Rosa Seus; Lande Silva; J. B. V. Gomes; Pedro Eduardo Almeida da Silva; Adriano Velasque Werhli; Karina S. Machado

Recent advances in Bioinformatics and in Computer simulation and modelling have positively impacted the drug discovery process by turning viable the rational drug design (RDD). One of the major challenges in RDD is the understanding about protein-ligand interaction simulated at the atomic level by molecular docking algorithms. Virtual screening (VS) is defined as a computational approach applied to the analyses of large libraries of chemical structures in order to identify possible drug candidates to a target. The major challenge of VS based on molecular docking is the time required to run each experiment and the countless parameters and characteristics that should be defined by the researcher such as: the target(s) receptor, one or a set of ligands, the receptor binding site and so on. In order to perform more realistic docking simulations it is also necessary to account for the receptor and ligand flexibility. Therefore, this paper presents a framework for VS, where the user configure an experiment in a Web based platform informing the path of input and output files as well as the size, center and variation of the binding site(s). Then, the proposed framework generates a Python script that performs the VS experiment on the users personal computer. We expect that researchers from diverse backgrounds as Biology, Physics, Pharmacy, etc. can easily prepare VS experiments without the necessity of learning how to write scripts. To validate our proposed framework we performed five different case studies considering the AcrB protein as target receptor. All the case studies were easily realized using the proposed framework. The results show that the framework is effective to configure the VS experiments with different characteristics. Besides, the experiments can help on the search for new drug candidates for this important target.


brazilian symposium on bioinformatics | 2013

Inference of Genetic Regulatory Networks Using an Estimation of Distribution Algorithm

Thyago Salvá; Leonardo R. Emmendorfer; Adriano Velasque Werhli

Inference of Genetic Regulatory Networks from sparse and noisy expression data is still a challenge nowadays. In this work we use an Estimation of Distribution Algorithm to infer Genetic Regulatory Networks. In order to evaluate the algorithm we apply it to three types of data: (i) data simulated from a multivariate Gaussian distribution, (ii) data simulated from a realistic simulator, GeneNetWeaver and (iii) data from flow cytometry experiments. The proposed inference method shows a performance comparable with traditional inference algorithms in terms of the network reconstruction accuracy.

Collaboration


Dive into the Adriano Velasque Werhli's collaboration.

Top Co-Authors

Avatar

Karina S. Machado

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Marco Grzegorczyk

Technical University of Dortmund

View shared research outputs
Top Co-Authors

Avatar

Diana Francisca Adamatti

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

Andrea von Groll

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

Pedro Eduardo Almeida da Silva

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

Albano Oliveira de Borba

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

José M. Monserrat

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

Marcilene Fonseca de Moraes

Universidade Federal do Rio Grande do Sul

View shared research outputs
Top Co-Authors

Avatar

Michael González-Durruthy

Universidade Federal do Rio Grande do Sul

View shared research outputs
Researchain Logo
Decentralizing Knowledge