Biological Motion Coding in the Brain: Analysis of Visually Driven EEG Functional Networks

Herein, we address the time evolution of brain functional networks computed from electroencephalographic activity driven by visual stimuli. We describe how these functional network signatures change in fast scale when confronted with point-light display stimuli depicting biological motion (BM) as opposed to scrambled motion (SM). Whereas global network measures (average path length, average clustering coefficient, and average betweenness) computed as a function of time did not discriminate between BM and SM, local node properties did. Comparing the network local measures of the BM condition with those of the SM condition, we found higher degree and betweenness values in the left frontal (F7) electrode, as well as a higher clustering coefficient in the right occipital (O2) electrode, for the SM condition. Conversely, for the BM condition, we found higher degree values in central parietal (Pz) electrode and a higher clustering coefficient in the left parietal (P3) electrode. These results are discussed in the context of the brain networks involved in encoding BM versus SM.     

Biological Time Series Analysis Using a Context Free Language: Applicability to Pulsatile Hormone Data

We present a novel approach for analyzing biological time-series data using a context-free language (CFL) representation that allows the extraction and quantification of important features from the time-series. This representation results in Hierarchically AdaPtive (HAP) analysis, a suite of multiple complementary techniques that enable rapid analysis of data and does not require the user to set parameters. HAP analysis generates hierarchically organized parameter distributions that allow multi-scale components of the time-series to be quantified and includes a data analysis pipeline that applies recursive analyses to generate hierarchically organized results that extend traditional outcome measures such as pharmacokinetics and inter-pulse interval. Pulsicons, a novel text-based time-series representation also derived from the CFL approach, are introduced as an objective qualitative comparison nomenclature. We apply HAP to the analysis of 24 hours of frequently sampled pulsatile cortisol hormone data, which has known analysis challenges, from 14 healthy women. HAP analysis generated results in seconds and produced dozens of figures for each participant. The results quantify the observed qualitative features of cortisol data as a series of pulse clusters, each consisting of one or more embedded pulses, and identify two ultradian phenotypes in this dataset. HAP analysis is designed to be robust to individual differences and to missing data and may be applied to other pulsatile hormones. Future work can extend HAP analysis to other time-series data types, including oscillatory and other periodic physiological signals.     

Visual Data Mining of Biological Networks: One Size Does Not Fit All

High-throughput technologies produce massive amounts of data. However, individual methods yield data specific to the technique used and biological setup. The integration of such diverse data is necessary for the qualitative analysis of information relevant to hypotheses or discoveries. It is often useful to integrate these datasets using pathways and protein interaction networks to get a broader view of the experiment. The resulting network needs to be able to focus on either the large-scale picture or on the more detailed small-scale subsets, depending on the research question and goals. In this tutorial, we illustrate a workflow useful to integrate, analyze, and visualize data from different sources, and highlight important features of tools to support such analyses.     

Hypothesized Kinetic Models for Describing the Growth of Globular and Encrusting Demosponges

The marine sponges Dysidea avara and Chondrosia reniformis (globular forms) were cultured in the laboratory on a diet of viable Phaeodactylum tricornutum cells and dissolved nutrients (algae and fish powders). Our growth data were combined with literature data for Pseudosuberites andrewsi (a globular sponge) and for the encrusting sponges Oscarella lobularis, Hemimycale columella, and Crambe crambe. The suitability of three growth models—linear, exponential, and radial accretive—for describing the growth of globular and encrusting sponges was assessed. Radial accretive growth was determined to be the best model to describe growth of both encrusting and globular sponges. Average growth rates of 0.051 ± 0.016 and 0.019 ± 0.003 mm/day (calculated as the increase of the radius of the sponge per day) were obtained experimentally for D. avara and C. reniformis, respectively.     

VBA: A Probabilistic Treatment of Nonlinear Models for Neurobiological and Behavioural Data

This work is in line with an on-going effort tending toward a computational (quantitative and refutable) understanding of human neuro-cognitive processes. Many sophisticated models for behavioural and neurobiological data have flourished during the past decade. Most of these models are partly unspecified (i.e. they have unknown parameters) and nonlinear. This makes them difficult to peer with a formal statistical data analysis framework. In turn, this compromises the reproducibility of model-based empirical studies. This work exposes a software toolbox that provides generic, efficient and robust probabilistic solutions to the three problems of model-based analysis of empirical data: (i) data simulation, (ii) parameter estimation/model selection, and (iii) experimental design optimization.

This is a PLOS Computational Biology Software Article

     

Zsyntax: A Formal Language for Molecular Biology with Projected Applications in Text Mining and Biological Prediction

We propose a formal language that allows for transposing biological information precisely and rigorously into machine-readable information. This language, which we call Zsyntax (where Z stands for the Greek word ζωή, life), is grounded on a particular type of non-classical logic, and it can be used to write algorithms and computer programs. We present it as a first step towards a comprehensive formal language for molecular biology in which any biological process can be written and analyzed as a sort of logical “deduction”. Moreover, we illustrate the potential value of this language, both in the field of text mining and in that of biological prediction.     

CytoKavosh: A Cytoscape Plug-In for Finding Network Motifs in Large Biological Networks

Network motifs are small connected sub-graphs that have recently gathered much attention to discover structural behaviors of large and complex networks. Finding motifs with any size is one of the most important problems in complex and large networks. It needs fast and reliable algorithms and tools for achieving this purpose. CytoKavosh is one of the best choices for finding motifs with any given size in any complex network. It relies on a fast algorithm, Kavosh, which makes it faster than other existing tools. Kavosh algorithm applies some well known algorithmic features and includes tricky aspects, which make it an efficient algorithm in this field. CytoKavosh is a Cytoscape plug-in which supports us in finding motifs of given size in a network that is formerly loaded into the Cytoscape work-space (directed or undirected). High performance of CytoKavosh is achieved by dynamically linking highly optimized functions of Kavosh's C++ to the Cytoscape Java program, which makes this plug-in suitable for analyzing large biological networks. Some significant attributes of CytoKavosh is efficiency in time usage and memory and having no limitation related to the implementation in motif size. CytoKavosh is implemented in a visual environment Cytoscape that is convenient for the users to interact and create visual options to analyze the structural behavior of a network. This plug-in can work on any given network and is very simple to use and generates graphical results of discovered motifs with any required details. There is no specific Cytoscape plug-in, specific for finding the network motifs, based on original concept. So, we have introduced for the first time, CytoKavosh as the first plug-in, and we hope that this plug-in can be improved to cover other options to make it the best motif-analyzing tool.     

Evaluation of PVA Models of Arboreal Marsupials: Coupling Models with Long-term Monitoring Data

This paper reports the outcomes of a novel inter-twining of long-term monitoring data and population modelling to assess the accuracy of predictions of a Population Viability Analysis (PVA) model. In particular, the relative effectiveness of different management options for reserving areas from timber harvesting was assessed for two forest-dependent arboreal marsupials, the greater glider (Petauroides volans) and Leadbeater's Possum (Gymnobelideus leadbeateri). We used data from 7 years of monitoring conducted at 161 sites to assess and modify, where appropriate, previous population models of the two species of arboreal marsupials. The results indicated that the importance of food resources for both had been underestimated in past work. Despite this, the modified models that included increased importance of food availability did not change the predicted risks of decline substantially, particularly for Leadbeater's Possum. Importantly, past conclusions about the optimal sizes of patches to reserve within the forests used wood production were robust to changes in the model. This is a valuable finding because the work we report is one of the first to empirically test the robustness of the relative predictions of a PVA model. Nevertheless, the new insights we derived from this study have implications both for: (1) the implementation of our ongoing long-term monitoring study, in particular the value of what can be termed ȁ8adaptive monitoring', and, (2) the establishment of a new silvicultural experiment designed to better create habitat for arboreal marsupials within logged and regenerated sites.     

Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks

In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.     

Heterogeneity and Convergence of Olfactory First-Order Neurons Account for the High Speed and Sensitivity of Second-Order Neurons

In the olfactory system of male moths, a specialized subset of neurons detects and processes the main component of the sex pheromone emitted by females. It is composed of several thousand first-order olfactory receptor neurons (ORNs), all expressing the same pheromone receptor, that contact synaptically a few tens of second-order projection neurons (PNs) within a single restricted brain area. The functional simplicity of this system makes it a favorable model for studying the factors that contribute to its exquisite sensitivity and speed. Sensory information—primarily the identity and intensity of the stimulus—is encoded as the firing rate of the action potentials, and possibly as the latency of the neuron response. We found that over all their dynamic range, PNs respond with a shorter latency and a higher firing rate than most ORNs. Modelling showed that the increased sensitivity of PNs can be explained by the ORN-to-PN convergent architecture alone, whereas their faster response also requires cell-to-cell heterogeneity of the ORN population. So, far from being detrimental to signal detection, the ORN heterogeneity is exploited by PNs, and results in two different schemes of population coding based either on the response of a few extreme neurons (latency) or on the average response of many (firing rate). Moreover, ORN-to-PN transformations are linear for latency and nonlinear for firing rate, suggesting that latency could be involved in concentration-invariant coding of the pheromone blend and that sensitivity at low concentrations is achieved at the expense of precise encoding at high concentrations.     

SMETANA: Accurate and Scalable Algorithm for Probabilistic Alignment of Large-Scale Biological Networks

In this paper we introduce an efficient algorithm for alignment of multiple large-scale biological networks. In this scheme, we first compute a probabilistic similarity measure between nodes that belong to different networks using a semi-Markov random walk model. The estimated probabilities are further enhanced by incorporating the local and the cross-species network similarity information through the use of two different types of probabilistic consistency transformations. The transformed alignment probabilities are used to predict the alignment of multiple networks based on a greedy approach. We demonstrate that the proposed algorithm, called SMETANA, outperforms many state-of-the-art network alignment techniques, in terms of computational efficiency, alignment accuracy, and scalability. Our experiments show that SMETANA can easily align tens of genome-scale networks with thousands of nodes on a personal computer without any difficulty. The source code of SMETANA is available upon request. The source code of SMETANA can be downloaded from http://www.ece.tamu.edu/~bjyoon/SMETANA/.     

Cell Assembly Dynamics of Sparsely-Connected Inhibitory Networks: A Simple Model for the Collective Activity of Striatal Projection Neurons

Striatal projection neurons form a sparsely-connected inhibitory network, and this arrangement may be essential for the appropriate temporal organization of behavior. Here we show that a simplified, sparse inhibitory network of Leaky-Integrate-and-Fire neurons can reproduce some key features of striatal population activity, as observed in brain slices. In particular we develop a new metric to determine the conditions under which sparse inhibitory networks form anti-correlated cell assemblies with time-varying activity of individual cells. We find that under these conditions the network displays an input-specific sequence of cell assembly switching, that effectively discriminates similar inputs. Our results support the proposal that GABAergic connections between striatal projection neurons allow stimulus-selective, temporally-extended sequential activation of cell assemblies. Furthermore, we help to show how altered intrastriatal GABAergic signaling may produce aberrant network-level information processing in disorders such as Parkinson’s and Huntington’s diseases.     

Zero-Altered and other Regression Models for Count Data with Added Zeros

On occasion, generalized linear models for counts based on Poisson or overdispersed count distributions may encounter lack of fit due to disproportionately large frequencies of zeros. Three alternative types of regression models that utilize all the information and explicitly account for excess zeros are examined and given general formulations. A simple mechanism for added zeros is assumed that directly motivates one type of model, here called the added-zero type, particular forms of which have been proposed independently by D. LAMBERT (1992) and in unpublished work by the author. An original regression formulation (the zero-altered model) is presented as a reduced form of the two-part model for count data, which is also discussed. It is suggested that two-part models be used to aid in development of an added-zero model when the latter is thought to be appropriate.     

Inference of Gene Regulatory Networks Using Time-Series Data: A Survey

The advent of high-throughput technology like microarrays has provided the platform for studying how different cellular components work together, thus created an enormous interest in mathematically modeling biological network, particularly gene regulatory network (GRN). Of particular interest is the modeling and inference on time-series data, which capture a more thorough picture of the system than non-temporal data do. We have given an extensive review of methodologies that have been used on time-series data. In realizing that validation is an impartible part of the inference paradigm, we have also presented a discussion on the principles and challenges in performance evaluation of different methods. This survey gives a panoramic view on these topics, with anticipation that the readers will be inspired to improve and/or expand GRN inference and validation tool repository.     

A Method for High Fidelity Optogenetic Control of Individual Pyramidal Neurons In vivo

Optogenetic methods have emerged as a powerful tool for elucidating neural circuit activity underlying a diverse set of behaviors across a broad range of species. Optogenetic tools of microbial origin consist of light-sensitive membrane proteins that are able to activate (e.g., channelrhodopsin-2, ChR2) or silence (e.g., halorhodopsin, NpHR) neural activity ingenetically-defined cell types over behaviorally-relevant timescales. We first demonstrate a simple approach for adeno-associated virus-mediated delivery of ChR2 and NpHR transgenes to the dorsal subiculum and prelimbic region of the prefrontal cortex in rat. Because ChR2 and NpHR are genetically targetable, we describe the use of this technology to control the electrical activity of specific populations of neurons (i.e., pyramidal neurons) embedded in heterogeneous tissue with high temporal precision. We describe herein the hardware, custom software user interface, and procedures that allow for simultaneous light delivery and electrical recording from transduced pyramidal neurons in an anesthetized in vivo preparation. These light-responsive tools provide the opportunity for identifying the causal contributions of different cell types to information processing and behavior.     

Distributions-per-Level: A Means of Testing Level Detectors and Models of Patch-Clamp Data

Level or jump detectors generate the reconstructed time series from a noisy record of patch-clamp current. The reconstructed time series is used to create dwell-time histograms for the kinetic analysis of the Markov model of the investigated ion channel. It is shown here that some additional lines in the software of such a detector can provide a powerful new means of patch-clamp analysis. For each current level that can be recognized by the detector, an array is declared. The new software assigns every data point of the original time series to the array that belongs to the actual state of the detector. From the data sets in these arrays distributions-per-level are generated. Simulated and experimental time series analyzed by Hinkley detectors are used to demonstrate the benefits of these distributions-per-level. First, they can serve as a test of the reliability of jump and level detectors. Second, they can reveal beta distributions as resulting from fast gating that would usually be hidden in the overall amplitude histogram. Probably the most valuable feature is that the malfunctions of the Hinkley detectors turn out to depend on the Markov model of the ion channel. Thus, the errors revealed by the distributions-per-level can be used to distinguish between different putative Markov models of the measured time series. Abbreviations: AMFE = anomalous mole fraction effect; C, Z = closed state; DHD = sublevel Hinkley detector; HMM = Hidden Markov model; O, F = openstate; S = subconductance level     

ToPS: A Framework to Manipulate Probabilistic Models of Sequence Data

Discrete Markovian models can be used to characterize patterns in sequences of values and have many applications in biological sequence analysis, including gene prediction, CpG island detection, alignment, and protein profiling. We present ToPS, a computational framework that can be used to implement different applications in bioinformatics analysis by combining eight kinds of models: (i) independent and identically distributed process; (ii) variable-length Markov chain; (iii) inhomogeneous Markov chain; (iv) hidden Markov model; (v) profile hidden Markov model; (vi) pair hidden Markov model; (vii) generalized hidden Markov model; and (viii) similarity based sequence weighting. The framework includes functionality for training, simulation and decoding of the models. Additionally, it provides two methods to help parameter setting: Akaike and Bayesian information criteria (AIC and BIC). The models can be used stand-alone, combined in Bayesian classifiers, or included in more complex, multi-model, probabilistic architectures using GHMMs. In particular the framework provides a novel, flexible, implementation of decoding in GHMMs that detects when the architecture can be traversed efficiently.

This is a PLOS Computational Biology Software Article.

     

Topographic Factor Analysis: A Bayesian Model for Inferring Brain Networks from Neural Data

The neural patterns recorded during a neuroscientific experiment reflect complex interactions between many brain regions, each comprising millions of neurons. However, the measurements themselves are typically abstracted from that underlying structure. For example, functional magnetic resonance imaging (fMRI) datasets comprise a time series of three-dimensional images, where each voxel in an image (roughly) reflects the activity of the brain structure(s)–located at the corresponding point in space–at the time the image was collected. FMRI data often exhibit strong spatial correlations, whereby nearby voxels behave similarly over time as the underlying brain structure modulates its activity. Here we develop topographic factor analysis (TFA), a technique that exploits spatial correlations in fMRI data to recover the underlying structure that the images reflect. Specifically, TFA casts each brain image as a weighted sum of spatial functions. The parameters of those spatial functions, which may be learned by applying TFA to an fMRI dataset, reveal the locations and sizes of the brain structures activated while the data were collected, as well as the interactions between those structures.     

Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach

Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA), this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC) curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.