
Chemical carcinogenicity is an important safety issue for the evaluation of drugs and environmental pollutants. The Ames test is useful for detecting genotoxic hepatocarcinogens. However, the assessment of Ames-negative hepatocarcinogens depends on 2-year rodent bioassays. Alternative methods are desirable for the efficient identification of Ames-negative hepatocarcinogens. This study proposed a decision tree-based method using chemical-chemical interaction information for predicting hepatocarcinogens. It performs much better than that using molecular descriptors with accuracies of 86% and 76% for validation and independent test, respectively. Four important interacting chemicals with interpretable decision rules were identified and analyzed. With the high prediction performances, the acquired decision rules based on chemical-chemical interactions provide a useful prediction method and better understanding of Ames-negative hepatocarcinogens.
In recent years, several methods for gene networks (GNs) inference from expression data have been developed. Also, models of data integration (as protein-protein and protein-DNA) are nowadays broadly used to face the problem of few amount of expression data. Moreover, it is well known that biological networks conserve some topological properties. The small-world topology is a common arrangement in nature found both in biological and non-biological phenomena. However, in general this information is not used by GNs inference methods. In this work we proposed a new GNs inference algorithm that combines topological features and expression data. The algorithm outperforms the approach that uses only expression data both in accuracy and measures of recovered network.
Membrane protein prediction is a significant classification problem, requiring the integration of data derived from different sources such as protein sequences, gene expression, protein interactions etc. A generalized probabilistic approach for combining different data sources via supervised selective kernel fusion was proposed in our previous papers. It includes, as particular cases, SVM, Lasso SVM, Elastic Net SVM and others. In this paper we apply a further instantiation of this approach, the Supervised Selective Support Kernel SVM and demonstrate that the proposed approach achieves the top-rank position among the selective kernel fusion variants on benchmark data for membrane protein prediction. The method differs from the previous approaches in that it naturally derives a subset of "support kernels" (analogous to support objects within SVMs), thereby allowing the memory-efficient exclusion of significant numbers of irrelevant kernel matrixes from a decision rule in a manner particularly suited to membrane protein prediction.
Reverse engineering of the Gene Regulatory Networks (GRNs) from high-throughput gene expression data is one of the most pressing challenges of computational biology. In this paper a method for parallelization of the Gene Regulatory Network inference algorithm, GENIE3, based on GPU by exploiting the compute unified device architecture (CUDA) programming model is designed and implemented. GENIE3 solves regulatory network prediction by developing tree based ensemble of Random forests. Our proposed method significantly improves the computational efficiency of GENIE3 by constructing the forest on the GPU in parallel. Our experiments on real and synthetic datasets show that, CUDA implementation outperforms sequential implementation by achieving a speed-up of 15 times (real data) and 14 to 18 times (synthetic data) respectively.
Most of the current practice of pattern matching tools is oriented towards finding efficient ways to compare sequences. This is useful but insufficient: as the knowledge and understanding of some functional or structural aspects of living systems improve, analysts in molecular biology progressively shift from mere classification tasks to modeling tasks. People need to be able to express global sequence architectures and check various hypotheses on the way their sequences are structured. It appears necessary to offer generic tools for this task, allowing to build more expressive models of biological sequence families, on the basis of their content and structure. This article introduces Logol, a new application designed to achieve pattern matching in possibly large sequences with customized biological patterns. Logol consists in both a language for describing patterns, and the associated parser for effective pattern search in sequences (RNA, DNA or protein) with such patterns. The Logol language, based on an high level grammatical formalism, allows to express flexible patterns (with mispairings and indels) composed of both sequential elements (such as motifs) and structural elements (such as repeats or pseudoknots). Its expressive power is presented through an application using the main components of the language : the identification of -1 programmed ribosomal frameshifting (PRF) events in messenger RNA sequences. Logol allows the design of sophisticated patterns, and their search in large nucleic or amino acid sequences. It is available on the GenOuest bioinformatics platform at http://logol.genouest.org. The core application is a command-line application, available for different operating systems. The Logol suite also includes interfaces, e.g. an interface for graphically drawing the pattern.