Search

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.

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.

A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium., Author summary A game of rock-paper-scissors is more than just a children’s game. This type of interactions is often used to describe competition among animals or humans. A special feature of such an interaction is that none of the pure strategies dominates, resulting in a cyclic pattern. However, in wild communities such interactions are rarely observed by biologists. Our results suggest that this lack of cyclicity may stem from imperfectness of interacting individuals. In other words, we show analytically that heterogeneity in behavioural patterns may break a cyclic relationship and lead to a stable equilibrium in pure or mixed strategies.

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.

Surveillance is critical to mounting an appropriate and effective response to pandemics. However, aggregated case report data suffers from reporting delays and can lead to misleading inferences. Different from aggregated case report data, line list data is a table contains individual features such as dates of symptom onset and reporting for each reported case and a good source for modeling delays. Current methods for modeling reporting delays are not particularly appropriate for line list data, which typically has missing symptom onset dates that are non-ignorable for modeling reporting delays. In this paper, we develop a Bayesian approach that dynamically integrates imputation and estimation for line list data. Specifically, this Bayesian approach can accurately estimate the epidemic curve and instantaneous reproduction numbers, even with most symptom onset dates missing. The Bayesian approach is also robust to deviations from model assumptions, such as changes in the reporting delay distribution or incorrect specification of the maximum reporting delay. We apply the Bayesian approach to COVID-19 line list data in Massachusetts and find the reproduction number estimates correspond more closely to the control measures than the estimates based on the reported curve., Author summary Interventions meant to control infectious diseases are often determined and judged using surveillance data on the number of new cases of disease. In many diseases, there are substantial delays between the time when an individual is infected or shows symptoms and when the case is actually reported to a public health authority, such as the CDC. This reported data often collects information on symptom onset dates for some individuals. In this paper, we describe a method that imputes missing onset dates for all individuals and recreates the history of the disease progression in a population according to symptom onset dates, which are the best observable proxy available for infection dates. Our method also estimates the instantaneous reproduction number and is robust to many deviations from the assumptions of the model. We show, using a COVID-19 dataset from Massachusetts that our method accurately follows the implementation of control measures in the state.

Overfitting is one of the critical problems in developing models by machine learning. With machine learning becoming an essential technology in computational biology, we must include training about overfitting in all courses that introduce this technology to students and practitioners. We here propose a hands-on training for overfitting that is suitable for introductory level courses and can be carried out on its own or embedded within any data science course. We use workflow-based design of machine learning pipelines, experimentation-based teaching, and hands-on approach that focuses on concepts rather than underlying mathematics. We here detail the data analysis workflows we use in training and motivate them from the viewpoint of teaching goals. Our proposed approach relies on Orange, an open-source data science toolbox that combines data visualization and machine learning, and that is tailored for education in machine learning and explorative data analysis., Author summary Every teacher strives for an a-ha moment, a sudden revelation by the student who gained a fundamental insight she will always remember. In the past years, authors of this paper have been tailoring their courses in machine learning to include material that could lead students to such discoveries. We aim to expose machine learning to practitioners–not only computer scientists but also molecular biologists and students of biomedicine, that is, the end-users of bioinformatics’ computational approaches. In this article, we lay out a course that aims to teach about overfitting, one of the key concepts in machine learning that needs to be understood, mastered, and avoided in data science applications. We propose a hands-on approach that uses an open-source workflow-based data science toolbox that combines data visualization and machine learning. In the proposed training about overfitting, we first deceive the students, then expose the problem, and finally challenge them to find the solution. In the paper, we present three lessons in overfitting and associated data analysis workflows and motivate the use of introduced computation methods by relating them to concepts conveyed by instructors.

Human red blood cells (RBCs) have a circulatory lifespan of about four months. Under constant oxidative and mechanical stress, but devoid of organelles and deprived of biosynthetic capacity for protein renewal, RBCs undergo substantial homeostatic changes, progressive densification followed by late density reversal among others, changes assumed to have been harnessed by evolution to sustain the rheological competence of the RBCs for as long as possible. The unknown mechanisms by which this is achieved are the subject of this investigation. Each RBC traverses capillaries between 1000 and 2000 times per day, roughly one transit per minute. A dedicated Lifespan model of RBC homeostasis was developed as an extension of the RCM introduced in the previous paper to explore the cumulative patterns predicted for repetitive capillary transits over a standardized lifespan period of 120 days, using experimental data to constrain the range of acceptable model outcomes. Capillary transits were simulated by periods of elevated cell/medium volume ratios and by transient deformation-induced permeability changes attributed to PIEZO1 channel mediation as outlined in the previous paper. The first unexpected finding was that quantal density changes generated during single capillary transits cease accumulating after a few days and cannot account for the observed progressive densification of RBCs on their own, thus ruling out the quantal hypothesis. The second unexpected finding was that the documented patterns of RBC densification and late reversal could only be emulated by the implementation of a strict time-course of decay in the activities of the calcium and Na/K pumps, suggestive of a selective mechanism enabling the extended longevity of RBCs. The densification pattern over most of the circulatory lifespan was determined by calcium pump decay whereas late density reversal was shaped by the pattern of Na/K pump decay. A third finding was that both quantal changes and pump-decay regimes were necessary to account for the documented lifespan pattern, neither sufficient on their own. A fourth new finding revealed that RBCs exposed to levels of PIEZO1-medited calcium permeation above certain thresholds in the circulation could develop a pattern of early or late hyperdense collapse followed by delayed density reversal. When tested over much reduced lifespan periods the results reproduced the known circulatory fate of irreversible sickle cells, the cell subpopulation responsible for vaso-occlusion and for most of the clinical manifestations of sickle cell disease. Analysis of the results provided an insightful new understanding of the mechanisms driving the changes in RBC homeostasis during circulatory aging in health and disease.

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.

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.

Surveillance plays a crucial role in preventing emerging infectious diseases from becoming epidemic. In circumstances where it is possible to monitor the infection status of certain people, transport hubs, or hospitals, early detection of the disease allows interventions to be implemented before most of the damage can occur, or at least its impact can be mitigated. This paper addresses the question of which nodes we should select in a network of individuals susceptible to some infectious disease in order to minimize the number of casualties. By simulating disease outbreaks on a collection of empirical and synthetic networks we show that the best strategy depends on topological characteristics of the network. For highly modular or spatially embedded networks it is better to place the sentinels on nodes distributed across different regions. However, if the degree heterogeneity is high, then a strategy that targets network hubs is preferred. We further consider the consequences of having an incomplete sample of the network and demonstrate that the value of new information diminishes as more data is collected. Finally we find further marginal improvements using two heuristics informed by known results in graph theory that exploit the fragmented structure of sparse network data., Author summary In a network of individuals susceptible to some infectious disease, what are the best locations to monitor in order to detect the infection before most damage can be done? In this paper we address this question by considering various heuristic strategies for sentinel placement that can potentially be implemented in real-world situations without requiring excessive amounts of computation, or even having perfect data about the structure of the network. We find that strategies that attempt to distribute sentinels over different regions of the network perform best in highly modular or spatially embedded networks, whereas the strategy of targeting the most well connected individuals works best when there is a considerable amount of contact heterogeneity between individuals. Our results may be used as a guideline to help decide when certain strategies should, or should not, be implemented.

Dengue, a mosquito-borne infectious disease caused by the dengue viruses, is present in many parts of the tropical and subtropical regions of the world. All four serotypes of dengue viruses are endemic in Singapore, an equatorial city-state. Frequent outbreaks occur, sometimes leading to national epidemics. However, few studies have attempted to characterize breakpoints which precede large rises in dengue case counts. In this paper, Bayesian regime switching (BRS) models were employed to infer epidemic and endemic regimes of dengue transmissions, each containing regime specific autoregressive processes which drive the growth and decline of dengue cases, estimated using a custom built multi-move Gibbs sampling algorithm. Posterior predictive checks indicate that BRS replicates temporal trends in Dengue transmissions well and nowcast accuracy assessed using a post-hoc classification scheme showed that BRS classification accuracy is robust even under limited data with the AUC-ROC at 0.935. LASSO-based regression and bootstrapping was used to account for plausibly high dimensions of climatic factors affecting Dengue transmissions, which was then estimated using cross-validation to conduct statistical inference on long-run climatic effects on the estimated regimes. BRS estimates epidemic and endemic regimes of dengue in Singapore which are characterized by persistence across time, lasting an average of 20 weeks and 66 weeks respectively, with a low probability of transitioning away from their regimes. Climate analysis with LASSO indicates that long-run climatic effects up to 20 weeks ago do not differentiate epidemic and endemic regimes. Lastly, by fitting BRS to simulated disease data generated from a stochastic Susceptible-Infected-Recovered model, mechanistic links between infectivity and regimes classified using BRS were provided. The model proposed could be applied to other localities and diseases under minimal data requirements where transmission counts over time are collected., Author summary Dengue, a mosquito-borne infectious disease caused by the dengue viruses, is present in many parts of the tropical and subtropical regions of the world. All four serotypes of dengue viruses are endemic in Singapore, an equatorial city-state. Frequent outbreaks occur, sometimes leading to national epidemics. However, few studies have attempted to characterize breakpoints which precede large rises in dengue case counts. In this paper, Bayesian regime switching (BRS) models were employed to infer epidemic and endemic regimes of dengue transmissions, each containing regime specific processes which drive the growth and decline of dengue cases, estimated using a custom built multi-move Gibbs sampling algorithm. Assessments against various baseline showed that BRS performs better in characterizing dengue transmissions. The dengue regimes estimated by BRS are characterized by their persistent nature. Next, climate analysis showed no short nor long term associations between classified regimes with climate. Lastly, fitting BRS to simulated disease data generated from a mechanistic model, we showed links between disease infectivity and regimes classified using BRS. The model proposed could be applied to other localities and diseases under minimal data requirements where transmission counts over time are collected.

This paper uses mathematical modeling to study the mechanisms of surround suppression in the primate visual cortex. We present a large-scale neural circuit model consisting of three interconnected components: LGN and two input layers (Layer 4Ca and Layer 6) of the primary visual cortex V1, covering several hundred hypercolumns. Anatomical structures are incorporated and physiological parameters from realistic modeling work are used. The remaining parameters are chosen to produce model outputs that emulate experimentally observed size-tuning curves. Our two main results are: (i) we discovered the character of the long-range connections in Layer 6 responsible for surround effects in the input layers; and (ii) we showed that a net-inhibitory feedback, i.e., feedback that excites I-cells more than E-cells, from Layer 6 to Layer 4 is conducive to producing surround properties consistent with experimental data. These results are obtained through parameter selection and model analysis. The effects of nonlinear recurrent excitation and inhibition are also discussed. A feature that distinguishes our model from previous modeling work on surround suppression is that we have tried to reproduce realistic lengthscales that are crucial for quantitative comparison with data. Due to its size and the large number of unknown parameters, the model is computationally challenging. We demonstrate a strategy that involves first locating baseline values for relevant parameters using a linear model, followed by the introduction of nonlinearities where needed. We find such a methodology effective, and propose it as a possibility in the modeling of complex biological systems., Author summary The visual cortex is a part of the cortex that processes visual signal. The visual signal from the retina is relayed through the lateral geniculate nucleus (LGN), and enters the primary visual cortex directly. The primary visual cortex consists of many layers. A phenomenon called surround suppression, which means a reduction of neuronal activities in response to stimuli of increasing size, is well-observed in all layers of the primate primary visual cortex. In this paper, we built a large scale mathematical model consisting of the LGN input and tens of thousands of neuron groups in Layer 4 and Layer 6 of the primary visual cortex to study the mechanism of surround suppression. This model is constrained by both anatomical structures and realistic physiological parameters. Remaining unknown parameters are reverse-engineered from experimental data. We showed how the character of the surround suppression depends on the long-range connections in the feedback layer, as well as the feedback current from Layer 6 to Layer 4.

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.

Biological network figures are ubiquitous in the biology and medical literature. On the one hand, a good network figure can quickly provide information about the nature and degree of interactions between items and enable inferences about the reason for those interactions. On the other hand, good network figures are difficult to create. In this paper, we outline 10 simple rules for creating biological network figures for communication, from choosing layouts, to applying color or other channels to show attributes, to the use of layering and separation. These rules are accompanied by illustrative examples. We also provide a concise set of references and additional resources for each rule., Author summary Biological network figures are ubiquitous in the biology and medical literature. In this paper, we outline 10 simple rules for creating biological network figures for communication, from choosing layouts, to applying color or other channels to show attributes, to the use of layering and separation.

Striatal oscillatory activity is associated with movement, reward, and decision-making, and observed in several interacting frequency bands. Local field potential recordings in rodent striatum show dopamine- and reward-dependent transitions between two states: a “spontaneous” state involving β (∼15-30 Hz) and low γ (∼40-60 Hz), and a state involving θ (∼4-8 Hz) and high γ (∼60-100 Hz) in response to dopaminergic agonism and reward. The mechanisms underlying these rhythmic dynamics, their interactions, and their functional consequences are not well understood. In this paper, we propose a biophysical model of striatal microcircuits that comprehensively describes the generation and interaction of these rhythms, as well as their modulation by dopamine. Building on previous modeling and experimental work suggesting that striatal projection neurons (SPNs) are capable of generating β oscillations, we show that networks of striatal fast-spiking interneurons (FSIs) are capable of generating δ/θ (ie, 2 to 6 Hz) and γ rhythms. Under simulated low dopaminergic tone our model FSI network produces low γ band oscillations, while under high dopaminergic tone the FSI network produces high γ band activity nested within a δ/θ oscillation. SPN networks produce β rhythms in both conditions, but under high dopaminergic tone, this β oscillation is interrupted by δ/θ-periodic bursts of γ-frequency FSI inhibition. Thus, in the high dopamine state, packets of FSI γ and SPN β alternate at a δ/θ timescale. In addition to a mechanistic explanation for previously observed rhythmic interactions and transitions, our model suggests a hypothesis as to how the relationship between dopamine and rhythmicity impacts motor function. We hypothesize that high dopamine-induced periodic FSI γ-rhythmic inhibition enables switching between β-rhythmic SPN cell assemblies representing the currently active motor program, and thus that dopamine facilitates movement in part by allowing for rapid, periodic shifts in motor program execution., Author summary Striatal oscillatory activity is associated with movement, reward, and decision-making, and observed in several interacting frequency bands. The mechanisms underlying these rhythmic dynamics, their interactions, and their functional consequences are not well understood. In this paper, we propose a biophysical model of striatal microcircuits that comprehensively describes the generation and interaction of striatal rhythms, as well as their modulation by dopamine. Our model suggests a hypothesis as to how the relationship between dopamine and rhythmicity impacts the function of the motor system, enabling rapid, periodic shifts in motor program execution.

As antimicrobial resistance increases, it is crucial to develop new treatment strategies to counter the emerging threat. In this paper, we consider combination therapies involving conventional antibiotics and debridement, coupled with a novel anti-adhesion therapy, and their use in the treatment of antimicrobial resistant burn wound infections. Our models predict that anti-adhesion–antibiotic–debridement combination therapies can eliminate a bacterial infection in cases where each treatment in isolation would fail. Antibiotics are assumed to have a bactericidal mode of action, killing bacteria, while debridement involves physically cleaning a wound (e.g. with a cloth); removing free bacteria. Anti-adhesion therapy can take a number of forms. Here we consider adhesion inhibitors consisting of polystyrene microbeads chemically coupled to a protein known as multivalent adhesion molecule 7, an adhesin which mediates the initial stages of attachment of many bacterial species to host cells. Adhesion inhibitors competitively inhibit bacteria from binding to host cells, thus rendering them susceptible to removal through debridement. An ordinary differential equation model is developed and the antibiotic-related parameters are fitted against new in vitro data gathered for the present study. The model is used to predict treatment outcomes and to suggest optimal treatment strategies. Our model predicts that anti-adhesion and antibiotic therapies will combine synergistically, producing a combined effect which is often greater than the sum of their individual effects, and that anti-adhesion–antibiotic–debridement combination therapy will be more effective than any of the treatment strategies used in isolation. Further, the use of inhibitors significantly reduces the minimum dose of antibiotics required to eliminate an infection, reducing the chances that bacteria will develop increased resistance. Lastly, we use our model to suggest treatment regimens capable of eliminating bacterial infections within clinically relevant timescales., Author summary Since the development of the first antibiotics, bacteria have utilised and developed resistance mechanisms, helping them to avoid being eliminated and to survive within a host. Traditionally, the solution to this problem has been to treat with multiple antibiotics, switching to a new type when the one currently in use proves ineffective. However, the development of antibiotics has slowed significantly in the past two decades, while multi-drug resistant strains, otherwise known as ‘super bugs’, are on the rise. In answer to this challenge, alternative approaches, such as anti-adhesion therapy, are being developed as a complement or alternative to traditional antimicrobials. In this paper we formulate and analyse a mathematical model of a combination therapy, applied in the context of an infected burn wound, bringing together antibiotics, anti-adhesion therapy and debridement (the physical cleaning of a wound). We use our models to make sense of how these treatments interact to combat a bacterial infection, to predict treatment outcomes for a range of strategies and to suggest optimal treatment regimens. It is hoped that this study will guide future experimental and clinical research, helping biomedical researchers to identify the most promising approaches to treatment.

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.

The presence of treatment-resistant cells is an important factor that limits the efficacy of cancer therapy, and the prospect of resistance is considered the major cause of the treatment strategy. Several recent studies have employed mathematical models to elucidate the dynamics of generating resistant cancer cells and attempted to predict the probability of emerging resistant cells. The purpose of this paper is to present numerical approach to compute the number of resistant cells and the emerging probability of resistance. Stochastic model was designed and developed a method to approximately but efficiently compute the number of resistant cells and the probability of resistance. To model the progression of cancer, a discrete-state, two-dimensional Markov process whose states are the total number of cells and the number of resistant cells was employed. Then exact analysis and approximate aggregation approaches were proposed to calculate the number of resistant cells and the probability of resistance when the cell population reaches detection size. To confirm the accuracy of computed results of approximation, relative errors between exact analysis and approximation were computed. The numerical values of our approximation method were very close to those of exact analysis calculated in the range of small detection size M = 500, 100, and 1500. Then computer simulation was performed to confirm the accuracy of computed results of approximation when the detection size was M = 10000,30000,50000,100000 and 1000000. All the numerical results of approximation fell between the upper level and the lower level of 95% confidential intervals and our method took less time to compute over a broad range of cell size. The effects of parameter change on emerging probabilities of resistance were also investigated by computed values using approximation method. The results showed that the number of divisions until the cell population reached the detection size is important for emerging the probability of resistance. The next step of numerical approach is to compute the emerging probabilities of resistance under drug administration and with multiple mutation. Another effective approximation would be necessary for the analysis of the latter case., Author summary Drug therapies for cancer have dramatically succeeded since molecular-targeted drugs have been introduced in medical practice; however, drug treatment often fails owing to the emergence of drug-resistant cells. A variety of approaches, including mathematical modeling, has been undertaken to clarify the mechanism of resistance and subsequently avoid resistance to therapy. This paper proposes one of the mathematical approaches that uses a stochastic model and provides the emerging probabilities of resistance at detection size.

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/.

Individuals differ widely in their contribution to the spread of infection within and across populations. Three key epidemiological host traits affect infectious disease spread: susceptibility (propensity to acquire infection), infectivity (propensity to transmit infection to others) and recoverability (propensity to recover quickly). Interventions aiming to reduce disease spread may target improvement in any one of these traits, but the necessary statistical methods for obtaining risk estimates are lacking. In this paper we introduce a novel software tool called SIRE (standing for “Susceptibility, Infectivity and Recoverability Estimation”), which allows for the first time simultaneous estimation of the genetic effect of a single nucleotide polymorphism (SNP), as well as non-genetic influences on these three unobservable host traits. SIRE implements a flexible Bayesian algorithm which accommodates a wide range of disease surveillance data comprising any combination of recorded individual infection and/or recovery times, or disease diagnostic test results. Different genetic and non-genetic regulations and data scenarios (representing realistic recording schemes) were simulated to validate SIRE and to assess their impact on the precision, accuracy and bias of parameter estimates. This analysis revealed that with few exceptions, SIRE provides unbiased, accurate parameter estimates associated with all three host traits. For most scenarios, SNP effects associated with recoverability can be estimated with highest precision, followed by susceptibility. For infectivity, many epidemics with few individuals give substantially more statistical power to identify SNP effects than the reverse. Importantly, precise estimates of SNP and other effects could be obtained even in the case of incomplete, censored and relatively infrequent measurements of individuals’ infection or survival status, albeit requiring more individuals to yield equivalent precision. SIRE represents a new tool for analysing a wide range of experimental and field disease data with the aim of discovering and validating SNPs and other factors controlling infectious disease transmission., Author summary Effective approaches to reduce the spread of infectious disease transmission in populations are urgently needed. Reduction in disease spread is most effectively achieved by reducing, separately or in combination, individual (i) “susceptibility”, i.e. the relative risk to become infected when exposed to infectious individuals or material, (ii) “infectivity”, i.e. the propensity to transmit infection to others when infected, and/or by (iii) improving “recoverability”, i.e. the propensity to recover. However, to date it is impossible to assess how these three key epidemiological traits controlling disease transmission in a population are regulated by specific genes or interventions, as the necessary statistical methods for estimating genetic and non-genetic effects from available disease surveillance data don’t exist. This paper introduces a novel statistical method that can estimate, for the first time, genetic and non-genetic effects for host susceptibility, infectivity and recoverability simultaneously from a wide range of realistic disease surveillance data. The method has been incorporated into a user-friendly, freely available software tool called SIRE. SIRE can be applied to a range of experimental and field data and will help to move disease control significantly forward by simultaneously targeting multiple host traits affecting infectious disease spread.

[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.

Dengue is an arbovirus affecting global populations. Frequent outbreaks occur, especially in equatorial cities such as Singapore, where year-round tropical climate, large daily influx of travelers and population density provide the ideal conditions for dengue to transmit. Little work has, however, quantified the peaks of dengue outbreaks, when health systems are likely to be most stretched. Nor have methods been developed to infer differences in exogenous factors which lead to the rise and fall of dengue case counts across extreme and non-extreme periods. In this paper, we developed time varying extreme mixture (tvEM) methods to account for the temporal dependence of dengue case counts across extreme and non-extreme periods. This approach permits inference of differences in climatic forcing across non-extreme and extreme periods of dengue case counts, quantification of their temporal dependence as well as estimation of thresholds with associated uncertainties to determine dengue case count extremities. Using tvEM, we found no evidence that weather affects dengue case counts in the near term for non-extreme periods, but that it has non-linear and mixed signals in influencing dengue through tvEM parameters in the extreme periods. Using the most appropriate tvEM specification, we found that a threshold at the 70th (95% credible interval 41.1, 83.8) quantile is optimal, with extreme events of 526.6, 1052.2 and 1183.6 weekly case counts expected at return periods of 5, 50 and 75 years. Weather parameters at a 1% scaled increase was found to decrease the long-run expected case counts, but larger increases would lead to a drastic expected rise from the baseline correspondingly. The tvEM approach can provide valuable inference on the extremes of time series, which in the case of infectious disease notifications, allows public health officials to understand the likely scale of outbreaks in the long run., Author summary Dengue is an arbovirus affecting populations across much of the globe. Frequent outbreaks occur, especially in equatorial cities such as Singapore, where the year-round tropical climate, large daily influx of travelers and population density provide the ideal conditions for dengue transmission. Little work has however quantified the peaks of dengue outbreaks, when health systems are likely to be most stretched. Nor have methods been developed to infer differences in exogenous factors which lead to the rise and fall of dengue case counts across extreme and non extreme periods. In this paper, we developed time varying extreme mixture (tvEM) methods to account for the temporal dependence of dengue case counts across extreme and non-extreme periods. tvEM is able to infer differences in climatic forcing across non-extreme and extreme periods of dengue case counts, their temporal dependence as well as estimate suitable thresholds with associated uncertainties to determine dengue case count extremities. Using tvEM, we found no evidence that weather affects dengue case counts in the near term for non extreme periods, but has non-linear and mixed signals in influencing dengue through tvEM parameters in the extreme periods. Using the most appropriate tvEM specification, we found that a high percentile threshold is estimated, with dengue outbreak events far larger than currently observed to be expected in 5, 50 and 75 years. Weather parameters at a 1% scaled increase was found to decrease the long-run expected case counts, but larger increases would lead to a drastic expected rise from the baseline correspondingly. tvEM can provide valuable inference on the extremes of time series, which in the case of infectious disease data, allows public health officials to understand factors and the likely scale of infectious disease outbreaks in the long run.

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.

Integrated Information Theory (IIT) has become nowadays the most sensible general theory of consciousness. In addition to very important statements, it opens the door for an abstract (mathematical) formulation of the theory. Given a mechanism in a particular state, IIT identifies a conscious experience with a conceptual structure, an informational object which exists, is composed of identified parts, is informative, integrated and maximally irreducible. This paper introduces a space-time continuous version of the concept of integrated information. To this aim, a graph and a dynamical systems treatment is used to define, for a given mechanism in a state for which a dynamics is settled, an Informational Structure, which is associated to the global attractor at each time of the system. By definition, the informational structure determines all the past and future behavior of the system, possesses an informational nature and, moreover, enriches all the points of the phase space with cause-effect power by means of its associated Informational Field. A detailed description of its inner structure by invariants and connections between them allows to associate a transition probability matrix to each informational structure and to develop a measure for the level of integrated information of the system., Author summary In this paper we introduce a space-time continuous version for the level of integrated information of a network on which a dynamics is defined. The concept of integrated information comes from the IIT of consciousness. By a strict mathematical formulation, we complement the existing IIT theoretical framework from a dynamical systems perspective. In other words, we develop the bases for a continuous mathematical approach to IIT introducing a dynamical system as the driving rule of a given mechanism. We also introduce and define the concepts of Informational Structure and Informational Field as the complex network with the power to ascertain the dynamics (past and future scenarios) of the studied phenomena. The detailed description of an informational structure is showing the cause-effect power of a mechanism in a state and thus, a characterization of the quantity and quality of information, and the way this is integrated. We firstly introduce how network patterns arise from dynamic phenomena on networks, leading to the concept of informational structure. Then, we formally introduce the mathematical objects supporting the theory, from graphs to informational structures, throughout the integration of dynamics on graphs with a global model of differential equations. After this, we formally present some of the IIT’s postulates associated to a given mechanism. Finally, we provide the quantitative and qualitative characterization of the integrated information, and how it depends on the geometry of the mechanism.

Most objects and vegetation making up the habitats of echolocating bats return a multitude of overlapping echoes. Recent evidence suggests that the limited temporal and spatial resolution of bio-sonar prevents bats from separately perceiving the objects giving rise to these overlapping echoes. Therefore, bats often operate under conditions where their ability to localize obstacles is severely limited. Nevertheless, bats excel at avoiding complex obstacles. In this paper, we present a robotic model of bat obstacle avoidance using interaural level differences and distance to the nearest obstacle as the minimal set of cues. In contrast to previous robotic models of bats, the current robot does not attempt to localize obstacles. We evaluate two obstacle avoidance strategies. First, the Fixed Head Strategy keeps the acoustic gaze direction aligned with the direction of flight. Second, the Delayed Linear Adaptive Law (DLAL) Strategy uses acoustic gaze scanning, as observed in hunting bats. Acoustic gaze scanning has been suggested to aid the bat in hunting for prey. Here, we evaluate its adaptive value for obstacle avoidance when obstacles can not be localized. The robot’s obstacle avoidance performance is assessed in two environments mimicking (highly cluttered) experimental setups commonly used in behavioral experiments: a rectangular arena containing multiple complex cylindrical reflecting surfaces and a corridor lined with complex reflecting surfaces. The results indicate that distance to the nearest object and interaural level differences allows steering the robot clear of obstacles in environments that return non-localizable echoes. Furthermore, we found that using acoustic gaze scanning reduced performance, suggesting that gaze scanning might not be beneficial under conditions where the animal has limited access to angular information, which is in line with behavioral evidence., Author summary The sonar system of bats provides only limited information about the location of obstacles. In particular, it is unlikely that bats can localize multiple, complex obstacles that return a multitude of interfering echoes. Nevertheless, these animals can fly swiftly through densely cluttered habits. To explain how bats do this, we proposed they only need to compare the loudness of the echoes at the left and the right ear. If the echoes at the left ear are louder than at the right ear, obstacles are probably located to the left. Therefore, the bat should bank right (and vice versa). In this paper, we test whether such a simple strategy would allow bats to avoid obstacles. We equipped a robot with a sonar system resembling that of a bat, and we implemented the obstacle avoidance strategy above. We tested this robotic bat in environments mimicking those used in experimental studies of their sonar behavior. The robot was able to avoid most of the obstacles in both environments. Therefore, we conclude that bats could rely on a simple strategy when avoiding obstacles in complex environments.

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.

A biophysical model that captures molecular homeostatic control of ions at the perisynaptic cradle (PsC) is of fundamental importance for understanding the interplay between astroglial and neuronal compartments. In this paper, we develop a multi-compartmental mathematical model which proposes a novel mechanism whereby the flow of cations in thin processes is restricted due to negatively charged membrane lipids which result in the formation of deep potential wells near the dipole heads. These wells restrict the flow of cations to “hopping” between adjacent wells as they transverse the process, and this surface retention of cations will be shown to give rise to the formation of potassium (K+) and sodium (Na+) microdomains at the PsC. We further propose that a K+ microdomain formed at the PsC, provides the driving force for the return of K+ to the extracellular space for uptake by the neurone, thereby preventing K+ undershoot. A slow decay of Na+ was also observed in our simulation after a period of glutamate stimulation which is in strong agreement with experimental observations. The pathological implications of microdomain formation during neuronal excitation are also discussed., Author summary During periods of neuronal activity, ionic homeostasis in the surrounding extracellular space (ECS) is disturbed. To provide a healthy environment for continued neuronal function, excess ions such as potassium must be buffered away from the ECS; a vital supportive role provided by astrocyte cells. It has long been thought that astrocytes not only removed ions from the ECS but also transport them to other areas of the brain where their concentrations are lower. However, while our computational model simulations agree that astrocytes do remove these ions from the ECS they also show that these ions are mainly stored locally at the PsC to be returned to the ECS, thus restoring ionic homeostasis. Furthermore, we detail in this paper that this happens because of a previously overlooked biophysical phenomenon that is only dominant in thin astrocyte processes. The flow of these cations within thin processes is primarily by surface conduction where they experience the attraction of fixed negative charge at the membrane inner surface. This negative charge constrains cation movement along the surface and so their flow rate is restricted. Consequently, ions such as potassium that are released during neuronal excitation enter the PsC and are stored locally due to the low conductance pathway between the PsC and the astrocyte soma. Our simulations also show that this local build-up of K+ is returned to the ECS after the neuronal activity dies off which could potentially explain why K+ undershoot has not been observed; this result agrees with experimental observations. Moreover, the same mechanism can also explain the transient behaviour of Na+ ions whereby in thin processes a slow decay time constant is experimentally observed. These findings have important implications for the role of astrocytes in regulating neuronal excitability under physiological and pathological conditions, and therefore highlight the significance of the work presented in this paper.

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.

Cancer cells share several metabolic traits, including aerobic production of lactate from glucose (Warburg effect), extensive glutamine utilization and impaired mitochondrial electron flow. It is still unclear how these metabolic rearrangements, which may involve different molecular events in different cells, contribute to a selective advantage for cancer cell proliferation. To ascertain which metabolic pathways are used to convert glucose and glutamine to balanced energy and biomass production, we performed systematic constraint-based simulations of a model of human central metabolism. Sampling of the feasible flux space allowed us to obtain a large number of randomly mutated cells simulated at different glutamine and glucose uptake rates. We observed that, in the limited subset of proliferating cells, most displayed fermentation of glucose to lactate in the presence of oxygen. At high utilization rates of glutamine, oxidative utilization of glucose was decreased, while the production of lactate from glutamine was enhanced. This emergent phenotype was observed only when the available carbon exceeded the amount that could be fully oxidized by the available oxygen. Under the latter conditions, standard Flux Balance Analysis indicated that: this metabolic pattern is optimal to maximize biomass and ATP production; it requires the activity of a branched TCA cycle, in which glutamine-dependent reductive carboxylation cooperates to the production of lipids and proteins; it is sustained by a variety of redox-controlled metabolic reactions. In a K-ras transformed cell line we experimentally assessed glutamine-induced metabolic changes. We validated computational results through an extension of Flux Balance Analysis that allows prediction of metabolite variations. Taken together these findings offer new understanding of the logic of the metabolic reprogramming that underlies cancer cell growth., Author summary Hallmarks describing common key events in initiation, maintenance and progression of cancer have been identified. One hallmark deals with rewiring of metabolic reactions required to sustain enhanced cell proliferation. The availability of molecular, mechanistic models of cancer hallmarks will mightily improve optimized personal treatment and new drug discovery. Metabolism is the only hallmark for which it is currently possible to derive large scale mathematical models, which have predictive ability. In this paper, we exploit a constraint-based model of the core metabolism required for biomass conversion of the most relevant nutrients—glucose and glutamine—to clarify the logic of control of cancer metabolism. We newly report that, when available oxygen is not sufficient to fully oxidize available glucose and glutamine carbons–a situation compatible with that observed under normal oxygen conditions in human and in cancer cells growing in vitro—utilization of glutamine by reductive carboxylation and conversion of glucose and glutamine to lactate confer advantage for biomass production. Redox homeostasis can be maintained through the use of different alternative pathways. In conclusion, this paper offers a logic interpretation to the link between metabolic rewiring and enhanced proliferation, which may offer new approaches to targeted drug discovery and utilization.

A recent paper by Karin et al. introduced a mathematical notion called dynamical compensation (DC) of biological circuits. DC was shown to play an important role in glucose homeostasis as well as other key physiological regulatory mechanisms. Karin et al. went on to provide a sufficient condition to test whether a given system has the DC property. Here, we show how DC can be formulated in terms of a well-known concept in systems biology, statistics, and control theory—that of parameter structural non-identifiability. Viewing DC as a parameter identification problem enables one to take advantage of powerful theoretical and computational tools to test a system for DC. We obtain as a special case the sufficient criterion discussed by Karin et al. We also draw connections to system equivalence and to the fold-change detection property., Author summary A recently introduced mathematical notion called dynamical compensation of biological circuits was shown to play an important role in glucose homeostasis and other key physiological regulatory mechanisms. This paper explains how dynamical compensation can be formulated in terms of a well-known concept in systems biology, statistics, and control theory—that of parameter structural non-identifiability. Viewing dynamical compensation as a parameter identification problem enables one to take advantage of powerful theoretical and computational tools to test a system for dynamical compensation. As a special case, one obtains the sufficient criterion for dynamical compensation. The paper also draws connections to system equivalence and to the fold-change detection property. The non-identifiability characterization brings up an interesting contrast in the way in which one thinks of these properties in the two fields. From the point of view of robustness of behavior, one wishes that parameters do not influence much the response of a system. On the other hand, from the systems and parameter identification point of view, the more that a parameter affects behavior, the easier it is to estimate it, and poor sensitivity is taken as an indication of a poorly parametrized model.

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.

13C metabolic flux analysis (13C-MFA) has been widely used to measure in vivo enzyme reaction rates (i.e., metabolic flux) in microorganisms. Mining the relationship between environmental and genetic factors and metabolic fluxes hidden in existing fluxomic data will lead to predictive models that can significantly accelerate flux quantification. In this paper, we present a web-based platform MFlux (http://mflux.org) that predicts the bacterial central metabolism via machine learning, leveraging data from approximately 100 13C-MFA papers on heterotrophic bacterial metabolisms. Three machine learning methods, namely Support Vector Machine (SVM), k-Nearest Neighbors (k-NN), and Decision Tree, were employed to study the sophisticated relationship between influential factors and metabolic fluxes. We performed a grid search of the best parameter set for each algorithm and verified their performance through 10-fold cross validations. SVM yields the highest accuracy among all three algorithms. Further, we employed quadratic programming to adjust flux profiles to satisfy stoichiometric constraints. Multiple case studies have shown that MFlux can reasonably predict fluxomes as a function of bacterial species, substrate types, growth rate, oxygen conditions, and cultivation methods. Due to the interest of studying model organism under particular carbon sources, bias of fluxome in the dataset may limit the applicability of machine learning models. This problem can be resolved after more papers on 13C-MFA are published for non-model species., Author Summary Metabolic information is important for disease treatment, bioprocess optimization, environmental remediation, biogeochemical cycle regulation, and our understanding of life’s origin and evolution. 13C-MFA can quantify microbial physiology at the level of metabolic reaction rates. To speed up microbial characterizations and fluxomic studies, we hypothesize that genetic and environmental factors generate specific fluxome patterns that can be recognized by machine learning. Aided by constraint programming and quadratic optimization, our platform based on machine learning (ML) can predict meaningful metabolic information about bacterial species in their environments. Further, it can offer constraints to improve the accuracy of flux balance analysis. This study infers that the bacterial metabolic network has a certain degree of rigidity in allocating carbon fluxes, and different microbial species may share common regulatory strategies for balancing carbon and energy metabolisms. As a proof of concept, we demonstrate that the use of data-driven artificial intelligence (AI) approaches, e.g., ML, may assist mechanistic based models to elucidate the topology of microbial fluxomes.

As science becomes increasingly interdisciplinary, we are expected to acquire both breadth of knowledge and depth of expertise. In bioinformatics, this is especially true. Keeping up to date with major techniques across multiple specialisations can be daunting, but you need not face it alone. A journal club is an excellent way to take in the scientific literature, keep up with developments in your field, and hone your communication and analytical skills. In general, a journal club is a group of people who meet regularly to discuss one or more scientific papers. The structure of such a club can vary. In the more traditional format, an individual studies a paper and then presents it to the group, usually in the form of PowerPoint slides, with time for questions. In some institutions, the journal club is for students only, designed to fulfill the requirements of a course or postgraduate program; attendance is obligatory, the scope of the literature is narrow, and the format is prescribed. The preparation of slides and a lecture may be required. Other kinds of journal clubs are just lab meetings in disguise, with the usual lab head and group members in attendance and one member nominated to present the paper. A formal style often fits well within an established academic structure—but what if your discipline is emerging? Consider the field of bioinformatics. Expertise may be spread across departments and institutions, and there may not be an obvious place or critical mass in any one lab for a traditional journal club. Research students, “pet bioinformaticians,” [1] and those interested in bioinformatics from adjoining fields all need a place to gather. We are pleased to offer an alternative structure to address this situation—an informal journal club, designed to bring together a diversity of backgrounds and career stages to discuss bioinformatics while building a network of like-minded peers. Additional benefits of such a journal club may include friendship and breakfast (see Rule 2)! We thoroughly recommend it to anyone who asks (as well as those who don’t). While this advice is drawn from our experiences in the Parkville Bioinformatics Journal Club, it is applicable to developing informal journal clubs of all disciplines. The advice contained in these rules will also help those who want to spice up their existing formal format. So don’t be a “lonely bioinformatician”[1], create a journal club! Follow these Ten Simple Rules to find out how.

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.

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.

There are two distinct classes of cells in the primary visual cortex (V1): simple cells and complex cells. One defining feature of complex cells is their spatial phase invariance; they respond strongly to oriented grating stimuli with a preferred orientation but with a wide range of spatial phases. A classical model of complete spatial phase invariance in complex cells is the energy model, in which the responses are the sum of the squared outputs of two linear spatially phase-shifted filters. However, recent experimental studies have shown that complex cells have a diverse range of spatial phase invariance and only a subset can be characterized by the energy model. While several models have been proposed to explain how complex cells could learn to be selective to orientation but invariant to spatial phase, most existing models overlook many biologically important details. We propose a biologically plausible model for complex cells that learns to pool inputs from simple cells based on the presentation of natural scene stimuli. The model is a three-layer network with rate-based neurons that describes the activities of LGN cells (layer 1), V1 simple cells (layer 2), and V1 complex cells (layer 3). The first two layers implement a recently proposed simple cell model that is biologically plausible and accounts for many experimental phenomena. The neural dynamics of the complex cells is modeled as the integration of simple cells inputs along with response normalization. Connections between LGN and simple cells are learned using Hebbian and anti-Hebbian plasticity. Connections between simple and complex cells are learned using a modified version of the Bienenstock, Cooper, and Munro (BCM) rule. Our results demonstrate that the learning rule can describe a diversity of complex cells, similar to those observed experimentally., Author summary Many cortical functions originate from the learning ability of the brain. How the properties of cortical cells are learned is vital for understanding how the brain works. There are many models that explain how V1 simple cells can be learned. However, how V1 complex cells are learned still remains unclear. In this paper, we propose a model of learning in complex cells based on the Bienenstock, Cooper, and Munro (BCM) rule. We demonstrate that properties of receptive fields of complex cells can be learned using this biologically plausible learning rule. Quantitative comparisons between the model and experimental data are performed. Results show that model complex cells can account for the diversity of complex cells found in experimental studies. In summary, this study provides a plausible explanation for how complex cells can be learned using biologically plausible plasticity mechanisms. Our findings help us to better understand biological vision processing and provide us with insights into the general signal processing principles that the visual cortex employs to process visual information.

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.

Gene function annotation is important for a variety of downstream analyses of genetic data. But experimental characterization of function remains costly and slow, making computational prediction an important endeavor. Phylogenetic approaches to prediction have been developed, but implementation of a practical Bayesian framework for parameter estimation remains an outstanding challenge. We have developed a computationally efficient model of evolution of gene annotations using phylogenies based on a Bayesian framework using Markov Chain Monte Carlo for parameter estimation. Unlike previous approaches, our method is able to estimate parameters over many different phylogenetic trees and functions. The resulting parameters agree with biological intuition, such as the increased probability of function change following gene duplication. The method performs well on leave-one-out cross-validation, and we further validated some of the predictions in the experimental scientific literature., Author summary Understanding the individual roles that genes play in life is a key issue in biomedical science. While information regarding gene functions is continuously growing, the number of genes with uncharacterized biological functions is still greater. Because of this, scientists have dedicated much of their time to build and design tools that automatically infer gene functions. One of the most promising approaches (sometimes called “phylogenomics”) attempts to construct a model of inheritance and divergence of function along branches of the phylogenetic tree that relates different members of a gene family. If the functions of one or more of the family members has been characterized experimentally, the presence or absence of these functions for other family members can be predicted, in a probabilistic framework, based on the evolutionary relationships. Previously proposed Bayesian approaches to parameter estimation have proved to be computationally intractable, preventing development of such a probabilistic model. In this paper, we present a simple model of gene-function evolution that is highly scalable, which means that it is possible to perform parameter estimation not only on one family, but simultaneously for hundreds of gene families, comprising thousands of genes. The parameter estimates we obtain coherently agree with what theory dictates regarding how gene-functions evolved. Finally, notwithstanding its simplicity, the model’s prediction quality is comparable to other more complex alternatives. Although we believe further improvements can be made to our model, even this simple model makes verifiable predictions, and suggests areas in which existing annotations show inconsistencies that may indicate errors or controversies.