Shape-aware stochastic neighbor embedding for robust data visualisations.

BACKGROUND: The t-distributed Stochastic Neighbor Embedding (t-SNE) algorithm has emerged as one of the leading methods for visualising high-dimensional (HD) data in a wide variety of fields, especially for revealing cluster structure in HD single-cell transcriptomics data. However, t-SNE often fails to correctly represent hierarchical relationships between clusters and creates spurious patterns in the embedding. In this work we generalised t-SNE using shape-aware graph distances to mitigate some of the limitations of the t-SNE. Although many methods have been recently proposed to circumvent the shortcomings of t-SNE, notably Uniform manifold approximation (UMAP) and Potential of heat diffusion for affinity-based transition embedding (PHATE), we see a clear advantage of the proposed graph-based method. RESULTS: The superior performance of the proposed method is first demonstrated on simulated data, where a significant improvement compared to t-SNE, UMAP and PHATE, based on quantitative validation indices, is observed when visualising imbalanced, nonlinear, continuous and hierarchically structured data. Thereafter the ability of the proposed method compared to the competing methods to create faithfully low-dimensional embeddings is shown on two real-world data sets, the single-cell transcriptomics data and the MNIST image data. In addition, the only hyper-parameter of the method can be automatically chosen in a data-driven way, which is consistently optimal across all test cases in this study. CONCLUSIONS: In this work we show that the proposed shape-aware stochastic neighbor embedding method creates low-dimensional visualisations that robustly and accurately reveal key structures of high-dimensional data.

Plasticity in the macromolecular-scale causal networks of cell migration.

Heterogeneous and dynamic single cell migration behaviours arise from a complex multi-scale signalling network comprising both molecular components and macromolecular modules, among which cell-matrix adhesions and F-actin directly mediate migration. To date, the global wiring architecture characterizing this network remains poorly defined. It is also unclear whether such a wiring pattern may be stable and generalizable to different conditions, or plastic and context dependent. Here, synchronous imaging-based quantification of migration system organization, represented by 87 morphological and dynamic macromolecular module features, and migration system behaviour, i.e., migration speed, facilitated Granger causality analysis. We thereby leveraged natural cellular heterogeneity to begin mapping the directionally specific causal wiring between organizational and behavioural features of the cell migration system. This represents an important advance on commonly used correlative analyses that do not resolve causal directionality. We identified organizational features such as adhesion stability and adhesion F-actin content that, as anticipated, causally influenced cell migration speed. Strikingly, we also found that cell speed can exert causal influence over organizational features, including cell shape and adhesion complex location, thus revealing causality in directions contradictory to previous expectations. Importantly, by comparing unperturbed and signalling-modulated cells, we provide proof-of-principle that causal interaction patterns are in fact plastic and context dependent, rather than stable and generalizable.

Network inference with hidden units.

We derive learning rules for finding the connections between units in stochastic dynamical networks from the recorded history of a "visible'' subset of the units. We consider two models. In both of them, the visible units are binary and stochastic. In one model the "hidden'' units are continuous-valued, with sigmoidal activation functions, and in the other they are binary and stochastic like the visible ones. We derive exact learning rules for both cases. For the stochastic case, performing the exact calculation requires, in general, repeated summations over an number of configurations that grows exponentially with the size of the system and the data length, which is not feasible for large systems. We derive a mean field theory, based on a factorized ansatz for the distribution of hidden-unit states, which offers an attractive alternative for large systems. We present the results of some numerical calculations that illustrate key features of the two models and, for the stochastic case, the exact and approximate calculations.

Expression profiling of repetitive elements by melting temperature analysis: variation in HERV-W gag expression across human individuals and tissues.

BACKGROUND: Human endogenous retroviruses (HERV) constitute approximately 8% of the human genome and have long been considered "junk". The sheer number and repetitive nature of these elements make studies of their expression methodologically challenging. Hence, little is known of transcription of genomic regions harboring such elements. RESULTS: Applying a recently developed technique for obtaining high resolution melting temperature data, we examined the frequency distributions of HERV-W gag element into 13 Tm categories in human tissues. Transcripts containing HERV-W gag sequences were expressed in non-random patterns with extensive variations in the expression between both tissues, including different brain regions, and individuals. Furthermore, the patterns of such transcripts varied more between individuals in brain regions than other tissues. CONCLUSION: Thus, regulated expression of non-coding regions of the human genome appears to include the HERV-W family of repetitive elements. Although it remains to be established whether such expression patterns represent leakage from transcription of functional regions or specific transcription, the current approach proves itself useful for studying detailed expression patterns of repetitive regions.

Ising model for neural data: model quality and approximate methods for extracting functional connectivity.

We study pairwise Ising models for describing the statistics of multineuron spike trains, using data from a simulated cortical network. We explore efficient ways of finding the optimal couplings in these models and examine their statistical properties. To do this, we extract the optimal couplings for subsets of size up to 200 neurons, essentially exactly, using Boltzmann learning. We then study the quality of several approximate methods for finding the couplings by comparing their results with those found from Boltzmann learning. Two of these methods--inversion of the Thouless-Anderson-Palmer equations and an approximation proposed by Sessak and Monasson--are remarkably accurate. Using these approximations for larger subsets of neurons, we find that extracting couplings using data from a subset smaller than the full network tends systematically to overestimate their magnitude. This effect is described qualitatively by infinite-range spin-glass theory for the normal phase. We also show that a globally correlated input to the neurons in the network leads to a small increase in the average coupling. However, the pair-to-pair variation in the couplings is much larger than this and reflects intrinsic properties of the network. Finally, we study the quality of these models by comparing their entropies with that of the data. We find that they perform well for small subsets of the neurons in the network, but the fit quality starts to deteriorate as the subset size grows, signaling the need to include higher-order correlations to describe the statistics of large networks.

Mixture models for analysis of melting temperature data.

BACKGROUND: In addition to their use in detecting undesired real-time PCR products, melting temperatures are useful for detecting variations in the desired target sequences. Methodological improvements in recent years allow the generation of high-resolution melting-temperature (Tm) data. However, there is currently no convention on how to statistically analyze such high-resolution Tm data. RESULTS: Mixture model analysis was applied to Tm data. Models were selected based on Akaike's information criterion. Mixture model analysis correctly identified categories in Tm data obtained for known plasmid targets. Using simulated data, we investigated the number of observations required for model construction. The precision of the reported mixing proportions from data fitted to a preconstructed model was also evaluated. CONCLUSION: Mixture model analysis of Tm data allows the minimum number of different sequences in a set of amplicons and their relative frequencies to be determined. This approach allows Tm data to be analyzed, classified, and compared in an unbiased manner.

Cell cycle progression.

In this paper we consider cell cycle models for which the transition operator for the evolution of birth mass density is a simple, linear dynamical system with a stochastic perturbation. The convolution model for a birth mass distribution is presented. Density functions of birth mass and tail probabilities in n-th generation are calculated by a saddle-point approximation method. With these probabilities, representing the probability of exceeding an acceptable mass value, we have more control over pathological growth. A computer simulation is presented for cell proliferation in the age-dependent cell cycle model. The simulation takes into account the fact that the age-dependent model with a linear growth is a simple linear dynamical system with an additive stochastic perturbation. The simulated data as well as the experimental data (generation times for mouse L) are fitted by the proposed convolution model.