Search

Motivation: Biological network comparison software largely relies on the concept of alignment where close matches between the nodes of two or more networks are sought. These node matches are based on sequence similarity and/or interaction patterns. However, because of the incomplete and error-prone datasets currently available, such methods have had limited success. Moreover, the results of network alignment are in general not amenable for distance-based evolutionary analysis of sets of networks. In this article, we describe Netdis, a topology-based distance measure between networks, which offers the possibility of network phylogeny reconstruction. Results: We first demonstrate that Netdis is able to correctly separate different random graph model types independent of network size and density. The biological applicability of the method is then shown by its ability to build the correct phylogenetic tree of species based solely on the topology of current protein interaction networks. Our results provide new evidence that the topology of protein interaction networks contains information about evolutionary processes, despite the lack of conservation of individual interactions. As Netdis is applicable to all networks because of its speed and simplicity, we apply it to a large collection of biological and non-biological networks where it clusters diverse networks by type. Availability and implementation: The source code of the program is freely available at http://www.stats.ox.ac.uk/research/proteins/resources. Contact: w.ali@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.

Motivation: Nowadays, publishers of scientific journals face the tough task of selecting high-quality articles that will attract as many readers as possible from a pool of articles. This is due to the growth of scientific output and literature. The possibility of a journal having a tool capable of predicting the citation count of an article within the first few years after publication would pave the way for new assessment systems. Results: This article presents a new approach based on building several prediction models for the Bioinformatics journal. These models predict the citation count of an article within 4 years after publication (global models). To build these models, tokens found in the abstracts of Bioinformatics papers have been used as predictive features, along with other features like the journal sections and 2-week post-publication periods. To improve the accuracy of the global models, specific models have been built for each Bioinformatics journal section (Data and Text Mining, Databases and Ontologies, Gene Expression, Genetics and Population Analysis, Genome Analysis, Phylogenetics, Sequence Analysis, Structural Bioinformatics and Systems Biology). In these new models, the average success rate for predictions using the naive Bayes and logistic regression supervised classification methods was 89.4% and 91.5%, respectively, within the nine sections and for 4-year time horizon. Availability: Supplementary material on this experimental survey is available at http://www.dia.fi.upm.es/~concha/bioinformatics.html Contact: aibanez@fi.upm.es

Motivation: Converting the vast quantity of free-format text found in journals into a concise, structured format makes the researcher's quest for information easier. Recently, several information extraction systems have been developed that attempt to simplify the retrieval and analysis of biological and medical data. Most of this work has used the abstract alone, owing to the convenience of access and the quality of data. Abstracts are generally available through central collections with easy direct access (e.g. PubMed). The full-text papers contain more information, but are distributed across many locations (e.g. publishers' web sites, journal web sites and local repositories), making access more difficult. In this paper, we present BioRAT, a new information extraction (IE) tool, specifically designed to perform biomedical IE, and which is able to locate and analyse both abstracts and full-length papers. BioRAT is a Biological Research Assistant for Text mining, and incorporates a document search ability with domain-specific IE. Results: We show first, that BioRAT performs as well as existing systems, when applied to abstracts; and second, that significantly more information is available to BioRAT through the full-length papers than via the abstracts alone. Typically, less than half of the available information is extracted from the abstract, with the majority coming from the body of each paper. Overall, BioRAT recalled 20.31% of the target facts from the abstracts with 55.07% precision, and achieved 43.6% recall with 51.25% precision on full-length papers. Availability: The software and documentation can be found at http://bioinf.cs.ucl.ac.uk/biorat

Over the last decade or so, there have been large numbers of methods published on approaches for normalization, variable (gene) selection, classification, and clustering of microarray data. As indicated in the scope document for Bioinformatics, this requires papers describing new methods for these problems to meet a very high standard, showing important improvement in results for real biological data, as well as novelty. In this editorial, we describe some standards that need to be met for papers in these areas to be seriously considered. We ask that prospective authors consider these points carefully before submission of their papers to Bioinformatics. The Role of Simulation. Simulation can be useful in investigating the properties of various methods of data analysis. Yet there are important barriers to credible use of simulation in microarray studies, largely due to what we don’t know about the statistical distribution of measured gene expression levels. First, the distribution across transcripts of true expression values is dependent on the biological state of the tissue or cell, and for a given state this is unknown, even in distributional form, and may further exhibit genespecific and platform-specific effects. Second, the correlation within biological replicates of true expression is unknown, and is likely unknowable in detail given that it is

We would like to thank K. Dobbin, J. Shih and R. Simon for their comments about Martin-Magniette et al. (2005). Their remarks relate to the design of microarray experiments and notably about the use of dye-swaps. We, however, want to make it clear that our manuscript primarily focuses on the detection, quantification and correction of the gene-specific dye-bias introduced in dual-color microarray experiments. The most important point in Martin-Magniette et al. (2005) is the following: by dint of studying technical errors, we will be able to identify and then to remove most of them. For the first time, in Martin-Magniette et al. (2005), we were able to quantify the genespecific dye bias by calculating the Labelling Bias Index, (LBI). The LBI measured on different array types shows that this artifact seems to be very low in some cases and could be thus neglected. However, it is high in other cases and it cannot thus be neglected for data issued from these array types. This measure is of crucial importance as it allows users to evaluate the impact of this bias on their data. Moreover, we think that each platform should at least know in what class it belongs for each array types. Although this artifact is not lowered nor understood, it is simply dangerous to underestimate it. The gene-specific dye bias is not an inevitability and can be well controlled, as we point out in our paper. Recently, in another paper, Dobbin et al. (2005) studied the genespecific dye bias. Although they reached the same conclusions, some of their remarks are explained in Martin-Magniette et al. (2005): e.g. Dobbin et al. (2005) have found that ‘(the gene-specific) dye bias appears to have masked the true differential expression’. This is explained in Martin-Magniette et al. (2005): the variance associated to a gene is overestimated by the dye bias effect in model (2) of Martin-Magniette et al. Dye-swaps constitute a simple and effective design to remove gene-specific dye bias when it is high. Nevertheless, we agree with Dobbin et al. (2005), that a balanced block design may be better than dye-swaps in some situations. As the former designs allow the use of more biological samples, the estimation of the biological variability will be more precise. Even if balanced block designs are statistically more efficient, the following considerations should be taken into account before choosing the experimental design

Motivation Our ability to identify causative genetic factors for mouse genetic models of human diseases and biomedical traits has been limited by the difficulties associated with identifying true causative factors, which are often obscured by the many false positive genetic associations produced by a GWAS. Results To accelerate the pace of genetic discovery, we developed a graph neural network (GNN)-based automated pipeline (GNNHap) that could rapidly analyze mouse genetic model data and identify high probability causal genetic factors for analyzed traits. After assessing the strength of allelic associations with the strain response pattern; this pipeline analyzes 29M published papers to assess candidate gene–phenotype relationships; and incorporates the information obtained from a protein–protein interaction network and protein sequence features into the analysis. The GNN model produces markedly improved results relative to that of a simple linear neural network. We demonstrate that GNNHap can identify novel causative genetic factors for murine models of diabetes/obesity and for cataract formation, which were validated by the phenotypes appearing in previously analyzed gene knockout mice. The diabetes/obesity results indicate how characterization of the underlying genetic architecture enables new therapies to be discovered and tested by applying ‘precision medicine’ principles to murine models. Availability and implementation The GNNHap source code is freely available at https://github.com/zqfang/gnnhap, and the new version of the HBCGM program is available at https://github.com/zqfang/haplomap. Supplementary information Supplementary data are available at Bioinformatics online.

Motivation A gradient boosting decision tree (GBDT) is a powerful ensemble machine-learning method that has the potential to accelerate biomarker discovery from high-dimensional molecular data. Recent algorithmic advances, such as extreme gradient boosting (XGB) and light gradient boosting (LGB), have rendered the GBDT training more efficient, scalable and accurate. However, these modern techniques have not yet been widely adopted in discovering biomarkers for censored survival outcomes, which are key clinical outcomes or endpoints in cancer studies. Results In this paper, we present a new R package ‘Xsurv’ as an integrated solution that applies two modern GBDT training frameworks namely, XGB and LGB, for the modeling of right-censored survival outcomes. Based on our simulations, we benchmark the new approaches against traditional methods including the stepwise Cox regression model and the original gradient boosting function implemented in the package ‘gbm’. We also demonstrate the application of Xsurv in analyzing a melanoma methylation dataset. Together, these results suggest that Xsurv is a useful and computationally viable tool for screening a large number of prognostic candidate biomarkers, which may facilitate future translational and clinical research. Availability and implementation ‘Xsurv’ is freely available as an R package at: https://github.com/topycyao/Xsurv. Supplementary information Supplementary data are available at Bioinformatics online.

Motivation Flow cytometry (FCM) and transcription profiling are the two widely used assays in translational immunology research. However, there is no data integration pipeline for analyzing these two types of assays together with experiment variables for biomarker inference. Current FCM data analysis mainly relies on subjective manual gating analysis, which is difficult to be directly integrated with other automated computational methods. Existing deconvolutional analysis of bulk transcriptomics relies on predefined marker genes in the transcriptomics data, which are unavailable for novel cell types and does not utilize the FCM data that provide canonical phenotypic definitions of the cell types. Results We developed a novel analytics pipeline—FastMix—for computational immunology, which integrates flow cytometry, bulk transcriptomics and clinical covariates for identifying cell type-specific gene expression signatures and biomarker genes. FastMix addresses the ‘large p, small n’ problem in the gene expression and flow cytometry integration analysis via a linear mixed effects model (LMER) for both cross-sectional and longitudinal studies. Its novel moment-based estimator not only reduces bias in parameter estimation but also is more efficient than iterative optimization. The FastMix pipeline also includes a cutting-edge flow cytometry data analysis method—DAFi—for identifying cell populations of interest and their characteristics. Simulation studies showed that FastMix produced smaller type I/II errors than competing methods. Validation using real data of two vaccine studies showed that FastMix identified a consistent set of signature genes as in independent single-cell RNA-seq analysis, producing additional interesting findings. Availability and implementation Source code of FastMix is publicly available at https://github.com/terrysun0302/FastMix. Supplementary information Supplementary data are available at Bioinformatics online.

Motivation Intercellular communication (i.e. cell–cell communication) plays an essential role in multicellular organisms coordinating various biological processes. Previous studies discovered that feedback loops between two cell types are a widespread and vital signaling motif regulating development, regeneration and cancer progression. While many computational methods have been developed to predict cell–cell communication based on gene expression datasets, these methods often predict one-directional ligand–receptor interactions from sender to receiver cells and are not suitable to identify feedback loops. Results Here, we describe ligand–receptor loop (LRLoop), a new method for analyzing cell–cell communication based on bi-directional ligand–receptor interactions, where two pairs of ligand–receptor interactions are identified that are responsive to each other and thereby form a closed feedback loop. We first assessed LRLoop using bulk datasets and found our method significantly reduces the false positive rate seen with existing methods. Furthermore, we developed a new strategy to assess the performance of these methods in single-cell datasets. We used the between-tissue interactions as an indicator of potential false-positive prediction and found that LRLoop produced a lower fraction of between-tissue interactions than traditional methods. Finally, we applied LRLoop to the single-cell datasets obtained from retinal development. We discovered many new bi-directional ligand–receptor interactions among individual cell types that potentially control proliferation, neurogenesis and/or cell fate specification. Availability and implementation An R package is available at https://github.com/Pinlyu3/LRLoop. The source code can be found at figshare (https://doi.org/10.6084/m9.figshare.20126138.v1). The datasets can be found at figshare (https://doi.org/10.6084/m9.figshare.20126021.v1). Supplementary information Supplementary data are available at Bioinformatics online.

Motivation In silico saturation mutagenesis (ISM) is a popular approach in computational genomics for calculating feature attributions on biological sequences that proceeds by systematically perturbing each position in a sequence and recording the difference in model output. However, this method can be slow because systematically perturbing each position requires performing a number of forward passes proportional to the length of the sequence being examined. Results In this work, we propose a modification of ISM that leverages the principles of compressed sensing to require only a constant number of forward passes, regardless of sequence length, when applied to models that contain operations with a limited receptive field, such as convolutions. Our method, named Yuzu, can reduce the time that ISM spends in convolution operations by several orders of magnitude and, consequently, Yuzu can speed up ISM on several commonly used architectures in genomics by over an order of magnitude. Notably, we found that Yuzu provides speedups that increase with the complexity of the convolution operation and the length of the sequence being analyzed, suggesting that Yuzu provides large benefits in realistic settings. Availability and implementation We have made this tool available at https://github.com/kundajelab/yuzu.