Search

Author summary Conferences are great venues for disseminating algorithmic bioinformatics results, but they unfortunately do not offer an opportunity to make major revisions in the way that journals do. As a result, it is not possible for authors to fix mistakes that might be easily correctable but nevertheless can cause the paper to be rejected. As a reviewer, I wish that I had the opportunity to tell the authors, “Hey, you forgot to do this really important thing, without which it is hard to accept the paper, but if you could go back and fix it, you might have a great paper for the conference.” This lack of a back and forth can be especially problematic for first-time submitters or those from outside the field, e.g., biologists. In this article, I outline Ten Simple Rules to follow when writing an algorithmic bioinformatics conference paper to avoid having it rejected.

“There is no problem that a library card can't solve” according to author Eleanor Brown [1]. This advice is sound, probably for both life and science, but even the best tool (like the library) is most effective when accompanied by instructions and a basic understanding of how and when to use it. For many budding scientists, the first day in a new lab setting often involves a stack of papers, an email full of links to pertinent articles, or some promise of a richer understanding so long as one reads enough of the scientific literature. However, the purpose and approach to reading a scientific article is unlike that of reading a news story, novel, or even a textbook and can initially seem unapproachable. Having good habits for reading scientific literature is key to setting oneself up for success, identifying new research questions, and filling in the gaps in one’s current understanding; developing these good habits is the first crucial step. Advice typically centers around two main tips: read actively and read often. However, active reading, or reading with an intent to understand, is both a learned skill and a level of effort. Although there is no one best way to do this, we present 10 simple rules, relevant to novices and seasoned scientists alike, to teach our strategy for active reading based on our experience as readers and as mentors of undergraduate and graduate researchers, medical students, fellows, and early career faculty. Rules 1–5 are big picture recommendations. Rules 6–8 relate to philosophy of reading. Rules 9–10 guide the “now what?” questions one should ask after reading and how to integrate what was learned into one’s own science.

Science is increasingly done in large teams, making it more likely that papers will be written by several authors from different institutes, disciplines, and cultural backgrounds. A small number of “Ten simple rules” papers have been written on collaboration and on writing but not on combining the two. Collaborative writing with multiple authors has additional challenges, including varied levels of engagement of coauthors, provision of fair credit through authorship or acknowledgements, acceptance of a diversity of work styles, and the need for clear communication. Miscommunication, a lack of leadership, and inappropriate tools or writing approaches can lead to frustration, delay of publication, or even the termination of a project. To provide insight into collaborative writing, we use our experience from the Global Lake Ecological Observatory Network (GLEON) to frame 10 simple rules for collaboratively writing a multi-authored paper. We consider a collaborative multi-authored paper to have three or more people from at least two different institutions. A multi-authored paper can be a result of a single discrete research project or the outcome of a larger research program that includes other papers based on common data or methods. The writing of a multi-authored paper is embedded within a broader context of planning and collaboration among team members. Our recommended rules include elements of both the planning and writing of a paper, and they can be iterative, although we have listed them in numerical order. It will help to revisit the rules frequently throughout the writing process. With the 10 rules outlined below, we aim to provide a foundation for writing multi-authored papers and conducting exciting and influential science.

Papers describing software are an important part of computational fields of scientific research. These “software papers” are unique in a number of ways, and they require special consideration to improve their impact on the scientific community and their efficacy at conveying important information. Here, we discuss 10 specific rules for writing software papers, covering some of the different scenarios and publication types that might be encountered, and important questions from which all computational researchers would benefit by asking along the way., Author summary Computational researchers have a responsibility to ensure that the software they write stands up to the same scientific scrutiny as traditional research studies. These 10 simple rules make doing so easier by enhancing usability, reproducibility, transparency, and other crucial characteristics that aren’t taught in most computer science or research methods curricula.

Recurrent neural networks with memory and attention mechanisms are widely used in natural language processing because they can capture short and long term sequential information for diverse tasks. We propose an integrated deep learning model for microbial DNA sequence data, which exploits convolutional neural networks, recurrent neural networks, and attention mechanisms to predict taxonomic classifications and sample-associated attributes, such as the relationship between the microbiome and host phenotype, on the read/sequence level. In this paper, we develop this novel deep learning approach and evaluate its application to amplicon sequences. We apply our approach to short DNA reads and full sequences of 16S ribosomal RNA (rRNA) marker genes, which identify the heterogeneity of a microbial community sample. We demonstrate that our implementation of a novel attention-based deep network architecture, Read2Pheno, achieves read-level phenotypic prediction. Training Read2Pheno models will encode sequences (reads) into dense, meaningful representations: learned embedded vectors output from the intermediate layer of the network model, which can provide biological insight when visualized. The attention layer of Read2Pheno models can also automatically identify nucleotide regions in reads/sequences which are particularly informative for classification. As such, this novel approach can avoid pre/post-processing and manual interpretation required with conventional approaches to microbiome sequence classification. We further show, as proof-of-concept, that aggregating read-level information can robustly predict microbial community properties, host phenotype, and taxonomic classification, with performance at least comparable to conventional approaches. An implementation of the attention-based deep learning network is available at https://github.com/EESI/sequence_attention (a python package) and https://github.com/EESI/seq2att (a command line tool)., Author summary Microbiomes are communities of microscopic organisms found everywhere, including on and in the human body. For example, the gut microbiome plays an important role in digestion, and changes in composition are associated with changes in health or disease, e.g., inflammatory bowel disease (IBD). Today, microbiome composition is often obtained from high-throughput sequencing, which generates many short DNA reads from multiple organisms in a sample. In this paper, we present a novel deep learning framework, Read2Pheno, to predict phenotype from all the reads in a set of biological samples. An attention mechanism allows visualization of specific subregions (sets of bases) which are important in classifying the reads according to phenotype or taxon labels. We evaluate the framework on sequencing data for 16S rRNA genes, genetic markers used to identify microbial taxonomy. We show that Read2Pheno performs comparably as conventional methods on three distinct data sets from the American Gut Project, IBD patients and controls, and a comprehensive taxonomic database. Moreover, Read2Pheno results can be readily interpreted—e.g., to identify regions of the 16S rRNA gene to target for PCR diagnostics—without additional pre/post-processing steps that can introduce complexity and error.

Mathematical models are powerful tools in HIV epidemiology, producing quantitative projections of key indicators such as HIV incidence and prevalence. In order to improve the accuracy of predictions, such models need to incorporate a number of behavioural and biological heterogeneities, especially those related to the sexual network within which HIV transmission occurs. An individual-based model, which explicitly models sexual partnerships, is thus often the most natural type of model to choose. In this paper we present PopART-IBM, a computationally efficient individual-based model capable of simulating 50 years of an HIV epidemic in a large, high-prevalence community in under a minute. We show how the model calibrates within a Bayesian inference framework to detailed age- and sex-stratified data from multiple sources on HIV prevalence, awareness of HIV status, ART status, and viral suppression for an HPTN 071 (PopART) study community in Zambia, and present future projections of HIV prevalence and incidence for this community in the absence of trial intervention., Author summary In this paper we present PopART-IBM, an individual-based model used to simulate HIV transmission in communities in high prevalence settings. We show that PopART-IBM can simulate transmission over a span of decades in a large community in less than a minute. This computational efficiency allows us to calibrate the model within an inference framework, and we show an illustrative example of calibration using an adaptive population Monte Carlo Approximate Bayesian Computation algorithm for a community in Zambia that was part of the HPTN-071 (PopART) trial. We compare the detailed model output to real-world data collected during the trial from this community. Finally, we project how the HIV epidemic would have changed over time in this community if no intervention from the trial had occurred.

The spread of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) virus poses serious threats to the global public health and leads to worldwide crisis. No effective drug or vaccine is readily available. The viral RNA-dependent RNA polymerase (RdRp) is a promising therapeutic target. A hybrid drug screening procedure was proposed and applied to identify potential drug candidates targeting RdRp from 1906 approved drugs. Among the four selected market available drug candidates, Pralatrexate and Azithromycin were confirmed to effectively inhibit SARS-CoV-2 replication in vitro with EC50 values of 0.008μM and 9.453 μM, respectively. For the first time, our study discovered that Pralatrexate is able to potently inhibit SARS-CoV-2 replication with a stronger inhibitory activity than Remdesivir within the same experimental conditions. The paper demonstrates the feasibility of fast and accurate anti-viral drug screening for inhibitors of SARS-CoV-2 and provides potential therapeutic agents against COVID-19., Author summary Currently, a novel coronavirus called SARS-COV-2 is spreading across many parts of the world. Unfortunately, there is still a lack of effective drugs against the virus. Additionally, it usually takes much longer time to develop a new drug using traditional methods. Thus, it is now better to rely on some alternative methods to develop drugs that can treat such a disease effectively. In this paper, we have proposed a deep learning and molecular dynamics simulation based hybrid drug screening procedure for identifying potential drug candidates targeting RdRp from 1906 market available drugs. Our screening have successfully identified a FDA-approved drug called Pralatrexate that strongly inhibits the replication of 2019-nCoV in vitro with EC50 values of 0.008μM. This work demonstrated the feasibility of accurate virtual drug screening for inhibitors of SARS-CoV-2 and provides potential therapeutic agents against COVID-19.

Identification of mutations of the genes that give cancer a selective advantage is an important step towards research and clinical objectives. As such, there has been a growing interest in developing methods for identification of driver genes and their temporal order within a single patient (intra-tumor) as well as across a cohort of patients (inter-tumor). In this paper, we develop a probabilistic model for tumor progression, in which the driver genes are clustered into several ordered driver pathways. We develop an efficient inference algorithm that exhibits favorable scalability to the number of genes and samples compared to a previously introduced ILP-based method. Adopting a probabilistic approach also allows principled approaches to model selection and uncertainty quantification. Using a large set of experiments on synthetic datasets, we demonstrate our superior performance compared to the ILP-based method. We also analyze two biological datasets of colorectal and glioblastoma cancers. We emphasize that while the ILP-based method puts many seemingly passenger genes in the driver pathways, our algorithm keeps focused on truly driver genes and outputs more accurate models for cancer progression., Author summary Cancer is a disease caused by the accumulation of somatic mutations in the genome. This process is mainly driven by mutations in certain genes that give the harboring cells some selective advantage. The rather few driver genes are usually masked amongst an abundance of so-called passenger mutations. Identification of the driver genes and the temporal order in which the mutations occur is of great importance towards research and clinical objectives. In this paper, we introduce a probabilistic model for cancer progression and devise an efficient inference algorithm to train the model. We show that our method scales favorably to large datasets and provides superior performance compared to an ILP-based counterpart on a wide set of synthetic data simulations. Our Bayesian approach also allows for systematic model selection and confidence quantification procedures in contrast to the previous non-probabilistic progression models. We also study two large datasets on colorectal and glioblastoma cancers and validate our inferred model in comparison to the ILP-based method.

Locusts are short horned grasshoppers that exhibit two behaviour types depending on their local population density. These are: solitarious, where they will actively avoid other locusts, and gregarious where they will seek them out. It is in this gregarious state that locusts can form massive and destructive flying swarms or plagues. However, these swarms are usually preceded by the aggregation of juvenile wingless locust nymphs. In this paper we attempt to understand how the distribution of food resources affect the group formation process. We do this by introducing a multi-population partial differential equation model that includes non-local locust interactions, local locust and food interactions, and gregarisation. Our results suggest that, food acts to increase the maximum density of locust groups, lowers the percentage of the population that needs to be gregarious for group formation, and decreases both the required density of locusts and time for group formation around an optimal food width. Finally, by looking at foraging efficiency within the numerical experiments we find that there exists a foraging advantage to being gregarious., Author summary Locusts are short horned grass hoppers that live in two diametrically opposed behavioural states. In the first, solitarious, they will actively avoid other locusts, whereas the second, gregarious, they will actively seek them out. It is in this gregarious state that locusts form the recognisable and destructive flying adult swarms. However, prior to swarm formation juvenile flightless locusts will form marching hopper bands and make their way from food source to food source. Predicting where these hopper bands might form is key to controlling locust outbreaks. Research has shown that changes in food distributions can affect the transition from solitarious to gregarious. In this paper we construct a mathematical model of locust-locust and locust-food interactions to investigate how food distributions affect the aggregation of juvenile locusts, termed groups, an important precursor to hopper bands. Our findings suggest that there is an optimal food distribution for group formation and that being gregarious increases a locusts ability to forage when food becomes more patchy.

Stochastic models of biomolecular reaction networks are commonly employed in systems and synthetic biology to study the effects of stochastic fluctuations emanating from reactions involving species with low copy-numbers. For such models, the Kolmogorov’s forward equation is called the chemical master equation (CME), and it is a fundamental system of linear ordinary differential equations (ODEs) that describes the evolution of the probability distribution of the random state-vector representing the copy-numbers of all the reacting species. The size of this system is given by the number of states that are accessible by the chemical system, and for most examples of interest this number is either very large or infinite. Moreover, approximations that reduce the size of the system by retaining only a finite number of important chemical states (e.g. those with non-negligible probability) result in high-dimensional ODE systems, even when the number of reacting species is small. Consequently, accurate numerical solution of the CME is very challenging, despite the linear nature of the underlying ODEs. One often resorts to estimating the solutions via computationally intensive stochastic simulations. The goal of the present paper is to develop a novel deep-learning approach for computing solution statistics of high-dimensional CMEs by reformulating the stochastic dynamics using Kolmogorov’s backward equation. The proposed method leverages superior approximation properties of Deep Neural Networks (DNNs) to reliably estimate expectations under the CME solution for several user-defined functions of the state-vector. This method is algorithmically based on reinforcement learning and it only requires a moderate number of stochastic simulations (in comparison to typical simulation-based approaches) to train the “policy function”. This allows not just the numerical approximation of various expectations for the CME solution but also of its sensitivities with respect to all the reaction network parameters (e.g. rate constants). We provide four examples to illustrate our methodology and provide several directions for future research., Author summary We develop a deep learning framework for estimating solutions of the chemical master equation (CME) that is fundamental to stochastic analysis of reaction networks. The CME is a system of ordinary differential equations that describes the time-evolution of the probability density of the random state-vector, and owing to an inherent curse of dimensionality, directly solving the CME is generally impractical with existing approaches. Moreover, the commonly employed simulation-based approaches for estimating CME solutions often require an exorbitant amount of computational time, even for moderately-sized networks. To counter these issues, we develop a deep reinforcement learning based method, called DeepCME, in this paper. DeepCME not only estimates function expectations based on the CME solution, but it also solves the more challenging problem of estimating their sensitivities with respect to all the model parameters. We illustrate our approach with four carefully chosen reaction network examples with varying sizes. Our results demonstrate that DeepCME reliably estimates the expectations of interest, along with all the parametric sensitivities, at a fraction of the computational cost of simulation-based estimators. We present many directions for future research and suggest further improvements to DeepCME that can greatly enhance its accuracy and applicability.

This paper describes a data-driven simulation study that explores the relative impact of several low-cost and practical non-pharmaceutical interventions on the spread of COVID-19 in an outpatient hospital dialysis unit. The interventions considered include: (i) voluntary self-isolation of healthcare personnel (HCPs) with symptoms; (ii) a program of active syndromic surveillance and compulsory isolation of HCPs; (iii) the use of masks or respirators by patients and HCPs; (iv) improved social distancing among HCPs; (v) increased physical separation of dialysis stations; and (vi) patient isolation combined with preemptive isolation of exposed HCPs. Our simulations show that under conditions that existed prior to the COVID-19 outbreak, extremely high rates of COVID-19 infection can result in a dialysis unit. In simulations under worst-case modeling assumptions, a combination of relatively inexpensive interventions such as requiring surgical masks for everyone, encouraging social distancing between healthcare professionals (HCPs), slightly increasing the physical distance between dialysis stations, and—once the first symptomatic patient is detected—isolating that patient, replacing the HCP having had the most exposure to that patient, and relatively short-term use of N95 respirators by other HCPs can lead to a substantial reduction in both the attack rate and the likelihood of any spread beyond patient zero. For example, in a scenario with R0 = 3.0, 60% presymptomatic viral shedding, and a dialysis patient being the infection source, the attack rate falls from 87.8% at baseline to 34.6% with this intervention bundle. Furthermore, the likelihood of having no additional infections increases from 6.2% at baseline to 32.4% with this intervention bundle., Author summary As we write this, the COVID-19 pandemic has essentially taken over the world, with more than 20 million cases spread over 216 countries. A big concern for policy makers all across the world has been the impact of COVID-19 on healthcare systems and whether these systems can cope with the enormous strain placed on them by COVID-19. In this paper, we consider the spread of COVID-19 in a specific healthcare setting: the outpatient dialysis unit. Hemodialysis patients are extremely vulnerable to infections in large part due to multiple immune-system deficiencies associated with renal failure and hemodialysis. Hemodialysis facilities also increase the risk of COVID-19 transmission because each patient is in frequent, close contact with other patients and healthcare personnel. Thus, a dialysis unit can be seen as a microcosm for the worst-case impacts of COVID-19 in a healthcare setting. In this manuscript, we show via high-fidelity modeling and simulations that under pessimistic modeling assumptions, there is a combination of relatively simple, inexpensive, and practical non-pharmaceutical interventions that can substantially lower the impact of COVID-19 in the dialysis unit. Our simulations are based on fine-grained healthcare personnel movement data that we make available for other modelers to use.

Computational drug repositioning and drug-target prediction have become essential tasks in the early stage of drug discovery. In previous studies, these two tasks have often been considered separately. However, the entities studied in these two tasks (i.e., drugs, targets, and diseases) are inherently related. On one hand, drugs interact with targets in cells to modulate target activities, which in turn alter biological pathways to promote healthy functions and to treat diseases. On the other hand, both drug repositioning and drug-target prediction involve the same drug feature space, which naturally connects these two problems and the two domains (diseases and targets). By using the wisdom of the crowds, it is possible to transfer knowledge from one of the domains to the other. The existence of relationships among drug-target-disease motivates us to jointly consider drug repositioning and drug-target prediction in drug discovery. In this paper, we present a novel approach called iDrug, which seamlessly integrates drug repositioning and drug-target prediction into one coherent model via cross-network embedding. In particular, we provide a principled way to transfer knowledge from these two domains and to enhance prediction performance for both tasks. Using real-world datasets, we demonstrate that iDrug achieves superior performance on both learning tasks compared to several state-of-the-art approaches. Our code and datasets are available at: https://github.com/Case-esaC/iDrug., Author summary Traditional high-throughput techniques for drug discovery are often expensive, time-consuming, and with high failure rates. Computational drug repositioning and drug-target prediction have thus become essential tasks in the early stage drug discovery. The emergence of large-scale heterogeneous biological networks has offered unprecedented opportunities for developing machine learning approaches to identify novel drug-disease or drug-target interactions. However, most existing works focused either on the drug-disease network or on the drug-target network, thus failed to capture the inherent dependencies between these two networks. These two biological networks are naturally connected since they involve the same drug feature space. In our opinion, ignoring this rich source of information is a major shortcoming of some existing works. In this paper, we present a novel approach called iDrug, which seamlessly integrates the drug-disease network and the drug-target network into one coherent model via cross-network embedding. As a result, iDrug is able to take full usage of the knowledge within these two biological networks to better exploit new biomedical insights of drug-target-disease. Therefore, iDrug has broad applications in drug discovery.

Interactive data visualization is imperative in the biological sciences. The development of independent layers of interactivity has been in pursuit in the visualization community. We developed bigPint, a data visualization package available on Bioconductor under the GPL-3 license (https://bioconductor.org/packages/release/bioc/html/bigPint.html). Our software introduces new visualization technology that enables independent layers of interactivity using Plotly in R, which aids in the exploration of large biological datasets. The bigPint package presents modernized versions of scatterplot matrices, volcano plots, and litre plots through the implementation of layered interactivity. These graphics have detected normalization issues, differential expression designation problems, and common analysis errors in public RNA-sequencing datasets. Researchers can apply bigPint graphics to their data by following recommended pipelines written in reproducible code in the user manual. In this paper, we explain how we achieved the independent layers of interactivity that are behind bigPint graphics. Pseudocode and source code are provided. Computational scientists can leverage our open-source code to expand upon our layered interactive technology and/or apply it in new ways toward other computational biology tasks., Author summary Biological disciplines face the challenge of increasingly large and complex data. One necessary approach toward eliciting information is data visualization. Newer visualization tools incorporate interactive capabilities that allow scientists to extract information more efficiently than static counterparts. In this paper, we introduce technology that allows multiple independent layers of interactive visualization written in open-source code. This technology can be repurposed across various biological problems. Here, we apply this technology to RNA-sequencing data, a popular next-generation sequencing approach that provides snapshots of RNA quantity in biological samples at given moments in time. It can be used to investigate cellular differences between health and disease, cellular changes in response to external stimuli, and additional biological inquiries. RNA-sequencing data is large, noisy, and biased. It requires sophisticated normalization. The most popular open-source RNA-sequencing data analysis software focuses on models, with little emphasis on integrating effective visualization tools. This is despite sound evidence that RNA-sequencing data is most effectively explored using graphical and numerical approaches in a complementary fashion. The software we introduce can make it easier for researchers to use models and visuals in an integrated fashion during RNA-sequencing data analysis.

The cerebral vasculature has a complex and hierarchical network, ranging from vessels of a few millimeters to superficial cortical vessels with diameters of a few hundred micrometers, and to the microvasculature (arteriole/venule) and capillary beds in the cortex. In standard imaging techniques, it is difficult to segment all vessels in the network, especially in the case of the human brain. This study proposes a hybrid modeling approach that determines these networks by explicitly segmenting the large vessels from medical images and employing a novel vascular generation algorithm. The framework enables vasculatures to be generated at coarse and fine scales for individual arteries and veins with vascular subregions, following the personalized anatomy of the brain and macroscale vasculatures. In this study, the vascular structures of superficial cortical (pial) vessels before they penetrate the cortex are modeled as a mesoscale vasculature. The validity of the present approach is demonstrated through comparisons with partially observed data from existing measurements of the vessel distributions on the brain surface, pathway fractal features, and vascular territories of the major cerebral arteries. Additionally, this validation provides some biological insights: (i) vascular pathways may form to ensure a reasonable supply of blood to the local surface area; (ii) fractal features of vascular pathways are not sensitive to overall and local brain geometries; and (iii) whole pathways connecting the upstream and downstream entire-scale cerebral circulation are highly dependent on the local curvature of the cerebral sulci., Author summary Cerebral autoregulation in the complex vascular networks of the brain is an amazing achievement. We believe that numerical analysis of the cerebral blood circulation using an anatomically precise vascular model provides a powerful tool for evaluating the direct relationships between local- and global-scale blood flows. However, there is a lack of information about the overall vascular pathways in the human brain, preventing a monolithic model of the human cerebrovasculature from being established. This paper presents a multiscale model of human cerebrovasculature based on a hybrid approach that uses image-based geometries and a newly developed mathematical algorithm. One important argument of this paper is the validity of the cerebrovasculature represented in the model, which reflects anatomical features of major cerebral vasculatures and brain shape, and has strong similarities with available data for human superficial cortical vessels. Investigations of the reconstructed model allow us to derive some biological insights and associated hypotheses for the cerebral vasculature. The authors believe the present cerebrovascular model can be applied to numerical simulations of the entire-scale cerebral blood flow.

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary tree-child networks is one of the most studied ones. However, very little is known about the combinatorial structure of these networks. In this paper we address the problem of generating all possible binary tree-child (BTC) networks with a given number of leaves in an efficient way via reduction/augmentation operations that extend and generalize analogous operations for phylogenetic trees, and are biologically relevant. Since our solution is recursive, this also provides us with a recurrence relation giving an upper bound on the number of such networks. We also show how the operations introduced in this paper can be employed to extend the evolutive history of a set of sequences, represented by a BTC network, to include a new sequence. An implementation in python of the algorithms described in this paper, along with some computational experiments, can be downloaded from https://github.com/bielcardona/TCGenerators., Research of GC and JCP has been partially supported by the Spanish Ministry of Science, Innovation and Universities (http://www.ciencia.gob.es/) and European Regional Development Fund (https://ec.europa.eu/regional_policy/es/funding/erdf/) projects DPI2015-67082-P and PGC2018-096956-B-C43. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

High-throughput data such as metabolomics, genomics, transcriptomics, and proteomics have become familiar data types within the “-omics” family. For this work, we focus on subsets that interact with one another and represent these “pathways” as graphs. Observed pathways often have disjoint components, i.e., nodes or sets of nodes (metabolites, etc.) not connected to any other within the pathway, which notably lessens testing power. In this paper we propose the Pathway Integrated Regression-based Kernel Association Test (PaIRKAT), a new kernel machine regression method for incorporating known pathway information into the semi-parametric kernel regression framework. This work extends previous kernel machine approaches. This paper also contributes an application of a graph kernel regularization method for overcoming disconnected pathways. By incorporating a regularized or “smoothed” graph into a score test, PaIRKAT can provide more powerful tests for associations between biological pathways and phenotypes of interest and will be helpful in identifying novel pathways for targeted clinical research. We evaluate this method through several simulation studies and an application to real metabolomics data from the COPDGene study. Our simulation studies illustrate the robustness of this method to incorrect and incomplete pathway knowledge, and the real data analysis shows meaningful improvements of testing power in pathways. PaIRKAT was developed for application to metabolomic pathway data, but the techniques are easily generalizable to other data sources with a graph-like structure., Author summary PaIRKAT is a tool for improving testing power on high dimensional data by including graph topography in the kernel machine regression setting. Studies on high-dimensional data can struggle to include the complex relationships between variables. The semi-parametric kernel machine regression model is a powerful tool for capturing these types of relationships. They provide a framework for testing for relationships between outcomes of interest and high dimensional data such as metabolomic, genomic, or proteomic pathways. Our paper proposes a kernel machine method for including known biological connections between high dimensional variables by representing them as edges of ‘graphs’ or ‘networks.’ It is common for nodes (e.g., metabolites) to be disconnected from all others within the graph, which leads to meaningful decreases in testing power when graph information is ignored. We include a graph regularization or ‘smoothing’ approach for managing this issue. We demonstrate the benefits of this approach through simulation studies and an application to the metabolomic data from the COPDGene study.

Read-depths (RDs) are frequently used in identifying structural variants (SVs) from sequencing data. For existing RD-based SV callers, it is difficult for them to determine breakpoints in single-nucleotide resolution due to the noisiness of RD data and the bin-based calculation. In this paper, we propose to use the deep segmentation model UNet to learn base-wise RD patterns surrounding breakpoints of known SVs. We integrate model predictions with an RD-based SV caller to enhance breakpoints in single-nucleotide resolution. We show that UNet can be trained with a small amount of data and can be applied both in-sample and cross-sample. An enhancement pipeline named RDBKE significantly increases the number of SVs with more precise breakpoints on simulated and real data. The source code of RDBKE is freely available at https://github.com/yaozhong/deepIntraSV., Author summary In this paper, we used the deep segmentation model UNet to alleviate the bin size limitation of RD-based SV callers. UNet was initially proposed for image data. Here, we demonstrated that the UNet model could also be applied for one-dimensional genomic data. We formalized the breakpoint prediction as a segmentation task and inferred breakpoints in single-nucleotide resolution from predicted label marks. Through a set of experiments on both simulated and real WGS data, we demonstrated that the UNet model could be trained with a small amount of data, and an enhancement pipeline called RDBKE significantly increased the number of SVs with more precise breakpoints.

The collection of immunoglobulin genes in an individual’s germline, which gives rise to B cell receptors via recombination, is known to vary significantly across individuals. In humans, for example, each individual has only a fraction of the several hundred known V alleles. Furthermore, the currently-accepted set of known V alleles is both incomplete (particularly for non-European samples), and contains a significant number of spurious alleles. The resulting uncertainty as to which immunoglobulin alleles are present in any given sample results in inaccurate B cell receptor sequence annotations, and in particular inaccurate inferred naive ancestors. In this paper we first show that the currently widespread practice of aligning each sequence to its closest match in the full set of IMGT alleles results in a very large number of spurious alleles that are not in the sample’s true set of germline V alleles. We then describe a new method for inferring each individual’s germline gene set from deep sequencing data, and show that it improves upon existing methods by making a detailed comparison on a variety of simulated and real data samples. This new method has been integrated into the partis annotation and clonal family inference package, available at https://github.com/psathyrella/partis, and is run by default without affecting overall run time., Author summary Antibodies are an important component of the adaptive immune system, which itself determines our response to both pathogens and vaccines. They are produced by B cells through somatic recombination of germline DNA, which results in a vast diversity of antigen binding affinities across the B cell repertoire. We typically learn about the development of this repertoire, and its history of interaction with antigens, by sequencing large numbers of the DNA sequences from which antibodies are derived. In order to understand such data, it is necessary to determine the combination of germline V, D, and J genes that was rearranged to form each such B cell receptor sequence. This is difficult, however, because the immunoglobulin locus exhibits an extraordinary level of diversity across individuals—encompassing both allelic variation and gene duplication, deletion, and conversion—and because the locus’s large size and repetitive structure make germline sequencing very difficult. In this paper we describe a new computational method that avoids this difficulty by inferring each individual’s set of immunoglobulin germline genes directly from expressed B cell receptor sequence data.

Measuring the overlap between two populations is, in principle, straightforward. Upon fully sampling both populations, the number of shared objects—species, taxonomical units, or gene variants, depending on the context—can be directly counted. In practice, however, only a fraction of each population’s objects are likely to be sampled due to stochastic data collection or sequencing techniques. Although methods exists for quantifying population overlap under subsampled conditions, their bias is well documented and the uncertainty of their estimates cannot be quantified. Here we derive and validate a method to rigorously estimate the population overlap from incomplete samples when the total number of objects, species, or genes in each population is known, a special case of the more general β-diversity problem that is particularly relevant in the ecology and genomic epidemiology of malaria. By solving a Bayesian inference problem, this method takes into account the rates of subsampling and produces unbiased and Bayes-optimal estimates of overlap. In addition, it provides a natural framework for computing the uncertainty of its estimates, and can be used prospectively in study planning by quantifying the tradeoff between sampling effort and uncertainty., Author summary Understanding when two populations are composed of similar species is important for ecologists, epidemiologists, and population geneticists, and in principle it is easy: just sample the two populations, compare the sets of species identified in each, and count how many appear in both populations. In practice, however, this is difficult because sampling methods typically produce only a random subset of the total population, leaving current population overlap estimates biased. Knowing only the number of shared members between two of these partial population samples, this paper shows how we can nevertheless estimate the true overlap between the full populations, when those full populations’ sizes are known. Using Bayesian statistics, we can also compute credible intervals to produce error bars. We show that using this unbiased approach has a dramatic impact on the conclusions one might draw from previously published studies in the malaria literature, which used simple but biased methods. Because the method in this paper quantifies the tradeoff between sampling effort and uncertainty, we also show how to compute the number of samples required to ensure high-confidence results, which may be useful for planning future studies or budgeting lab reagents and time.

Complex eukaryotic promoters normally contain multiple cis-regulatory sequences for different transcription factors (TFs). The binding patterns of the TFs to these sites, as well as the way the TFs interact with each other and with the RNA polymerase (RNAp), lead to combinatorial problems rarely understood in detail, especially under varying epigenetic conditions. The aim of this paper is to build a model describing how the main regulatory cluster of the olfactory receptor Or59b drives transcription of this gene in Drosophila. The cluster-driven expression of this gene is represented as the equilibrium probability of RNAp being bound to the promoter region, using a statistical thermodynamic approach. The RNAp equilibrium probability is computed in terms of the occupancy probabilities of the single TFs of the cluster to the corresponding binding sites, and of the interaction rules among TFs and RNAp, using experimental data of Or59b expression to tune the model parameters. The model reproduces correctly the changes in RNAp binding probability induced by various mutation of specific sites and epigenetic modifications. Some of its predictions have also been validated in novel experiments., Author summary The paper proposes and validates experimentally a model for the fine-graded regulation of a gene, called Or59b, coding for an olfactory receptor in Drosophila. The model is based on statistical thermodynamical theory, theory that so far has been mostly used for prokaryotes. In order to apply it to our more complex eukaryotic system, we have performed a large number of “perturbative” in vivo experiments (mutations, knockdown, knockout, epigenetic conditions) meant to unravel the regulatory rules by which the Or59b main regulatory cluster drives gene expression in as much detail as possible. We make use of the knowledge of the Or59b cis-regulatory module acquired in this way to set up the model and to identify its parameters. The model predictions are then tested experimentally in new epigenetic conditions. These new experiments validate the model behavior and confirm its predictive power.

LncRNA-protein interactions play important roles in post-transcriptional gene regulation, poly-adenylation, splicing and translation. Identification of lncRNA-protein interactions helps to understand lncRNA-related activities. Existing computational methods utilize multiple lncRNA features or multiple protein features to predict lncRNA-protein interactions, but features are not available for all lncRNAs or proteins; most of existing methods are not capable of predicting interacting proteins (or lncRNAs) for new lncRNAs (or proteins), which don’t have known interactions. In this paper, we propose the sequence-based feature projection ensemble learning method, “SFPEL-LPI”, to predict lncRNA-protein interactions. First, SFPEL-LPI extracts lncRNA sequence-based features and protein sequence-based features. Second, SFPEL-LPI calculates multiple lncRNA-lncRNA similarities and protein-protein similarities by using lncRNA sequences, protein sequences and known lncRNA-protein interactions. Then, SFPEL-LPI combines multiple similarities and multiple features with a feature projection ensemble learning frame. In computational experiments, SFPEL-LPI accurately predicts lncRNA-protein associations and outperforms other state-of-the-art methods. More importantly, SFPEL-LPI can be applied to new lncRNAs (or proteins). The case studies demonstrate that our method can find out novel lncRNA-protein interactions, which are confirmed by literature. Finally, we construct a user-friendly web server, available at http://www.bioinfotech.cn/SFPEL-LPI/., Author summary LncRNA-protein interactions play important roles in post-transcriptional gene regulation, poly-adenylation, splicing and translation. Identification of lncRNA-protein interactions helps to understand lncRNA-related activities. In this paper, we propose a novel computational method “SFPEL-LPI” to predict lncRNA-protein interactions. SFPEL-LPI makes use of lncRNA sequences, protein sequences and known lncRNA-protein associations to extract features and calculate similarities for lncRNAs and proteins, and then combines them with a feature projection ensemble learning frame. SFPEL-LPI can predict unobserved interactions between lncRNAs and proteins, and also can make predictions for new lncRNAs (or proteins), which have no interactions with any proteins (or lncRNAs). SFPEL-LPI produces high-accuracy performances on the benchmark dataset when evaluated by five-fold cross validation, and outperforms state-of-the-art methods. The case studies demonstrate that SFPEL-LPI can find out novel associations, which are confirmed by literature. To facilitate the lncRNA-protein interaction prediction, we develop a user-friendly web server, available at http://www.bioinfotech.cn/SFPEL-LPI/.

[EN] Myriad risk factors-including uncontrolled hypertension, aging, and diverse genetic mutations-contribute to the development and enlargement of thoracic aortic aneurysms. Detailed analyses of clinical data and longitudinal studies of murine models continue to provide insight into the natural history of these potentially lethal conditions. Yet, because of the co-existence of multiple risk factors in most cases, it has been difficult to isolate individual effects of the many different factors or to understand how they act in combination. In this paper, we use a data-informed computational model of the initiation and progression of thoracic aortic aneurysms to contrast key predisposing risk factors both in isolation and in combination; these factors include localized losses of elastic fiber integrity, aberrant collagen remodeling, reduced smooth muscle contractility, and dysfunctional mechanosensing or mechanoregulation of extracellular matrix along with superimposed hypertension and aortic aging. In most cases, mild-to-severe localized losses in cellular function or matrix integrity give rise to varying degrees of local dilatations of the thoracic aorta, with enlargement typically exacerbated in cases wherein predisposing risk factors co-exist. The simulations suggest, for the first time, that effects of compromised smooth muscle contractility are more important in terms of dysfunctional mechanosensing and mechanoregulation of matrix than in vessel-level control of diameter and, furthermore, that dysfunctional mechanobiological control can yield lesions comparable to those in cases of compromised elastic fiber integrity. Particularly concerning, therefore, is that loss of constituents such as fibrillin-1, as in Marfan syndrome, can compromise both elastic fiber integrity and mechanosensing. Author summary Aneurysms are local dilatations of the arterial wall that are responsible for significant disability and death. Detailed analyses of clinical data continue to provide insight into the natural history of these potentially lethal conditions, with myriad risk factors-including uncontrolled hypertension, aging, and diverse genetic mutations-contributing to their development and enlargement. Yet, because of the co-existence of these risk factors in most cases, it has been difficult to isolate individual effects or to understand how they act in combination. In this paper, we use a computational model of the initiation and progression of thoracic aortic aneurysms to contrast key predisposing factors both in isolation and in combination as well as with superimposed hypertension and aging. The present study recovers many findings from mouse models but with new and important observations that promise to guide in vivo and ex vivo studies as we seek to understand and eventually better treat these complex, multi-factorial lesions, with data-informed patient-specific computations eventually the way forward., This work was supported, in part, by grants from the US NIH (P01 HL134605, U01 HL142518, and R01 HL146723) to JDH. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

During these days of global emergency for the COVID-19 disease outbreak, there is an urgency to share reliable information able to help worldwide life scientists to get better insights and make sense of the large amount of data currently available. In this study we used the results presented in [1] to perform two different Systems Biology analyses on the HCoV-host interactome. In the first one, we reconstructed the interactome of the HCoV-host proteins, integrating it with highly reliable miRNA and drug interactions information. We then added the IL-6 gene, identified in recent publications [2] as heavily involved in the COVID-19 progression and, interestingly, we identified several interactions with the reconstructed interactome. In the second analysis, we performed a Gene Ontology and a Pathways enrichment analysis on the full set of the HCoV-host interactome proteins and on the ones belonging to a significantly dense cluster of interacting proteins identified in the first analysis. Results of the two analyses provide a compact but comprehensive glance on some of the current state-of-the-art regulations, GO, and pathways involved in the HCoV-host interactome, and that could support all scientists currently focusing on SARS-CoV-2 research., Author summary In this paper we provide data about the HCoV-host interactome that can be extracted from the integration of several public available databases. We used the initial interactome published by Zhou et al. and analyzed if there are already known and validated interactions. We also looked into possible known miRNAs and drugs interactions to suggest possible biomarker candidates and treatment options. We also performed a Gene Ontology and a Pathways enrichment analysis to understand which are the pathways most likely involved in the proteins targeted by SARS-CoV-2. This paper not only provides a set of validated and reliable data that could help researchers in their fight against the COVID-19 disease outbreak, but also demonstrates how Systems Biology can be effectively used to quickly gather preliminary but still significant data without resorting only to expensive lab experiments.

Humans are able to track multiple objects at any given time in their daily activities—for example, we can drive a car while monitoring obstacles, pedestrians, and other vehicles. Several past studies have examined how humans track targets simultaneously and what underlying behavioral and neural mechanisms they use. At the same time, computer-vision researchers have proposed different algorithms to track multiple targets automatically. These algorithms are useful for video surveillance, team-sport analysis, video analysis, video summarization, and human–computer interaction. Although there are several efficient biologically inspired algorithms in artificial intelligence, the human multiple-target tracking (MTT) ability is rarely imitated in computer-vision algorithms. In this paper, we review MTT studies in neuroscience and biologically inspired MTT methods in computer vision and discuss the ways in which they can be seen as complementary., Author summary Multiple-target tracking (MTT) is a challenging task vital for both a human’s daily life and for many artificial intelligent systems, such as those used for urban traffic control. Neuroscientists are interested in discovering the underlying neural mechanisms that successfully exploit cognitive resources, e.g., spatial attention or memory, during MTT. Computer-vision specialists aim to develop powerful MTT algorithms based on advanced models or data-driven computational methods. In this paper, we review MTT studies from both communities and discuss how findings from cognitive studies can inspire developers to construct higher performing MTT algorithms. Moreover, some directions have been proposed through which MTT algorithms could raise new questions in the cognitive science domain, and answering them can shed light on neural processes underlying MTT.

Analyzing the rhythm of animals’ acoustic signals is of interest to a growing number of researchers: evolutionary biologists want to disentangle how these structures evolved and what patterns can be found, and ecologists and conservation biologists aim to discriminate cryptic species on the basis of parameters of acoustic signals such as temporal structures. Temporal structures are also relevant for research on vocal production learning, a part of which is for the animal to learn a temporal structure. These structures, in other words, these rhythms, are the topic of this paper. How can they be investigated in a meaningful, comparable and universal way? Several approaches exist. Here we used five methods to compare their suitability and interpretability for different questions and datasets and test how they support the reproducibility of results and bypass biases. Three very different datasets with regards to recording situation, length and context were analyzed: two social vocalizations of Neotropical bats (multisyllabic, medium long isolation calls of Saccopteryx bilineata, and monosyllabic, very short isolation calls of Carollia perspicillata) and click trains of sperm whales, Physeter macrocephalus. Techniques to be compared included Fourier analysis with a newly developed goodness-of-fit value, a generate-and-test approach where data was overlaid with varying artificial beats, and the analysis of inter-onset-intervals and calculations of a normalized Pairwise Variability Index (nPVI). We discuss the advantages and disadvantages of the methods and we also show suggestions on how to best visualize rhythm analysis results. Furthermore, we developed a decision tree that will enable researchers to select a suitable and comparable method on the basis of their data., Author summary In the analysis of animal communication more and more interest is shown in rhythm of animal communication and what information this might convey. In this paper, we establish a workflow to analyze the temporal structure–namely the rhythm–of any particular animals’acoustic signal with methods that are applicable for a wide range of signals and results that are easily comparable and interpretable. This workflow will enhance the understanding of rhythmicality in animals’ acoustic signals as well as facilitate comparison between species. Methods we conducted ranged from simple distributional and visual analysis to higher mathematics such as Fourier analysis. All analyses rely on Inter-Onset-Intervals, the duration between the beginning of one element and the next. We used different datasets from two neotropical bat species as well as from the sperm whale. With this selection, we cover very short sequences with only few elements up to sequences of around 200 elements, multisyllabic and monosyllabic sequences and social communication as well as sounds used for orientation and foraging.

In bacteria functionally related genes comprising metabolic pathways and protein complexes are frequently encoded in operons and are widely conserved across phylogenetically diverse species. The evolution of these operon-encoded processes is affected by diverse mechanisms such as gene duplication, loss, rearrangement, and horizontal transfer. These mechanisms can result in functional diversification, increasing the potential evolution of novel biological pathways, and enabling pre-existing pathways to adapt to the requirements of particular environments. Despite the fundamental importance that these mechanisms play in bacterial environmental adaptation, a systematic approach for studying the evolution of operon organization is lacking. Herein, we present a novel method to study the evolution of operons based on phylogenetic clustering of operon-encoded protein families and genomic-proximity network visualizations of operon architectures. We applied this approach to study the evolution of the synthase dependent exopolysaccharide (EPS) biosynthetic systems: cellulose, acetylated cellulose, poly-β-1,6-N-acetyl-D-glucosamine (PNAG), Pel, and alginate. These polymers have important roles in biofilm formation, antibiotic tolerance, and as virulence factors in opportunistic pathogens. Our approach revealed the complex evolutionary landscape of EPS machineries, and enabled operons to be classified into evolutionarily distinct lineages. Cellulose operons show phyla-specific operon lineages resulting from gene loss, rearrangement, and the acquisition of accessory loci, and the occurrence of whole-operon duplications arising through horizonal gene transfer. Our evolution-based classification also distinguishes between PNAG production from Gram-negative and Gram-positive bacteria on the basis of structural and functional evolution of the acetylation modification domains shared by PgaB and IcaB loci, respectively. We also predict several pel-like operon lineages in Gram-positive bacteria and demonstrate in our companion paper (Whitfield et al PLoS Pathogens, in press) that Bacillus cereus produces a Pel-dependent biofilm that is regulated by cyclic-3’,5’-dimeric guanosine monophosphate (c-di-GMP)., Author summary In bacterial genomes, biological processes are frequently encoded by neighbouring co-transcribed genes, termed operons. In addition, operon-associated genes often belong to distinct evolutionary families with diverse biological functions. Studying the evolution of bacterial operons provides valuable insight into understanding the biological significance of genes involved in environmental adaptation. To date, no systematic approach has been devised to examine both the complex evolutionary relationships of operon encoded genes and the evolution of operon organization as a whole. To address this challenge, we developed an integrative method to study operon evolution by combining phylogenetic tree based clustering and genomic-context networks. We applied this method to perform the first systematic survey of all known synthase-dependent exopolysaccharide biosynthetic machineries, demonstrating the generalizability of our approach for operons of diverse size, protein family composition, and species distribution. Our method identified distinct biofilm operon clades across phylogenetically diverse bacteria, that result from gene rearrangement, duplication, loss, fusion, and horizontal gene transfer. We found different evolutionary trajectories for Gram-negative and Gram-positive PNAG biofilm production machineries, and in a companion paper (Whitfield et al PLoS Pathogens, in press) present experimental validation that the Pel polysaccharide is produced by a Gram-positive bacterium.

We describe Orbit Image Analysis, an open-source whole slide image analysis tool. The tool consists of a generic tile-processing engine which allows the execution of various image analysis algorithms provided by either Orbit itself or from other open-source platforms using a tile-based map-reduce execution framework. Orbit Image Analysis is capable of sophisticated whole slide imaging analyses due to several key features. First, Orbit has machine-learning capabilities. This deep learning segmentation can be integrated with complex object detection for analysis of intricate tissues. In addition, Orbit can run locally as standalone or connect to the open-source image server OMERO. Another important characteristic is its scale-out functionality, using the Apache Spark framework for distributed computing. In this paper, we describe the use of Orbit in three different real-world applications: quantification of idiopathic lung fibrosis, nerve fibre density quantification, and glomeruli detection in the kidney., Author summary Whole slide images (WSI) are digital scans of samples, e.g. tissue sections. It is very convenient to view samples in this digital form, and with the increasing computation power it can also be used for quantification. These images are often too large to be analysed with standard tools. To overcome this issue, we created on open-source tool called Orbit Image Analysis which divides the images into smaller parts and allows the analysis of it with either embedded algorithms or the integration of existing tools. It also provides mechanisms to process huge amounts of images in distributed computing environments, such as clusters or cloud infrastructures. In this paper we describe the Orbit system and demonstrate its application based on three real-word use-cases.

Manually curating biomedical knowledge from publications is necessary to build a knowledge based service that provides highly precise and organized information to users. The process of retrieving relevant publications for curation, which is also known as document triage, is usually carried out by querying and reading articles in PubMed. However, this query-based method often obtains unsatisfactory precision and recall on the retrieved results, and it is difficult to manually generate optimal queries. To address this, we propose a machine-learning assisted triage method. We collect previously curated publications from two databases UniProtKB/Swiss-Prot and the NHGRI-EBI GWAS Catalog, and used them as a gold-standard dataset for training deep learning models based on convolutional neural networks. We then use the trained models to classify and rank new publications for curation. For evaluation, we apply our method to the real-world manual curation process of UniProtKB/Swiss-Prot and the GWAS Catalog. We demonstrate that our machine-assisted triage method outperforms the current query-based triage methods, improves efficiency, and enriches curated content. Our method achieves a precision 1.81 and 2.99 times higher than that obtained by the current query-based triage methods of UniProtKB/Swiss-Prot and the GWAS Catalog, respectively, without compromising recall. In fact, our method retrieves many additional relevant publications that the query-based method of UniProtKB/Swiss-Prot could not find. As these results show, our machine learning-based method can make the triage process more efficient and is being implemented in production so that human curators can focus on more challenging tasks to improve the quality of knowledge bases., Author summary As the volume of literature on genomic variants continues to grow at an increasing rate, it is becoming more difficult for a curator of a variant knowledge base to keep up with and curate all the published papers. Here, we suggest a deep learning-based literature triage method for genomic variation resources. Our method achieves state-of-the-art performance on the triage task. Moreover, our model does not require any laborious preprocessing or feature engineering steps, which are required for traditional machine learning triage methods. We applied our method to the literature triage process of UniProtKB/Swiss-Prot and the NHGRI-EBI GWAS Catalog for genomic variation by collaborating with the database curators. Both the manual curation teams confirmed that our method achieved higher precision than their previous query-based triage methods without compromising recall. Both results show that our method is more efficient and can replace the traditional query-based triage methods of manually curated databases. Our method can give human curators more time to focus on more challenging tasks such as actual curation as well as the discovery of novel papers/experimental techniques to consider for inclusion.

This paper is concerned with the potential multistability of protein concentrations in the cell. That is, situations where one, or a family of, proteins may sit at one of two or more different steady state concentrations in otherwise identical cells, and in spite of them being in the same environment. For models of multisite protein phosphorylation for example, in the presence of excess substrate, it has been shown that the achievable number of stable steady states can increase linearly with the number of phosphosites available. In this paper, we analyse the consequences of adding enzyme docking to these and similar models, with the resultant sequestration of phosphatase and kinase by the fully unphosphorylated and by the fully phosphorylated substrates respectively. In the large molecule numbers limit, where deterministic analysis is applicable, we prove that there are always values for these rates of sequestration which, when exceeded, limit the extent of multistability. For the models considered here, these numbers are much smaller than the affinity of the enzymes to the substrate when it is in a modifiable state. As substrate enzyme-sequestration is increased, we further prove that the number of steady states will inevitably be reduced to one. For smaller molecule numbers a stochastic analysis is more appropriate, where multistability in the large molecule numbers limit can manifest itself as multimodality of the probability distribution; the system spending periods of time in the vicinity of one mode before jumping to another. Here, we find that substrate enzyme sequestration can induce bimodality even in systems where only a single steady state can exist at large numbers. To facilitate this analysis, we develop a weakly chained diagonally dominant M-matrix formulation of the Chemical Master Equation, allowing greater insights in the way particular mechanisms, like enzyme sequestration, can shape probability distributions and therefore exhibit different behaviour across different regimes., Author summary Models of multisite protein phosphorylation have been of great interest to the systems biology community, largely due to their ability to exhibit multistable behaviour. In the presence of excess substrate it has been shown that the number of stable steady states achieved can increase linearly with the number of phosphosites available. In this paper, we provide a quantitative mathematical analysis of the effect that enzyme docking, and the consequent phosphatase and kinase sequestration by the unphosphorylated and the fully phosphorylated substrates respectively, has on a multisite protein phosphorylation system. The analysis is done in both the deterministic and the stochastic domains, for large and small molecule numbers respectively. We prove, by finding sufficient conditions, that in the deterministic domain substrate enzyme-sequestration must inevitably limit the extent of multistability, ultimately to one steady state, even for systems with arbitrary processivity or sequentiality (i.e. where multiple phosphorylations or dephosphorylations can happen per reaction and in any order). In contrast, in the stochastic domain it can provide bimodality even in cases where bistability is not possible for large molecule numbers.

Phylogenetic networks are rooted, directed, acyclic graphs that model reticulate evolutionary histories. Recently, statistical methods were devised for inferring such networks from either gene tree estimates or the sequence alignments of multiple unlinked loci. Bi-allelic markers, most notably single nucleotide polymorphisms (SNPs) and amplified fragment length polymorphisms (AFLPs), provide a powerful source of genome-wide data. In a recent paper, a method called SNAPP was introduced for statistical inference of species trees from unlinked bi-allelic markers. The generative process assumed by the method combined both a model of evolution for the bi-allelic markers, as well as the multispecies coalescent. A novel component of the method was a polynomial-time algorithm for exact computation of the likelihood of a fixed species tree via integration over all possible gene trees for a given marker. Here we report on a method for Bayesian inference of phylogenetic networks from bi-allelic markers. Our method significantly extends the algorithm for exact computation of phylogenetic network likelihood via integration over all possible gene trees. Unlike the case of species trees, the algorithm is no longer polynomial-time on all instances of phylogenetic networks. Furthermore, the method utilizes a reversible-jump MCMC technique to sample the posterior of phylogenetic networks given bi-allelic marker data. Our method has a very good performance in terms of accuracy and robustness as we demonstrate on simulated data, as well as a data set of multiple New Zealand species of the plant genus Ourisia (Plantaginaceae). We implemented the method in the publicly available, open-source PhyloNet software package., Author summary The availability of genomic data has revolutionized the study of evolutionary histories and phylogeny inference. Inferring evolutionary histories from genomic data requires, in most cases, accounting for the fact that different genomic regions could have evolutionary histories that differ from each other as well as from that of the species from which the genomes were sampled. In this paper, we introduce a method for inferring evolutionary histories while accounting for two processes that could give rise to such differences across the genomes, namely incomplete lineage sorting and hybridization. We introduce a novel algorithm for computing the likelihood of phylogenetic networks from bi-allelic genetic markers and use it in a Bayesian inference method. Analyses of synthetic and empirical data sets show a very good performance of the method in terms of the estimates it obtains.

Constructing biological networks capable of performing specific biological functionalities has been of sustained interest in synthetic biology. Adaptation is one such ubiquitous functional property, which enables every living organism to sense a change in its surroundings and return to its operating condition prior to the disturbance. In this paper, we present a generic systems theory-driven method for designing adaptive protein networks. First, we translate the necessary qualitative conditions for adaptation to mathematical constraints using the language of systems theory, which we then map back as ‘design requirements’ for the underlying networks. We go on to prove that a protein network with different input–output nodes (proteins) needs to be at least of third-order in order to provide adaptation. Next, we show that the necessary design principles obtained for a three-node network in adaptation consist of negative feedback or a feed-forward realization. We argue that presence of a particular class of negative feedback or feed-forward realization is necessary for a network of any size to provide adaptation. Further, we claim that the necessary structural conditions derived in this work are the strictest among the ones hitherto existed in the literature. Finally, we prove that the capability of producing adaptation is retained for the admissible motifs even when the output node is connected with a downstream system in a feedback fashion. This result explains how complex biological networks achieve robustness while keeping the core motifs unchanged in the context of a particular functionality. We corroborate our theoretical results with detailed and thorough numerical simulations. Overall, our results present a generic, systematic and robust framework for designing various kinds of biological networks., Author summary Biological systems display a remarkable diversity of functionalities, many of which can be conceived as the response of a large network composed of small interconnecting modules. Unravelling the connection pattern, i.e. design principles, behind important biological functionalities is one of the most challenging problems in systems biology. One such phenomenon is perfect adaptation, which merits special attention owing to its universal presence ranging from chemotaxis in bacterial cells to calcium homeostasis in mammalian cells. The present work focuses on finding the design principles for perfect adaptation in the presence of a stair-case type disturbance. To this end, the current work proposes a systems-theoretic approach to deduce precise mathematical (hence structural) conditions that comply with the key performance parameters for adaptation. The approach is agnostic to the particularities of the reaction kinetics, underlining the dominant role of the topological structure on the response of the network. Notably, the design principles obtained in this work serve as the most strict necessary structural conditions for a network of any size to provide perfect adaptation.

The spread of infectious diseases such as COVID-19 presents many challenges to healthcare systems and infrastructures across the world, exacerbating inequalities and leaving the world’s most vulnerable populations most affected. Given their density and available infrastructure, refugee and internally displaced person (IDP) settlements can be particularly susceptible to disease spread. In this paper we present an agent-based modeling approach to simulating the spread of disease in refugee and IDP settlements under various non-pharmaceutical intervention strategies. The model, based on the June open-source framework, is informed by data on geography, demographics, comorbidities, physical infrastructure and other parameters obtained from real-world observations and previous literature. The development and testing of this approach focuses on the Cox’s Bazar refugee settlement in Bangladesh, although our model is designed to be generalizable to other informal settings. Our findings suggest the encouraging self-isolation at home of mild to severe symptomatic patients, as opposed to the isolation of all positive cases in purpose-built isolation and treatment centers, does not increase the risk of secondary infection meaning the centers can be used to provide hospital support to the most intense cases of COVID-19. Secondly we find that mask wearing in all indoor communal areas can be effective at dampening viral spread, even with low mask efficacy and compliance rates. Finally, we model the effects of reopening learning centers in the settlement under various mitigation strategies. For example, a combination of mask wearing in the classroom, halving attendance regularity to enable physical distancing, and better ventilation can almost completely mitigate the increased risk of infection which keeping the learning centers open may cause. These modeling efforts are being incorporated into decision making processes to inform future planning, and further exercises should be carried out in similar geographies to help protect those most vulnerable., Author summary The spread of infectious diseases presents many challenges to healthcare systems and infrastructures across the world. Given their density and available infrastructure, refugee and internally displaced person (IDP) settlements can be particularly susceptible to the dangers of disease spread. This study seeks to understand how COVID-19 spreads in settlements, focusing on the Cox’s Bazar refugee settlement in Bangladesh. Our model simulates the movements and interactions of each individual in the settlement, incorporating information about family structures and demographic attributes, to understand how COVID-19 might spread under various intervention strategies. Our analysis suggests that mask wearing in indoor locations can have a significant effect on disease spread, even when wearing reusable cotton masks, which the people in the settlement can make themselves. We also look at different ways to treat individuals who only have milder symptoms and don’t yet require hospitalisation, as well as various scenarios which might allow for the safe reopening of schools in the settlement. With almost 80 million forcibly displaced people in the world, we hope that this work will inspire more modeling groups to focus on these vulnerable populations, which have been traditionally under-served by such efforts, to ensure no one is left behind.

System identification techniques -- projection pursuit regression models (PPRs) and convolutional neural networks (CNNs) -- provide state-of-the-art performance in predicting visual cortical neurons' responses to arbitrary input stimuli. However, the constituent kernels recovered by these methods are often noisy and lack coherent structure, making it difficult to understand the underlying component features of a neuron's receptive field. In this paper, we show that using a dictionary of diverse kernels with complex shapes learned from natural scenes based on efficient coding theory, as the front-end for PPRs and CNNs can improve their performance in neuronal response prediction as well as algorithmic data efficiency and convergence speed. Extensive experimental results also indicate that these sparse-code kernels provide important information on the component features of a neuron's receptive field. In addition, we find that models with the complex-shaped sparse code front-end are significantly better than models with a standard orientation-selective Gabor filter front-end for modeling V1 neurons that have been found to exhibit complex pattern selectivity. We show that the relative performance difference due to these two front-ends can be used to produce a sensitive metric for detecting complex selectivity in V1 neurons., 22 pages

Type 2 diabetes leads to premature death and reduced quality of life for 8% of Americans. Nutrition management is critical to maintaining glycemic control, yet it is difficult to achieve due to the high individual differences in glycemic response to nutrition. Anticipating glycemic impact of different meals can be challenging not only for individuals with diabetes, but also for expert diabetes educators. Personalized computational models that can accurately forecast an impact of a given meal on an individual’s blood glucose levels can serve as the engine for a new generation of decision support tools for individuals with diabetes. However, to be useful in practice, these computational engines need to generate accurate forecasts based on limited datasets consistent with typical self-monitoring practices of individuals with type 2 diabetes. This paper uses three forecasting machines: (i) data assimilation, a technique borrowed from atmospheric physics and engineering that uses Bayesian modeling to infuse data with human knowledge represented in a mechanistic model, to generate real-time, personalized, adaptable glucose forecasts; (ii) model averaging of data assimilation output; and (iii) dynamical Gaussian process model regression. The proposed data assimilation machine, the primary focus of the paper, uses a modified dual unscented Kalman filter to estimate states and parameters, personalizing the mechanistic models. Model selection is used to make a personalized model selection for the individual and their measurement characteristics. The data assimilation forecasts are empirically evaluated against actual postprandial glucose measurements captured by individuals with type 2 diabetes, and against predictions generated by experienced diabetes educators after reviewing a set of historical nutritional records and glucose measurements for the same individual. The evaluation suggests that the data assimilation forecasts compare well with specific glucose measurements and match or exceed in accuracy expert forecasts. We conclude by examining ways to present predictions as forecast-derived range quantities and evaluate the comparative advantages of these ranges., Author summary Type 2 diabetes is a devastating disease that requires constant patient self-management of glucose, insulin, nutrition and exercise. Nevertheless, glucose and insulin dynamics are complicated, nonstationary, nonlinear, and individual-dependent, making self-management of diabetes a complex task. To help alleviate some of the difficulty for patients, we develop a method for personalized, real-time, glucose forecasting based on nutrition. Specifically, we create and evaluate the computational machinery based on both Gaussian process models and data assimilation that leverages the physiologic knowledge of two mechanistic models to produce a personalized, nutrition-based glucose forecast for individuals with type 2 diabetes in real time that is robust to sparse data and nonstationary patients. Our computational engine was conceived to be of potential use for diabetes self-management.

© 2021 Moore et al., Bioinformatics training is required at every stage of a scientist’s research career. Continual bioinformatics training allows exposure to an ever-changing and growing repertoire of techniques and databases, and so biologists, computational scientists, and healthcare practitioners are all seeking learning opportunities in the use of computational resources and tools designed for data storage, retrieval, and analysis. There are abundant opportunities for accessing bioinformatics training for scientists in high-income countries (HICs), with well-equipped facilities and participants and trainers requiring minimal travel and financial costs alongside a range of general advice for developing short bioinformatics training courses [1–3]. However, regionally targeted bioinformatics training in low- and middle-income countries (LMICs) often requires more extensive local and external support, organization, and travel. Due to the limited expertise in bioinformatics in LMICs in general, most bioinformatics training requires a fair amount of collaboration with experts beyond the local community, country, or region. A common model of training, used as the basis of this article, includes a local host collaborating with local, regional, and international experts gathering to train local or regional participants. Recently, there has been a growth of capacity strengthening initiatives in LMICs, such as the Pan African Bioinformatics Network for Human Heredity and Health in Africa (H3ABioNet) Initiative [4–6], the Capacity Building for Bioinformatics in Latin America (CABANA) Project [7], the Asia Pacific BioInformatics Network (APBioNet) [8], and the Wellcome Connecting Science Courses and Conferences program [9]. One of the important strands of these initiatives is a drive to organize and deliver valuable bioinformatics training, but organizing and delivering short bioinformatics training workshops in an LMIC present a unique set of challenges. This paper attempts to build upon the sage advice for organizing bioinformatics workshops with specific guidance for organizing and delivering them in LMICs. It describes the processes to follow in organizing courses taking into consideration the low-resource setting. We should also note that LMICs are not a monolithic group and that setting, context, temporality, and specific location matters. LMICs are a complex regional grouping [10] and should be treated as such; however, we will present some common lessons that we hope will help organizers and trainers of bioinformatics training events in LMICs to navigate the often different, challenging, and rewarding experience., The authors who contributed to this manuscript are funded as follows: BM receives salary support from Wellcome Trust grants [WT108749/Z/15/Z, WT108749/Z/15/A], PC, VR, NM, AG’s salaries are funded in whole, or in part, by the NIH Common Fund H3ABioNet grant [U24HG006941], MC, SLFV, AR, PG, PCL’s salaries were partly funded by the UKRI-BBSRC ‘Capacity building for bioinformatics in Latin America’ (CABANA) grant, on behalf of the Global Challenges Research Fund [BB/P027849/1], JDLR is funded by ISCiii AES [ref. PI18/00591] at the CSIC/USAL (Spain) and by CYTED, RIABIO (Red Iberoamericana 521RT0118), AM’s salary is funded by [WT206194/Z/17/Z], GO is funded by the CABANA grant and SM is funded by the EMBL-EBI.

Decision-making about pandemic mitigation often relies upon simulation modelling. Models of disease transmission through networks of contacts--between individuals or between population centres--are increasingly used for these purposes. Real-world contact networks are rich in structural features that influence infection transmission, such as tightly-knit local communities that are weakly connected to one another. In this paper, we propose a new flow-based edge-betweenness centrality method for detecting bottleneck edges that connect nodes in contact networks. In particular, we utilize convex optimization formulations based on the idea of diffusion with p-norm network flow. Using simulation models of COVID-19 transmission through real network data at both individual and county levels, we demonstrate that targeting bottleneck edges identified by the proposed method reduces the number of infected cases by up to 10% more than state-of-the-art edge-betweenness methods. Furthermore, the proposed method is orders of magnitude faster than existing methods., Comment: 38 pages, 21 figures

Recent advancements in in situ methods, such as multiplexed in situ RNA hybridization and in situ RNA sequencing, have deepened our understanding of the way biological processes are spatially organized in tissues. Automated image processing and spot-calling algorithms for analyzing in situ transcriptomics images have many parameters which need to be tuned for optimal detection. Having ground truth datasets (images where there is very high confidence on the accuracy of the detected spots) is essential for evaluating these algorithms and tuning their parameters. We present a first-in-kind open-source toolkit and framework for in situ transcriptomics image analysis that incorporates crowdsourced annotations, alongside expert annotations, as a source of ground truth for the analysis of in situ transcriptomics images. The kit includes tools for preparing images for crowdsourcing annotation to optimize crowdsourced workers’ ability to annotate these images reliably, performing quality control (QC) on worker annotations, extracting candidate parameters for spot-calling algorithms from sample images, tuning parameters for spot-calling algorithms, and evaluating spot-calling algorithms and worker performance. These tools are wrapped in a modular pipeline with a flexible structure that allows users to take advantage of crowdsourced annotations from any source of their choice. We tested the pipeline using real and synthetic in situ transcriptomics images and annotations from the Amazon Mechanical Turk system obtained via Quanti.us. Using real images from in situ experiments and simulated images produced by one of the tools in the kit, we studied worker sensitivity to spot characteristics and established rules for annotation QC. We explored and demonstrated the use of ground truth generated in this way for validating spot-calling algorithms and tuning their parameters, and confirmed that consensus crowdsourced annotations are a viable substitute for expert-generated ground truth for these purposes., Author summary To understand important biological processes such as development, wound healing, and disease, it is necessary to study where different genes are expressed in a tissue. RNA molecules can be visualized within tissues by using in situ transcriptomics tools, which use fluorescent probes that bind to specific RNA target molecules and appear in microscopy images as bright spots. Algorithms can be used to find the locations of these spots, but ground truth datasets (images with spots located to high accuracy) are needed to evaluate these algorithms and tune their parameters. While the typical way of generating ground truth datasets is having an expert annotate the spots by hand, many in situ transcriptomics image datasets are too large for this. However, it is often easy for non-experts to identify the spots with minimal training. In this paper, we present an open-source toolkit and framework that incorporates crowdsourced annotations alongside expert annotations as a source of ground truth for the analysis of in situ transcriptomics images. We explored and demonstrated the use of this framework for validating spot-calling algorithms and tuning their parameters, and confirmed that consensus crowdsourced annotations are a viable substitute for expert-generated ground truth.

Metaproteomic studies adopt the common bottom-up proteomics approach to investigate the protein composition and the dynamics of protein expression in microbial communities. When matched metagenomic and/or metatranscriptomic data of the microbial communities are available, metaproteomic data analyses often employ a metagenome-guided approach, in which complete or fragmental protein-coding genes are first directly predicted from metagenomic (and/or metatranscriptomic) sequences or from their assemblies, and the resulting protein sequences are then used as the reference database for peptide/protein identification from MS/MS spectra. This approach is often limited because protein coding genes predicted from metagenomes are incomplete and fragmental. In this paper, we present a graph-centric approach to improving metagenome-guided peptide and protein identification in metaproteomics. Our method exploits the de Bruijn graph structure reported by metagenome assembly algorithms to generate a comprehensive database of protein sequences encoded in the community. We tested our method using several public metaproteomic datasets with matched metagenomic and metatranscriptomic sequencing data acquired from complex microbial communities in a biological wastewater treatment plant. The results showed that many more peptides and proteins can be identified when assembly graphs were utilized, improving the characterization of the proteins expressed in the microbial communities. The additional proteins we identified contribute to the characterization of important pathways such as those involved in degradation of chemical hazards. Our tools are released as open-source software on github at https://github.com/COL-IU/Graph2Pro., Author Summary In recent years, meta-omic (including metatranscriptomic and metaproteomic) techniques have been adopted as complementary approaches to metagenomic sequencing to study functional characteristics and dynamics of microbial communities, aiming at a holistic understanding of a community to respond to the changes in the environment. Currently, metaproteomic data are largely analyzed using the bioinformatics tools originally designed in bottom-up proteomics. In particular, recent metaproteomic studies employed a metagenome-guided approach, in which complete or fragmental protein-coding genes were first predicted from metagenomic sequences (i.e., contigs or scaffolds), acquired from the matched community samples, and predicted protein sequences were then used in peptide identification. A key challenge of this approach is that the protein coding genes predicted from assembled metagenomic contigs can be incomplete and fragmented due to the complexity of metagenomic samples and the short reads length in metagenomic sequencing. To address this issue, in this paper, we present a graph-centric approach that exploits the de bruijn graph structure reported by metagenome assembly algorithms to improve metagenome-guided peptide and protein identification in metaproteomics. We show that our method can identify much more peptides and proteins, improving the characterization of the proteins expressed in the microbial communities.

Integrative clustering is used to identify groups of samples by jointly analysing multiple datasets describing the same set of biological samples, such as gene expression, copy number, methylation etc. Most existing algorithms for integrative clustering assume that there is a shared consistent set of clusters across all datasets, and most of the data samples follow this structure. However in practice, the structure across heterogeneous datasets can be more varied, with clusters being joined in some datasets and separated in others. In this paper, we present a probabilistic clustering method to identify groups across datasets that do not share the same cluster structure. The proposed algorithm, Clusternomics, identifies groups of samples that share their global behaviour across heterogeneous datasets. The algorithm models clusters on the level of individual datasets, while also extracting global structure that arises from the local cluster assignments. Clusters on both the local and the global level are modelled using a hierarchical Dirichlet mixture model to identify structure on both levels. We evaluated the model both on simulated and on real-world datasets. The simulated data exemplifies datasets with varying degrees of common structure. In such a setting Clusternomics outperforms existing algorithms for integrative and consensus clustering. In a real-world application, we used the algorithm for cancer subtyping, identifying subtypes of cancer from heterogeneous datasets. We applied the algorithm to TCGA breast cancer dataset, integrating gene expression, miRNA expression, DNA methylation and proteomics. The algorithm extracted clinically meaningful clusters with significantly different survival probabilities. We also evaluated the algorithm on lung and kidney cancer TCGA datasets with high dimensionality, again showing clinically significant results and scalability of the algorithm., Author summary Integrative clustering is the task of identifying groups of samples by combining information from several datasets. An example of this task is cancer subtyping, where we cluster tumour samples based on several datasets, such as gene expression, proteomics and others. Most existing algorithms assume that all such datasets share a similar cluster structure, with samples outside these clusters treated as noise. The structure can, however, be much more heterogeneous: some meaningful clusters may appear only in some datasets. In the paper, we introduce the Clusternomics algorithm that identifies groups of samples across heterogeneous datasets. It models both cluster structure of individual datasets, and the global structure that appears as a combination of local structures. The algorithm uses probabilistic modelling to identify the groups and share information across the local and global levels. We evaluated the algorithm on both simulated and real world datasets, where the algorithm found clinically significant clusters with different survival outcomes.

The ability to produce timely and accurate flu forecasts in the United States can significantly impact public health. Augmenting forecasts with internet data has shown promise for improving forecast accuracy and timeliness in controlled settings, but results in practice are less convincing, as models augmented with internet data have not consistently outperformed models without internet data. In this paper, we perform a controlled experiment, taking into account data backfill, to improve clarity on the benefits and limitations of augmenting an already good flu forecasting model with internet-based nowcasts. Our results show that a good flu forecasting model can benefit from the augmentation of internet-based nowcasts in practice for all considered public health-relevant forecasting targets. The degree of forecast improvement due to nowcasting, however, is uneven across forecasting targets, with short-term forecasting targets seeing the largest improvements and seasonal targets such as the peak timing and intensity seeing relatively marginal improvements. The uneven forecasting improvements across targets hold even when “perfect” nowcasts are used. These findings suggest that further improvements to flu forecasting, particularly seasonal targets, will need to derive from other, non-nowcasting approaches., Author summary It has been demonstrated in retrospective settings that flu forecasting can be improved by augmenting forecasting models with internet-based nowcasts (i.e., one-week-ahead forecasts generated with internet data). The improvement of internet-assisted forecasting models, however, has not translated to overall improvement in flu forecasting of public health-relevant targets. This is partially due to the relatively simple forecasting models that nowcasts are augmenting and partially because nowcasts do not directly inform all public health-relevant targets, such as the start, the peak timing, and the peak intensity of the flu season (i.e., seasonal targets). This paper conducts an experiment to provide clarity on the benefits and limitations of augmenting flu forecasting models with internet-based nowcasts in practice. We show that 1) nowcasts can improve flu forecasting across all geographic regions, flu seasons, and public health-relevant targets, including seasonal targets, and 2) the benefits of nowcasting are uneven, as even in the perfect nowcasting setting, only marginal improvements to forecasts of seasonal targets are possible relative to short-term forecasts. This is because nowcasts provide direct information about short-term targets but only indirect information about seasonal targets. This paper supports previous findings that nowcasts can improve flu forecasting but clarifies the limitations of those improvements, both in terms of magnitude of possible improvement as well as which targets can be improved. The continued advancement of flu forecasting hinges on the development of model improvements separate from nowcasting.

The study of microbial communities and their interactions has attracted the interest of the scientific community, because of their potential for applications in biotechnology, ecology and medicine. The complexity of interspecies interactions, which are key for the macroscopic behavior of microbial communities, cannot be studied easily experimentally. For this reason, the modeling of microbial communities has begun to leverage the knowledge of established constraint-based methods, which have long been used for studying and analyzing the microbial metabolism of individual species based on genome-scale metabolic reconstructions of microorganisms. A main problem of genome-scale metabolic reconstructions is that they usually contain metabolic gaps due to genome misannotations and unknown enzyme functions. This problem is traditionally solved by using gap-filling algorithms that add biochemical reactions from external databases to the metabolic reconstruction, in order to restore model growth. However, gap-filling algorithms could evolve by taking into account metabolic interactions among species that coexist in microbial communities. In this work, a gap-filling method that resolves metabolic gaps at the community level was developed. The efficacy of the algorithm was tested by analyzing its ability to resolve metabolic gaps on a synthetic community of auxotrophic Escherichia coli strains. Subsequently, the algorithm was applied to resolve metabolic gaps and predict metabolic interactions in a community of Bifidobacterium adolescentis and Faecalibacterium prausnitzii, two species present in the human gut microbiota, and in an experimentally studied community of Dehalobacter and Bacteroidales species of the ACT-3 community. The community gap-filling method can facilitate the improvement of metabolic models and the identification of metabolic interactions that are difficult to identify experimentally in microbial communities., Author summary Microbes are the most abundant form of life on earth and they are almost never found in isolation as they live in close association with one another and with other organisms. The metabolic capacity of individual microbial species dictates their ways of interacting with other species as well as with their environment. The metabolic interactions among microorganisms has been recognised as the driving force for the properties of microbial communities. For this reason, understanding the effect of microbial metabolism on interspecies metabolic interactions is essential for the study of microbial communities. This study can benefit from metabolic modeling and the insights offered by constraint-based methods which have been developed for interrogating metabolic models. In this paper, we present an algorithm that predicts cooperative and competitive metabolic interactions between species while it resolves metabolic gaps in their metabolic models in a computationally efficient way. We use our community gap-filling algorithm to study microbial communities with interesting environmental and health-related applications.

Because local field potentials (LFPs) arise from multiple sources in different spatial locations, they do not easily reveal coordinated activity across neural populations on a trial-to-trial basis. As we show here, however, once disparate source signals are decoupled, their trial-to-trial fluctuations become more accessible, and cross-population correlations become more apparent. To decouple sources we introduce a general framework for estimation of current source densities (CSDs). In this framework, the set of LFPs result from noise being added to the transform of the CSD by a biophysical forward model, while the CSD is considered to be the sum of a zero-mean, stationary, spatiotemporal Gaussian process, having fast and slow components, and a mean function, which is the sum of multiple time-varying functions distributed across space, each varying across trials. We derived biophysical forward models relevant to the data we analyzed. In simulation studies this approach improved identification of source signals compared to existing CSD estimation methods. Using data recorded from primate auditory cortex, we analyzed trial-to-trial fluctuations in both steady-state and task-evoked signals. We found cortical layer-specific phase coupling between two probes and showed that the same analysis applied directly to LFPs did not recover these patterns. We also found task-evoked CSDs to be correlated across probes, at specific cortical depths. Using data from Neuropixels probes in mouse visual areas, we again found evidence for depth-specific phase coupling of primary visual cortex and lateromedial area based on the CSDs., Author summary To better understand information processing in the brain, it is important to identify situations in which neural activity is coordinated across populations of neurons, including those in distinct layers of the cortex. Bulk population activity results in voltage changes across extracellular electrodes, but in raw form such voltage recordings can be hard to analyze and interpret. In this paper, we develop a novel framework for locating the sources of currents that produce the measured voltages, and decomposing those currents into interpretable components. We use this flexible framework to develop statistical methods of analysis, and we show that our methodology can be more effective than existing techniques for current source localization. We apply the method to extracellular recordings in two contexts: primate auditory cortex in response to tone stimuli, and mouse visual cortex in response to visual stimuli. In both cases, we get results that are useful for understanding cross-population activity while being difficult or impossible to obtain using the raw voltage signals. We thereby demonstrate the broad utility of our approach for identifying coordinated neural activity based on extracellular voltage recordings.

Voltage imaging enables monitoring neural activity at sub-millisecond and sub-cellular scale, unlocking the study of subthreshold activity, synchrony, and network dynamics with unprecedented spatio-temporal resolution. However, high data rates (>800MB/s) and low signal-to-noise ratios create bottlenecks for analyzing such datasets. Here we present VolPy, an automated and scalable pipeline to pre-process voltage imaging datasets. VolPy features motion correction, memory mapping, automated segmentation, denoising and spike extraction, all built on a highly parallelizable, modular, and extensible framework optimized for memory and speed. To aid automated segmentation, we introduce a corpus of 24 manually annotated datasets from different preparations, brain areas and voltage indicators. We benchmark VolPy against ground truth segmentation, simulations and electrophysiology recordings, and we compare its performance with existing algorithms in detecting spikes. Our results indicate that VolPy’s performance in spike extraction and scalability are state-of-the-art., Author summary Roughly 290 million electrical action potentials occur every second in the human brain, facilitating the propagation of signals among cells in the nervous system and driving most of our daily operations. New methods in brain imaging are emerging that have the speed and resolution to capture events in the brain at the pace at which neurons typically communicate. These methods measure voltage in neurons by using light, and therefore can access very detailed brain signaling patterns. However, the adoption of these methods by a larger community, and not a restricted set of experts, is limited by the lack of computational tools, thereby greatly hindering progress in this field. In this paper, we present VolPy, a software framework that greatly facilitates the preprocessing of this new type of imaging datasets. This pipeline incorporates efficient and optimized algorithms that can identify neurons and extract their activity with great accuracy. The presented software will make this new imaging modality accessible to a wide audience.

The cost of sequencing the genome is dropping at a much faster rate compared to assembling and finishing the genome. The use of lightly sampled genomes (genome-skims) could be transformative for genomic ecology, and results using k-mers have shown the advantage of this approach in identification and phylogenetic placement of eukaryotic species. Here, we revisit the basic question of estimating genomic parameters such as genome length, coverage, and repeat structure, focusing specifically on estimating the k-mer repeat spectrum. We show using a mix of theoretical and empirical analysis that there are fundamental limitations to estimating the k-mer spectra due to ill-conditioned systems, and that has implications for other genomic parameters. We get around this problem using a novel constrained optimization approach (Spline Linear Programming), where the constraints are learned empirically. On reads simulated at 1X coverage from 66 genomes, our method, REPeat SPECTra Estimation (RESPECT), had 2.2% error in length estimation compared to 27% error previously achieved. In shotgun sequenced read samples with contaminants, RESPECT length estimates had median error 4%, in contrast to other methods that had median error 80%. Together, the results suggest that low-pass genomic sequencing can yield reliable estimates of the length and repeat content of the genome. The RESPECT software will be publicly available at https://urldefense.proofpoint.com/v2/url?u=https-3A__github.com_shahab-2Dsarmashghi_RESPECT.git&d=DwIGAw&c=-35OiAkTchMrZOngvJPOeA&r=ZozViWvD1E8PorCkfwYKYQMVKFoEcqLFm4Tg49XnPcA&m=f-xS8GMHKckknkc7Xpp8FJYw_ltUwz5frOw1a5pJ81EpdTOK8xhbYmrN4ZxniM96&s=717o8hLR1JmHFpRPSWG6xdUQTikyUjicjkipjFsKG4w&e=., Author summary The cost of sequencing the genome is dropping at a much faster rate compared to assembling and finishing the genome. The use of lightly sampled genomes (genome skims) could be transformative for genomic ecology. Analyzing genome skims, mostly based on statistics of small oligomers, remains challenging, but recent results have shown the advantage of this approach for the identification and phylogenetic placement of eukaryotic species. In this paper, we present a method, RESPECT, to estimate genomic properties such as genome length and repetitiveness from low-coverage genome skims. We trained RESPECT using assembled genomes and tested it on low-coverage simulated and real reads. Benchmarking results reveal that RESPECT has excellent accuracy in estimating the genome length compared to other methods, and can provide critical information regarding the repeat structure of the genome.

Mycobacterium tuberculosis complex (MTC) CRISPR locus diversity has long been studied solely investigating the presence/absence of a known set of spacers. Unveiling the genetic mechanisms of its evolution requires a more exhaustive reconstruction in a large amount of representative strains. In this article, we point out and resolve, with a new pipeline, the problem of CRISPR reconstruction based directly on short read sequences in M. tuberculosis. We first show that the process we set up, that we coin as “CRISPRbuilder-TB” (https://github.com/cguyeux/CRISPRbuilder-TB), allows an efficient reconstruction of simulated or real CRISPRs, even when including complex evolutionary steps like the insertions of mobile elements. Compared to more generalist tools, the whole process is much more precise and robust, and requires only minimal manual investigation. Second, we show that more than 1/3 of the currently complete genomes available for this complex in the public databases contain largely erroneous CRISPR loci. Third, we highlight how both the classical experimental in vitro approach and the basic in silico spoligotyping provided by existing analytic tools miss a whole diversity of this locus in MTC, by not capturing duplications, spacer and direct repeats variants, and IS6110 insertion locations. This description is extended in a second article that describes MTC-CRISPR diversity and suggests general rules for its evolution. This work opens perspectives for an in-depth exploration of M. tuberculosis CRISPR loci diversity and of mechanisms involved in its evolution and its functionality, as well as its adaptation to other CRISPR locus-harboring bacterial species., Author summary In this article, we tackle the bioinformatical issue of the reconstruction of the Mycobacterium tuberculosis complex CRISPR locus using short read sequences without requiring genome assembly. We first show that many complete genomes, as found in public databases and often reconstructed by de novo assemblies, often contain errors on this locus as well as on other repeated sequences. We provide an in-depth description of our new method, designated as ‘CRISPRbuilder-TB’, and we show that our method provides much more exhaustive and reliable information (on DR variants, spacer diversity, global structure) than Crass and CRISPR_detector. The new and unsuspected genomic diversity we detected is described in a companion paper. Scripts are available to adapt the tool to other species.

A systematic and reproducible “workflow”—the process that moves a scientific investigation from raw data to coherent research question to insightful contribution—should be a fundamental part of academic data-intensive research practice. In this paper, we elaborate basic principles of a reproducible data analysis workflow by defining 3 phases: the Explore, Refine, and Produce Phases. Each phase is roughly centered around the audience to whom research decisions, methodologies, and results are being immediately communicated. Importantly, each phase can also give rise to a number of research products beyond traditional academic publications. Where relevant, we draw analogies between design principles and established practice in software development. The guidance provided here is not intended to be a strict rulebook; rather, the suggestions for practices and tools to advance reproducible, sound data-intensive analysis may furnish support for both students new to research and current researchers who are new to data-intensive work.

Disease epidemic outbreaks on human metapopulation networks are often driven by a small number of superspreader nodes, which are primarily responsible for spreading the disease throughout the network. Superspreader nodes typically are characterized either by their locations within the network, by their degree of connectivity and centrality, or by their habitat suitability for the disease, described by their reproduction number (R). Here we introduce a model that considers simultaneously the effects of network properties and R on superspreaders, as opposed to previous research which considered each factor separately. This type of model is applicable to diseases for which habitat suitability varies by climate or land cover, and for direct transmitted diseases for which population density and mitigation practices influences R. We present analytical models that quantify the superspreader capacity of a population node by two measures: probability-dependent superspreader capacity, the expected number of neighboring nodes to which the node in consideration will randomly spread the disease per epidemic generation, and time-dependent superspreader capacity, the rate at which the node spreads the disease to each of its neighbors. We validate our analytical models with a Monte Carlo analysis of repeated stochastic Susceptible-Infected-Recovered (SIR) simulations on randomly generated human population networks, and we use a random forest statistical model to relate superspreader risk to connectivity, R, centrality, clustering, and diffusion. We demonstrate that either degree of connectivity or R above a certain threshold are sufficient conditions for a node to have a moderate superspreader risk factor, but both are necessary for a node to have a high-risk factor. The statistical model presented in this article can be used to predict the location of superspreader events in future epidemics, and to predict the effectiveness of mitigation strategies that seek to reduce the value of R, alter host movements, or both., Author summary Infectious disease outbreaks on human mobility networks often are driven by a small number of superspreader individuals or communities, which are primarily responsible for propagating the disease throughout the network. In this paper, we introduce a model that considers how the properties of the network and spatial variance in disease transmission intensity (i.e., the reproduction number) due to social and ecological conditions interact to influence the occurrence of superspreaders. This type of model is applicable to diseases for which habitat suitability is influenced by climate or land cover, such as vector-borne diseases, and to directly transmitted diseases for which population density and practices to mitigate transmission may vary spatially. We present mathematical models that quantify the superspreader capacity of a population node, based on the extent area of the disease spread attributable to that node and the rate at which the disease spreads. We validate our models with a simulation of epidemic spread across randomly generated networks. The statistical model presented here can be used to predict the location of superspreader events in future epidemics and to predict the effectiveness of mitigation strategies that seek to reduce the disease reproduction rate, alter host movements, or both.

The interventions and outcomes in the ongoing COVID-19 pandemic are highly varied. The disease and the interventions both impose costs and harm on society. Some interventions with particularly high costs may only be implemented briefly. The design of optimal policy requires consideration of many intervention scenarios. In this paper we investigate the optimal timing of interventions that are not sustainable for a long period. Specifically, we look at at the impact of a single short-term non-repeated intervention (a “one-shot intervention”) on an epidemic and consider the impact of the intervention’s timing. To minimize the total number infected, the intervention should start close to the peak so that there is minimal rebound once the intervention is stopped. To minimise the peak prevalence, it should start earlier, leading to initial reduction and then having a rebound to the same prevalence as the pre-intervention peak rather than one very large peak. To delay infections as much as possible (as might be appropriate if we expect improved interventions or treatments to be developed), earlier interventions have clear benefit. In populations with distinct subgroups, synchronized interventions are less effective than targeting the interventions in each subcommunity separately., Author summary Some interventions which help control a spreading epidemic have significant adverse effects on the population, and cannot be maintained long-term. The optimal timing of such an intervention will depend on the ultimate goal. Interventions to delay the epidemic while new treatments or interventions are developed are best implemented as soon as possible.Interventions to minimize the peak prevalence are best implemented partway through the growth phase allowing immunity to build up so that the eventual rebound is not larger than the initial peak.Interventions to minimize the total number of infections are best implemented late in the growth phase to minimize the amount of rebound. For a population with subcommunities which would have asynchronous outbreaks, similar results hold. Additionally, we find that it is best to target the intervention asynchronously to each subcommunity rather than synchronously across the population.

Slow-wave sleep cortical brain activity, conformed by slow-oscillations and sleep spindles, plays a key role in memory consolidation. The increase of the power of the slow-wave events, obtained by auditory sensory stimulation, positively correlates with memory consolidation performance. However, little is known about the experimental protocol maximizing this effect, which could be induced by the power of slow-oscillation, the number of sleep spindles, or the timing of both events’ co-occurrence. Using a mean-field model of thalamocortical activity, we studied the effect of several stimulation protocols, varying the pulse shape, duration, amplitude, and frequency, as well as a target-phase using a closed-loop approach. We evaluated the effect of these parameters on slow-oscillations (SO) and sleep-spindles (SP), considering: (i) the power at the frequency bands of interest, (ii) the number of SO and SP, (iii) co-occurrences between SO and SP, and (iv) synchronization of SP with the up-peak of the SO. The first three targets are maximized using a decreasing ramp pulse with a pulse duration of 50 ms. Also, we observed a reduction in the number of SO when increasing the stimulus energy by rising its amplitude. To assess the target-phase parameter, we applied closed-loop stimulation at 0°, 45°, and 90° of the phase of the narrow-band filtered ongoing activity, at 0.85 Hz as central frequency. The 0° stimulation produces better results in the power and number of SO and SP than the rhythmic or random stimulation. On the other hand, stimulating at 45° or 90° change the timing distribution of spindles centers but with fewer co-occurrences than rhythmic and 0° phase. Finally, we propose the application of closed-loop stimulation at the rising zero-cross point using pulses with a decreasing ramp shape and 50 ms of duration for future experimental work., Author summary During the non-REM (NREM) phase of sleep, events that are known as slow oscillations (SO) and spindles (SP) can be detected by EEG. These events have been associated with the consolidation of declarative memories and learning. Thus, there is an ongoing interest in promoting them during sleep by non-invasive manipulations such as sensory stimulation. In this paper, we used a computational model of brain activity that generates SO and SP, to investigate which type of sensory stimulus –shape, amplitude, duration, periodicity– would be optimal for increasing the events’ frequency and their co-occurrence. We found that a decreasing ramp of 50 ms duration is the most effective. The effectiveness increases when the stimulus pulse is delivered in a closed-loop configuration triggering the pulse at a target phase of the ongoing SO activity. A desirable secondary effect is to promote SPs at the rising phase of the SO oscillation.

Increasingly complex in silico modeling approaches offer a way to simultaneously access cancerous processes at different spatio-temporal scales. High-level models, such as those based on partial differential equations, are computationally affordable and allow large tumor sizes and long temporal windows to be studied, but miss the discrete nature of many key underlying cellular processes. Individual-based approaches provide a much more detailed description of tumors, but have difficulties when trying to handle full-sized real cancers. Thus, there exists a trade-off between the integration of macroscopic and microscopic information, now widely available, and the ability to attain clinical tumor sizes. In this paper we put forward a stochastic mesoscopic simulation framework that incorporates key cellular processes during tumor progression while keeping computational costs to a minimum. Our framework captures a physical scale that allows both the incorporation of microscopic information, tracking the spatio-temporal emergence of tumor heterogeneity and the underlying evolutionary dynamics, and the reconstruction of clinically sized tumors from high-resolution medical imaging data, with the additional benefit of low computational cost. We illustrate the functionality of our modeling approach for the case of glioblastoma, a paradigm of tumor heterogeneity that remains extremely challenging in the clinical setting., Los enfoques de modelado in silico cada vez más complejos ofrecen una forma de acceder simultáneamente a procesos cancerosos en diferentes escalas espacio-temporales. Los modelos de alto nivel, como los que se basan en ecuaciones diferenciales parciales, son computacionalmente asequibles y permiten estudiar tumores de gran tamaño y ventanas temporales largas, pero pasan por alto la naturaleza discreta de muchos procesos celulares subyacentes clave. Los enfoques individuales brindan una descripción mucho más detallada de los tumores, pero tienen dificultades cuando se trata de tratar cánceres reales de tamaño completo. Por lo tanto, existe un compromiso entre la integración de información macroscópica y microscópica, ahora ampliamente disponible, y la capacidad de alcanzar tamaños de tumores clínicos. En este documento, presentamos un marco de simulación mesoscópica estocástica que incorpora procesos celulares clave durante la progresión del tumor y mantiene los costos computacionales al mínimo. Nuestro marco captura una escala física que permite la incorporación de información microscópica, el seguimiento de la aparición espacio-temporal de la heterogeneidad tumoral y la dinámica evolutiva subyacente, y la reconstrucción de tumores de tamaño clínico a partir de datos de imágenes médicas de alta resolución, con el beneficio adicional de bajo costo computacional. Ilustramos la funcionalidad de nuestro enfoque de modelado para el caso del glioblastoma, un paradigma de heterogeneidad tumoral que sigue siendo extremadamente desafiante en el entorno clínico. Nuestro marco captura una escala física que permite la incorporación de información microscópica, el seguimiento de la aparición espacio-temporal de la heterogeneidad tumoral y la dinámica evolutiva subyacente, y la reconstrucción de tumores de tamaño clínico a partir de datos de imágenes médicas de alta resolución, con el beneficio adicional de bajo costo computacional. Ilustramos la funcionalidad de nuestro enfoque de modelado para el caso del glioblastoma, un paradigma de heterogeneidad tumoral que sigue siendo extremadamente desafiante en el entorno clínico. Nuestro marco captura una escala física que permite la incorporación de información microscópica, el seguimiento de la aparición espacio-temporal de la heterogeneidad tumoral y la dinámica evolutiva subyacente, y la reconstrucción de tumores de tamaño clínico a partir de datos de imágenes médicas de alta resolución, con el beneficio adicional de bajo costo computacional. Ilustramos la funcionalidad de nuestro enfoque de modelado para el caso del glioblastoma, un paradigma de heterogeneidad tumoral que sigue siendo extremadamente desafiante en el entorno clínico.