Topological constraints are major determinants of tRNA tertiary structure and dynamics and provide basis for tertiary folding cooperativity

Recent studies have shown that basic steric and connectivity constraints encoded at the secondary structure level are key determinants of 3D structure and dynamics in simple two-way RNA junctions. However, the role of these topological constraints in higher order RNA junctions remains poorly understood. Here, we use a specialized coarse-grained molecular dynamics model to directly probe the thermodynamic contributions of topological constraints in defining the 3D architecture and dynamics of transfer RNA (tRNA). Topological constraints alone restrict tRNA''s allowed conformational space by over an order of magnitude and strongly discriminate against formation of non-native tertiary contacts, providing a sequence independent source of folding specificity. Topological constraints also give rise to long-range correlations between the relative orientation of tRNA''s helices, which in turn provides a mechanism for encoding thermodynamic cooperativity between distinct tertiary interactions. These aspects of topological constraints make it such that only several tertiary interactions are needed to confine tRNA to its native global structure and specify functionally important 3D dynamics. We further show that topological constraints are conserved across tRNA''s different naturally occurring secondary structures. Taken together, our results emphasize the central role of secondary-structure-encoded topological constraints in defining RNA 3D structure, dynamics and folding.     

Bayesian inference for identifying interaction rules in moving animal groups

The emergence of similar collective patterns from different self-propelled particle models of animal groups points to a restricted set of "universal" classes for these patterns. While universality is interesting, it is often the fine details of animal interactions that are of biological importance. Universality thus presents a challenge to inferring such interactions from macroscopic group dynamics since these can be consistent with many underlying interaction models. We present a Bayesian framework for learning animal interaction rules from fine scale recordings of animal movements in swarms. We apply these techniques to the inverse problem of inferring interaction rules from simulation models, showing that parameters can often be inferred from a small number of observations. Our methodology allows us to quantify our confidence in parameter fitting. For example, we show that attraction and alignment terms can be reliably estimated when animals are milling in a torus shape, while interaction radius cannot be reliably measured in such a situation. We assess the importance of rate of data collection and show how to test different models, such as topological and metric neighbourhood models. Taken together our results both inform the design of experiments on animal interactions and suggest how these data should be best analysed.     

Social Aggregation in Pea Aphids: Experiment and Random Walk Modeling

From bird flocks to fish schools and ungulate herds to insect swarms, social biological aggregations are found across the natural world. An ongoing challenge in the mathematical modeling of aggregations is to strengthen the connection between models and biological data by quantifying the rules that individuals follow. We model aggregation of the pea aphid, Acyrthosiphon pisum. Specifically, we conduct experiments to track the motion of aphids walking in a featureless circular arena in order to deduce individual-level rules. We observe that each aphid transitions stochastically between a moving and a stationary state. Moving aphids follow a correlated random walk. The probabilities of motion state transitions, as well as the random walk parameters, depend strongly on distance to an aphid''s nearest neighbor. For large nearest neighbor distances, when an aphid is essentially isolated, its motion is ballistic with aphids moving faster, turning less, and being less likely to stop. In contrast, for short nearest neighbor distances, aphids move more slowly, turn more, and are more likely to become stationary; this behavior constitutes an aggregation mechanism. From the experimental data, we estimate the state transition probabilities and correlated random walk parameters as a function of nearest neighbor distance. With the individual-level model established, we assess whether it reproduces the macroscopic patterns of movement at the group level. To do so, we consider three distributions, namely distance to nearest neighbor, angle to nearest neighbor, and percentage of population moving at any given time. For each of these three distributions, we compare our experimental data to the output of numerical simulations of our nearest neighbor model, and of a control model in which aphids do not interact socially. Our stochastic, social nearest neighbor model reproduces salient features of the experimental data that are not captured by the control.     

Topological classification of RNA structures

We present a novel topological classification of RNA secondary structures with pseudoknots. It is based on the topological genus of the circular diagram associated to the RNA base-pair structure. The genus is a positive integer number whose value quantifies the topological complexity of the folded RNA structure. In such a representation, planar diagrams correspond to pure RNA secondary structures and have zero genus, whereas non-planar diagrams correspond to pseudoknotted structures and have higher genus. The topological genus allows for the definition of topological folding motifs, similar in spirit to those introduced and commonly used in protein folding. We analyze real RNA structures from the databases Worldwide Protein Data Bank and Pseudobase and classify them according to their topological genus. For simplicity, we limit our analysis by considering only Watson-Crick complementary base pairs and G-U wobble base pairs. We compare the results of our statistical survey with existing theoretical and numerical models. We also discuss possible applications of this classification and show how it can be used for identifying new RNA structural motifs.     

Parameter estimation using Simulated Annealing for S-system models of biochemical networks

MOTIVATION: High-throughput technologies now allow the acquisition of biological data, such as comprehensive biochemical time-courses at unprecedented rates. These temporal profiles carry topological and kinetic information regarding the biochemical network from which they were drawn. Retrieving this information will require systematic application of both experimental and computational methods. RESULTS: S-systems are non-linear mathematical approximative models based on the power-law formalism. They provide a general framework for the simulation of integrated biological systems exhibiting complex dynamics, such as genetic circuits, signal transduction and metabolic networks. We describe how the heuristic optimization technique simulated annealing (SA) can be effectively used for estimating the parameters of S-systems from time-course biochemical data. We demonstrate our methods using three artificial networks designed to simulate different network topologies and behavior. We then end with an application to a real biochemical network by creating a working model for the cadBA system in Escherichia coli. AVAILABILITY: The source code written in C++ is available at http://www.engg.upd.edu.ph/~naval/bioinformcode.html. All the necessary programs including the required compiler are described in a document archived with the source code. SUPPLEMENTARY INFORMATION: Supplementary material is available at Bioinformatics online.     

A scale-free structure prior for graphical models with applications in functional genomics

The problem of reconstructing large-scale, gene regulatory networks from gene expression data has garnered considerable attention in bioinformatics over the past decade with the graphical modeling paradigm having emerged as a popular framework for inference. Analysis in a full Bayesian setting is contingent upon the assignment of a so-called structure prior-a probability distribution on networks, encoding a priori biological knowledge either in the form of supplemental data or high-level topological features. A key topological consideration is that a wide range of cellular networks are approximately scale-free, meaning that the fraction, , of nodes in a network with degree is roughly described by a power-law with exponent between and . The standard practice, however, is to utilize a random structure prior, which favors networks with binomially distributed degree distributions. In this paper, we introduce a scale-free structure prior for graphical models based on the formula for the probability of a network under a simple scale-free network model. Unlike the random structure prior, its scale-free counterpart requires a node labeling as a parameter. In order to use this prior for large-scale network inference, we design a novel Metropolis-Hastings sampler for graphical models that includes a node labeling as a state space variable. In a simulation study, we demonstrate that the scale-free structure prior outperforms the random structure prior at recovering scale-free networks while at the same time retains the ability to recover random networks. We then estimate a gene association network from gene expression data taken from a breast cancer tumor study, showing that scale-free structure prior recovers hubs, including the previously unknown hub SLC39A6, which is a zinc transporter that has been implicated with the spread of breast cancer to the lymph nodes. Our analysis of the breast cancer expression data underscores the value of the scale-free structure prior as an instrument to aid in the identification of candidate hub genes with the potential to direct the hypotheses of molecular biologists, and thus drive future experiments.     

Guaranteeing the quality of multidimensional analysis in data warehouses of simulation results: Application to pesticide transfer data produced by the MACRO model

Currently, the vital impact of environmental pollution on economic, social and health dimensions has been recognized. The need for theoretical and implementation frameworks for the acquisition, modeling and analysis of environmental data as well as tools to conceive and validate scenarios is becoming increasingly important. For these reasons, different environmental simulation models have been developed. Researchers and stakeholders need efficient tools to store, display, compare and analyze data that are produced by simulation models. One common way to manage simulation results is to use text files; however, text files make it difficult to explore the data. Spreadsheet tools (e.g., OpenOffice, MS Excel) can help to display and analyze model results, but they are not suitable for very large volumes of information. Recently, some studies have shown the feasibility of using Data Warehouse (DW) and On-Line Analytical Processing (OLAP) technologies to store model results and to facilitate model visualization, analysis and comparisons. These technologies allow model users to easily produce graphical reports and charts. In this paper, we address the analysis of pesticide transfer simulation results by warehousing and OLAPing data, for which the data results from the MACRO simulation model. This model simulates hydrological transfers of pesticides at the plot scale. We demonstrate how the simulation results can be managed using DW technologies. We also demonstrate how the use of integrity constraints can improve OLAP analysis. These constraints are used to maintain the quality of the warehoused data as well as to maintain the aggregations and queries, which will lead to better analysis, conclusions and decisions.     

Quantifying the interplay between environmental and social effects on aggregated-fish dynamics

Demonstrating and quantifying the respective roles of social interactions and external stimuli governing fish dynamics is key to understanding fish spatial distribution. If seminal studies have contributed to our understanding of fish spatial organization in schools, little experimental information is available on fish in their natural environment, where aggregations often occur in the presence of spatial heterogeneities. Here, we applied novel modeling approaches coupled to accurate acoustic tracking for studying the dynamics of a group of gregarious fish in a heterogeneous environment. To this purpose, we acoustically tracked with submeter resolution the positions of twelve small pelagic fish (Selar crumenophthalmus) in the presence of an anchored floating object, constituting a point of attraction for several fish species. We constructed a field-based model for aggregated-fish dynamics, deriving effective interactions for both social and external stimuli from experiments. We tuned the model parameters that best fit the experimental data and quantified the importance of social interactions in the aggregation, providing an explanation for the spatial structure of fish aggregations found around floating objects. Our results can be generalized to other gregarious species and contexts as long as it is possible to observe the fine-scale movements of a subset of individuals.     

Functional Inference of Complex Anatomical Tendinous Networks at a Macroscopic Scale via Sparse Experimentation

In systems and computational biology, much effort is devoted to functional identification of systems and networks at the molecular-or cellular scale. However, similarly important networks exist at anatomical scales such as the tendon network of human fingers: the complex array of collagen fibers that transmits and distributes muscle forces to finger joints. This network is critical to the versatility of the human hand, and its function has been debated since at least the 16^th century. Here, we experimentally infer the structure (both topology and parameter values) of this network through sparse interrogation with force inputs. A population of models representing this structure co-evolves in simulation with a population of informative future force inputs via the predator-prey estimation-exploration algorithm. Model fitness depends on their ability to explain experimental data, while the fitness of future force inputs depends on causing maximal functional discrepancy among current models. We validate our approach by inferring two known synthetic Latex networks, and one anatomical tendon network harvested from a cadaver''s middle finger. We find that functionally similar but structurally diverse models can exist within a narrow range of the training set and cross-validation errors. For the Latex networks, models with low training set error [<4%] and resembling the known network have the smallest cross-validation errors [∼5%]. The low training set [<4%] and cross validation [<7.2%] errors for models for the cadaveric specimen demonstrate what, to our knowledge, is the first experimental inference of the functional structure of complex anatomical networks. This work expands current bioinformatics inference approaches by demonstrating that sparse, yet informative interrogation of biological specimens holds significant computational advantages in accurate and efficient inference over random testing, or assuming model topology and only inferring parameters values. These findings also hold clues to both our evolutionary history and the development of versatile machines.     

近地面激光雷达点云密度对森林冠层结构参数提取准确性的影响

基于激光雷达技术获取冠层结构为森林生态学研究增加了新的维度。搭载于多旋翼无人机的近地面激光雷达相比于固定翼有人机的机载激光雷达,能够更加灵活高效地获取森林群落样地高密度点云。但在实际操作中,往往出现局部低密度点云数据,影响了冠层结构参数提取的准确性。使用4块森林动态样地的近地面激光雷达点云数据;利用航带分解方法分析各样地低密度样方成因;采用点云抽稀模拟算法计算并拟合偏差曲线,对比不同样地、参数和取样尺度间的点云密度对冠层结构参数提取准确性的影响;根据偏差曲线计算各条件下保证参数提取准确性的最低点云密度。结果发现：1)低密度区域主要受地形或(和)近地面遥感设计规划的影响。地形复杂的测区(西双版纳和古田山样地),遥感规划难度大,整体难以获取高密度点云(在30点/m²左右),容易在沟谷和高海拔处出现低密度样方。平坦测区(长白山两块样地)虽可获取高密度点云(均超过150点/m²),但欠佳的遥感规划设计导致长白山1测区北部出现1hm²低密度区域。2)冠层参数提取准确性随点云密度减少而迅速降低,呈负指数幂函数关系。这一变化趋势在不同...     

Optimized Null Model for Protein Structure Networks

Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by comparing various RIG definitions against a series of network models.     

Modeling late entry bias in survival analysis

In a failure time analysis, we sometimes observe additional study subjects who enter during the study period. These late entries are treated as left-truncated data in the statistical literature. However, with real data, there is a substantial possibility that the delayed entries may have extremely different hazards compared to the other standard subjects. We focus on a situation in which such entry bias might arise in the analysis of survival data. The purpose of the present article is to develop an appropriate methodology for making inference about data including late entries. We construct a model that includes parameters for the effect of delayed entry bias having no specification for the distribution of entry time. We also discuss likelihood inference based on this model and derive the asymptotic behavior of estimates. A simulation study is conducted for a finite sample size in order to compare the analysis results using our method with those using the standard method, where independence between entry time and failure time is assumed. We apply this method to mortality analysis among atomic bomb survivors defined in a geographical study region.     

Analyzing recurrent and nonrecurrent terminal events data in discrete time

Joint analysis of recurrent and nonrecurrent terminal events has attracted substantial attention in literature. However, there lacks formal methodology for such analysis when the event time data are on discrete scales, even though some modeling and inference strategies have been developed for discrete-time survival analysis. We propose a discrete-time joint modeling approach for the analysis of recurrent and terminal events where the two types of events may be correlated with each other. The proposed joint modeling assumes a shared frailty to account for the dependence among recurrent events and between the recurrent and the terminal terminal events. Also, the joint modeling allows for time-dependent covariates and rich families of transformation models for the recurrent and terminal events. A major advantage of our approach is that it does not assume a distribution for the frailty, nor does it assume a Poisson process for the analysis of the recurrent event. The utility of the proposed analysis is illustrated by simulation studies and two real applications, where the application to the biochemists' rank promotion data jointly analyzes the biochemists' citation numbers and times to rank promotion, and the application to the scleroderma lung study data jointly analyzes the adverse events and off-drug time among patients with the symptomatic scleroderma-related interstitial lung disease.     

Measuring population-level plant gene flow with topological data analysis

Hybridization is an important factor influencing the evolution of many plant species. Measurement of interspecific gene flow and quantification of recombination provide insight into the processes that shape population genetic diversity. Recently, a new approach called topological data analysis (TDA) has begun to be implemented to track genomic recombination between species and populations. However, existing TDA methods tend to underestimate gene flow in cross-population models. Here, we present a novel graph-based approach to measuring gene flow, which occurs during ongoing speciation and hybridization in plants in various mating systems. We combine minimal spanning networks with topological filtering and then test the resulting parameter measurements on simulated primary divergence and secondary contact processes under different mating conditions. The resulting parameters, based on the first Betti number (total number of one-dimensional cycles), showed a high positive correlation with the number of migrants (N_m) in almost all cases of secondary contact. Considering the modularity of MSN networks, we have devised a parameter that works well in the event of primary divergence, where gene flow is at its highest level. This approach is suitable for various types of data, including SNPs, microsatellites, and binary restriction fragment data.     

Female clustering in cockroach aggregations—A case of social niche construction?

Individuals in groups can suffer costs through interactions with adversarial or unknown conspecifics. Social niche construction allows individuals to buffer such potential costs by only engaging in preferred associations. This may be particularly beneficial in insect aggregations, which are often large and highly fluid. However, little is known regarding the structuring of such aggregations. Here we use social network analyses to test for fine‐scale social structure in resting aggregations of the sub‐social cockroach Diploptera punctata and to explore the social pressures that contribute towards such structure. We showed that females were significantly more gregarious than males and formed the core of the proximity network, thus demonstrating a higher level of social integration. This fine‐scale structure is likely to result from females displacing males; females initiated most displacements whilst males received the majority. We explain this behaviour in terms of social niche construction by showing that females received significantly fewer approaches and investigations at more female‐biased local sex ratios. We therefore suggest that female social clustering occurs in this, and presumably other, species to reduce potential costs associated with male harassment. This demonstrates how social niche construction can lead to higher level social structure; we suggest this approach could be used across a range of species in order to improve our understanding of the evolution of sociality.     

The construction of a simultaneous functional order in nervous systems

The signal activity in a neural net will be constrained both by its physical structure and by environmental constraints. By monitoring its signal activity a neural system can build up a simultaneous functional order that encodes these constraints. We have previously (Part I) presented two models that construct a simultaneous functional order in a collection of neural elements using either signal-covariances or signal-coincides. In this paper we present the results of simulation experiments that were performed to study the influence of the physical constraints of a neural system on the simultaneous functional order produced by both models. In the simulation experiments we used a one-dimensional detector array. We delineate the physical constraints such an array has to satisfy in order to induce a functional order relation that allows an isomorphism with a geometrical order. We show that for an appropriate choice of the system parameters both models can produce a simultaneous functional order with sufficient internal coherence to allow isomorphisms with a triangulation. In this case the dimensionality and the coherence of the detector array are objectively available to the system itself.     

Tracking collective cell motion by topological data analysis

By modifying and calibrating an active vertex model to experiments, we have simulated numerically a confluent cellular monolayer spreading on an empty space and the collision of two monolayers of different cells in an antagonistic migration assay. Cells are subject to inertial forces and to active forces that try to align their velocities with those of neighboring ones. In agreement with experiments in the literature, the spreading test exhibits formation of fingers in the moving interfaces, there appear swirls in the velocity field, and the polar order parameter and the correlation and swirl lengths increase with time. Numerical simulations show that cells inside the tissue have smaller area than those at the interface, which has been observed in recent experiments. In the antagonistic migration assay, a population of fluidlike Ras cells invades a population of wild type solidlike cells having shape parameters above and below the geometric critical value, respectively. Cell mixing or segregation depends on the junction tensions between different cells. We reproduce the experimentally observed antagonistic migration assays by assuming that a fraction of cells favor mixing, the others segregation, and that these cells are randomly distributed in space. To characterize and compare the structure of interfaces between cell types or of interfaces of spreading cellular monolayers in an automatic manner, we apply topological data analysis to experimental data and to results of our numerical simulations. We use time series of data generated by numerical simulations to automatically group, track and classify the advancing interfaces of cellular aggregates by means of bottleneck or Wasserstein distances of persistent homologies. These techniques of topological data analysis are scalable and could be used in studies involving large amounts of data. Besides applications to wound healing and metastatic cancer, these studies are relevant for tissue engineering, biological effects of materials, tissue and organ regeneration.