Decoding of persistent multiscale structures in complex biological networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Zheng F
PROVIDER: S-EPMC7310637 | biostudies-literature | 2020 Jun
REPOSITORIES: biostudies-literature
Publications
Identifying persistent structures in multiscale 'omics data.
Zheng Fan F Zhang She S Churas Christopher C Pratt Dexter D Bahar Ivet I Ideker Trey T
bioRxiv : the preprint server for biology 20201003
In any 'omics study, the scale of analysis can dramatically affect the outcome. For instance, when clustering single-cell transcriptomes, is the analysis tuned to discover broad or specific cell types? Likewise, protein communities revealed from protein networks can vary widely in sizes depending on the method. Here we use the concept of "persistent homology", drawn from mathematical topology, to identify robust structures in data at all scales simultaneously. Application to mouse single-cell tr ...[more]
Similar Datasets
Project description:Extracting complex interactions (i.e., dynamic topologies) has been an essential, but difficult, step toward understanding large, complex, and diverse systems including biological, financial, and electrical networks. However, reliable and efficient methods for the recovery or estimation of network topology remain a challenge due to the tremendous scale of emerging systems (e.g., brain and social networks) and the inherent nonlinearity within and between individual units. We develop a unified, data-driven approach to efficiently infer connections of networks (ICON). We apply ICON to determine topology of networks of oscillators with different periodicities, degree nodes, coupling functions, and time scales, arising in silico, and in electrochemistry, neuronal networks, and groups of mice. This method enables the formulation of these large-scale, nonlinear estimation problems as a linear inverse problem that can be solved using parallel computing. Working with data from networks, ICON is robust and versatile enough to reliably reveal full and partial resonance among fast chemical oscillators, coherent circadian rhythms among hundreds of cells, and functional connectivity mediating social synchronization of circadian rhythmicity among mice over weeks.
| S-EPMC6140519 | biostudies-literature
Project description:In any 'omics study, the scale of analysis can dramatically affect the outcome. For instance, when clustering single-cell transcriptomes, is the analysis tuned to discover broad or specific cell types? Likewise, protein communities revealed from protein networks can vary widely in sizes depending on the method. Here, we use the concept of persistent homology, drawn from mathematical topology, to identify robust structures in data at all scales simultaneously. Application to mouse single-cell transcriptomes significantly expands the catalog of identified cell types, while analysis of SARS-COV-2 protein interactions suggests hijacking of WNT. The method, HiDeF, is available via Python and Cytoscape.
| S-EPMC7789082 | biostudies-literature
Project description:Many real-world networks tend to be very dense. Particular examples of interest arise in the construction of networks that represent pairwise similarities between objects. In these cases, the networks under consideration are weighted, generally with positive weights between any two nodes. Visualization and analysis of such networks, especially when the number of nodes is large, can pose significant challenges which are often met by reducing the edge set. Any effective "sparsification" must retain and reflect the important structure in the network. A common method is to simply apply a hard threshold, keeping only those edges whose weight exceeds some predetermined value. A more principled approach is to extract the multiscale "backbone" of a network by retaining statistically significant edges through hypothesis testing on a specific null model, or by appropriately transforming the original weight matrix before applying some sort of threshold. Unfortunately, approaches such as these can fail to capture multiscale structure in which there can be small but locally statistically significant similarity between nodes. In this paper, we introduce a new method for backbone extraction that does not rely on any particular null model, but instead uses the empirical distribution of similarity weight to determine and then retain statistically significant edges. We show that our method adapts to the heterogeneity of local edge weight distributions in several paradigmatic real world networks, and in doing so retains their multiscale structure with relatively insignificant additional computational costs. We anticipate that this simple approach will be of great use in the analysis of massive, highly connected weighted networks.
| S-EPMC3035633 | biostudies-literature
Project description:Our cognition relies on the ability of the brain to segment hierarchically structured events on multiple scales. Recent evidence suggests that the brain performs this event segmentation based on the structure of state-transition graphs behind sequential experiences. However, the underlying circuit mechanisms are poorly understood. In this paper we propose an extended attractor network model for graph-based hierarchical computation which we call the Laplacian associative memory. This model generates multiscale representations for communities (clusters) of associative links between memory items, and the scale is regulated by the heterogenous modulation of inhibitory circuits. We analytically and numerically show that these representations correspond to graph Laplacian eigenvectors, a popular method for graph segmentation and dimensionality reduction. Finally, we demonstrate that our model exhibits chunked sequential activity patterns resembling hippocampal theta sequences. Our model connects graph theory and attractor dynamics to provide a biologically plausible mechanism for abstraction in the brain.
| S-EPMC8412329 | biostudies-literature
Project description:MotivationMany types of omics data are compiled as lists of connections between elements and visualized as networks or graphs where the nodes and edges correspond to the elements and the connections, respectively. However, these networks often appear as 'hair-balls'-with a large number of extremely tangled edges-and cannot be visually interpreted.ResultsWe present an interactive, multiscale navigation method for biological networks. Our approach can automatically and rapidly abstract any portion of a large network of interest to an immediately interpretable extent. The method is based on an ultrafast graph clustering technique that abstracts networks of about 100 000 nodes in a second by iteratively grouping densely connected portions and a biological-property-based clustering technique that takes advantage of biological information often provided for biological entities (e.g. Gene Ontology terms). It was confirmed to be effective by applying it to real yeast protein network data, and would greatly help modern biologists faced with large, complicated networks in a similar manner to how Web mapping services enable interactive multiscale navigation of geographical maps (e.g. Google Maps).AvailabilityJava implementation of our method, named NaviCluster, is available at http://navicluster.cb.k.u-tokyo.ac.jp/.Contactthanet@cb.k.u-tokyo.ac.jpSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC3072549 | biostudies-literature
Project description:A large number of complex systems find a natural abstraction in the form of weighted networks whose nodes represent the elements of the system and the weighted edges identify the presence of an interaction and its relative strength. In recent years, the study of an increasing number of large-scale networks has highlighted the statistical heterogeneity of their interaction pattern, with degree and weight distributions that vary over many orders of magnitude. These features, along with the large number of elements and links, make the extraction of the truly relevant connections forming the network's backbone a very challenging problem. More specifically, coarse-graining approaches and filtering techniques come into conflict with the multiscale nature of large-scale systems. Here, we define a filtering method that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges. An important aspect of the method is that it does not belittle small-scale interactions and operates at all scales defined by the weight distribution. We apply our method to real-world network instances and compare the obtained results with alternative backbone extraction techniques.
| S-EPMC2672499 | biostudies-literature
Project description:Marine diatoms construct their hierarchically ordered, three-dimensional (3D) external structures called frustules through precise biomineralization processes. Recapitulating the remarkable architectures and functions of diatom frustules in artificial materials is a major challenge that has important technological implications for hierarchically ordered composites. Here, we report the construction of highly ordered, mineralized composites based on fabrication of complex self-supporting porous structures-made of genetically engineered amyloid fusion proteins and the natural polysaccharide chitin-and performing in situ multiscale protein-mediated mineralization with diverse inorganic materials, including SiO2, TiO2 and Ga2O3. Subsequently, using sugar cubes as templates, we demonstrate that 3D fabricated porous structures can become colonized by engineered bacteria and can be functionalized with highly photoreactive minerals, thereby enabling co-localization of the photocatalytic units with a bacteria-based hydrogenase reaction for a successful semi-solid artificial photosynthesis system for hydrogen evolution. Our study thus highlights the power of coupling genetically engineered proteins and polysaccharides with biofabrication techniques to generate hierarchically organized mineralized porous structures inspired by nature.
| S-EPMC8363331 | biostudies-literature
Project description:Biological networks have evolved to be highly functional within uncertain environments while remaining extremely adaptable. One of the main contributors to the robustness and evolvability of biological networks is believed to be their modularity of function, with modules defined as sets of genes that are strongly interconnected but whose function is separable from those of other modules. Here, we investigate the in silico evolution of modularity and robustness in complex artificial metabolic networks that encode an increasing amount of information about their environment while acquiring ubiquitous features of biological, social, and engineering networks, such as scale-free edge distribution, small-world property, and fault-tolerance. These networks evolve in environments that differ in their predictability, and allow us to study modularity from topological, information-theoretic, and gene-epistatic points of view using new tools that do not depend on any preconceived notion of modularity. We find that for our evolved complex networks as well as for the yeast protein-protein interaction network, synthetic lethal gene pairs consist mostly of redundant genes that lie close to each other and therefore within modules, while knockdown suppressor gene pairs are farther apart and often straddle modules, suggesting that knockdown rescue is mediated by alternative pathways or modules. The combination of network modularity tools together with genetic interaction data constitutes a powerful approach to study and dissect the role of modularity in the evolution and function of biological networks.
| S-EPMC2233666 | biostudies-literature
Project description:Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.
| S-EPMC4954979 | biostudies-literature
Project description:Claudins (Cldns) define a family of transmembrane proteins that are the major determinants of the tight junction integrity and tissue selectivity. They promote the formation of either barriers or ion-selective channels at the interface between two facing cells, across the paracellular space. Multiple Cldn subunits form complexes that include cis- (intracellular) interactions along the membrane of a single cell and trans- (intercellular) interactions across adjacent cells. The first description of Cldn assemblies was provided by electron microscopy, while electrophysiology, mutagenesis and cell biology experiments addressed the functional role of different Cldn homologs. However, the investigation of the molecular details of Cldn subunits and complexes are hampered by the lack of experimental native structures, currently limited to Cldn15. The recent implementation of computer-based techniques greatly contributed to the elucidation of Cldn properties. Molecular dynamics simulations and docking calculations were extensively used to refine the first Cldn multimeric model postulated from the crystal structure of Cldn15, and contributed to the introduction of a novel, alternative, arrangement. While both these multimeric assemblies were found to account for the physiological properties of some family members, they gave conflicting results for others. In this review, we illustrate the major findings on Cldn-based systems that were achieved by using state-of-the-art computational methodologies. The information provided by these results could be useful to improve the characterization of the Cldn properties and help the design of new efficient strategies to control the paracellular transport of drugs or other molecules.
| S-EPMC9647347 | biostudies-literature