PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Network graphs”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2Linked to original sources

Spread of two linked social norms on complex interaction networks.

In this paper, we study the spread of social norms, such as rules and customs that are components of human cultures. We consider the spread of two social norms, which are linked through individual behaviors. Spreading social norms depend not only on the social network structure, but also on the learning system. We consider four social network structures: (1) complete mixing, in which each individual interacts with the others at random, (2) lattice, in which each individual interacts with its neighbors with some probability and with the others at random, (3) power-law network, in which a few influential people have more social contacts than the others, and (4) random graph network, in which the number of contacts follows a Poisson distribution. Using the lattice model, we also investigate the effect of the small-world phenomenon on the dynamics of social norms. In our models, each individual learns a social norm by trial and error (individual learning) and also imitates the other's social norm (social learning). We investigate how social network structure and learning systems affect the spread of two linked social norms. Our main results are: (1) Social learning does not lead to coexistence of social norms. Individual learning produces coexistence, and the dynamics of coexistence depend on which social norms are learned individually. (2) Social norms spread fastest in the power-law network model, followed by the random graph model, the complete mixing model, the two-dimensional lattice model and the one-dimensional lattice. (3) We see a "small world effect" in the one-dimensional model, but not in two dimensions.

Computer Simulation↗

Network methods for diagonal integration of unpaired single-cell multiomics data: a review.

MOTIVATION: Advances in single-cell sequencing have enabled multiomics profiling at unprecedented resolution; however, mass spectrometry-based single-cell proteomics (scMS) remains inherently destructive, precluding simultaneous transcriptomic capture. Unlike antibody-based methods such as CITE-seq, which permit paired profiling but are restricted to targeted protein panels, scMS provides unbiased, genome-scale coverage of the intracellular proteome yet necessitates post hoc integration of unpaired datasets. This diagonal integration challenge, where transcriptomes and proteomes are measured in separate cells lacking shared anchors, remains underserved by existing reviews, which focus predominantly on vertical integration strategies enabled by non-destructive assays. RESULTS: We survey the complete computational pipeline for constructing mechanistic proteogenomic networks from unpaired single-cell data, covering: (i) unimodal network inference such as knowledge-based approaches, probabilistic graphical models, temporal directionality inference, and generative and foundation model strategies that establish the transcriptomic scaffold; (ii) cross-modal integration architectures such as network propagation, graph neural networks (scMRDR, scmFormer, scCotag), and consensus frameworks designed explicitly for the unpaired proteomics setting; and (iii) benchmarking paradigms spanning network reconstruction (BEELINE, GRETA, CausalBench) and multi-task integration evaluation (scMultiBench, SCMMIB), with guidance on metric selection under network sparsity and class imbalance. We identify three principal axes of future development: generative proteomic translation from transcriptomic precursors, inductive prior embedding in next-generation architectures, and perturbation-based causal benchmarking. AVAILABILITY AND IMPLEMENTATION: This is a review article; no novel software is distributed. A curated benchmark resource table, methods starter guide, and per-method bottleneck annotations are provided in the Supplementary Material.

Multiomics↗

Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC).

MOTIVATION: Pathway Hunter Tool (PHT), is a fast, robust and user-friendly tool to analyse the shortest paths in metabolic pathways. The user can perform shortest path analysis for one or more organisms or can build virtual organisms (networks) using enzymes. Using PHT, the user can also calculate the average shortest path (Jungnickel, 2002 Graphs, Network and Algorithm. Springer-Verlag, Berlin), average alternate path and the top 10 hubs in the metabolic network. The comparative study of metabolic connectivity and observing the cross talk between metabolic pathways among various sequenced genomes is possible. RESULTS: A new algorithm for finding the biochemically valid connectivity between metabolites in a metabolic network was developed and implemented. A predefined manual assignment of side metabolites (like ATP, ADP, water, CO(2) etc.) and main metabolites is not necessary as the new concept uses chemical structure information (global and local similarity) between metabolites for identification of the shortest path.

Algorithms↗

Subnetwork hierarchies of biochemical pathways.

MOTIVATION: The vastness and complexity of the biochemical networks that have been mapped out by modern genomics calls for decomposition into subnetworks. Such networks can have inherent non-local features that require the global structure to be taken into account in the decomposition procedure. Furthermore, basic questions such as to what extent the network (graph theoretically) can be said to be built by distinct subnetworks are little studied. RESULTS: We present a method to decompose biochemical networks into subnetworks based on the global geometry of the network. This method enables us to analyze the full hierarchical organization of biochemical networks and is applied to 43 organisms from the WIT database. Two types of biochemical networks are considered: metabolic networks and whole-cellular networks (also including for example information processes). Conceptual and quantitative ways of describing the hierarchical ordering are discussed. The general picture of the metabolic networks arising from our study is that of a few core-clusters centred around the most highly connected substances enclosed by other substances in outer shells, and a few other well-defined subnetworks. AVAILABILITY: An implementation of our algorithm and other programs for analyzing the data is available from http://www.tp.umu.se/forskning/networks/meta/ SUPPLEMENTARY INFORMATION: Supplementary material is available at http://www.tp.umu.se/forskning/networks/meta/

Algorithms↗

RAG: RNA-As-Graphs database--concepts, analysis, and features.

MOTIVATION: Understanding RNA's structural diversity is vital for identifying novel RNA structures and pursuing RNA genomics initiatives. By classifying RNA secondary motifs based on correlations between conserved RNA secondary structures and functional properties, we offer an avenue for predicting novel motifs. Although several RNA databases exist, no comprehensive schemes are available for cataloguing the range and diversity of RNA's structural repertoire. RESULTS: Our RNA-As-Graphs (RAG) database describes and ranks all mathematically possible (including existing and candidate) RNA secondary motifs on the basis of graphical enumeration techniques. We represent RNA secondary structures as two-dimensional graphs (networks), specifying the connectivity between RNA secondary structural elements, such as loops, bulges, stems and junctions. We archive RNA tree motifs as 'tree graphs' and other RNAs, including pseudoknots, as general 'dual graphs'. All RNA motifs are catalogued by graph vertex number (a measure of sequence length) and ranked by topological complexity. The RAG inventory immediately suggests candidates for novel RNA motifs, either naturally occurring or synthetic, and thereby might stimulate the prediction and design of novel RNA motifs. AVAILABILITY: The database is accessible on the web at http://monod.biomath.nyu.edu/rna

Algorithms↗

Molecular analysis of the dengue virus type 1 and 2 in Brazil based on sequences of the genomic envelope-nonstructural protein 1 junction region.

The genomic sequences of the Envelope-Non-Structural protein 1 junction region (E/NS1) of 84 DEN-1 and 22 DEN-2 isolates from Brazil were determined. Most of these strains were isolated in the period from 1995 to 2001 in endemic and regions of recent dengue transmission in São Paulo State. Sequence data for DEN-1 and DEN-2 utilized in phylogenetic and split decomposition analyses also include sequences deposited in GenBank from different regions of Brazil and of the world. Phylogenetic analyses were done using both maximum likelihood and Bayesian approaches. Results for both DEN-1 and DEN-2 data are ambiguous, and support for most tree bipartitions are generally poor, suggesting that E/NS1 region does not contain enough information for recovering phylogenetic relationships among DEN-1 and DEN-2 sequences used in this study. The network graph generated in the split decomposition analysis of DEN-1 does not show evidence of grouping sequences according to country, region and clades. While the network for DEN-2 also shows ambiguities among DEN-2 sequences, it suggests that Brazilian sequences may belong to distinct subtypes of genotype III.

Amino Acid Sequence↗

Graph neural network-based risk stratification of prostate cancer using gene expression and SHAP interpretability.

Accurate risk stratification is essential for guiding treatment decisions and preventing over treatment of prostate cancer, which remains one of the most prevalent cancers among adult men. While the Gleason score, obtained from prostate biopsies, is routinely used to assess tumor aggressiveness, the biopsy procedure carries risks such as pain, infection, and, in some cases, serious complications such as sepsis. In this study, we proposed an artificial intelligence-based framework that integrates mRNA expression profiles with functional interaction networks to classify prostate cancer patients into low-, medium-, and high-risk groups defined by Gleason scores. The pipeline comprised five steps: (1) data collection from The Cancer Genome Atlas (TCGA), (2) preprocessing of gene expression data, (3) two-stage feature selection to identify informative biomarkers, (4) risk classification using a dual-branch graph neural network (GNN) that combines gene-gene interaction graphs with sample-level expression features, and (5) model interpretation using SHAP to quantify feature contributions. Differentially expressed genes were identified in the High (ASPN, GMNN, PEBP4, C2, KNCK17), Medium (C2, IGSF1, ASPN, CDKN3, AMH), and Low (TNMD, VWA5B2, ST6GALNAC5, CYP3A5, PHGR1) risk groups, underscoring the molecular heterogeneity of disease progression. On an independent held-out test set, the model achieved AUCs of 0.86, 0.88, and 0.95 for the low-, medium-, and high-risk groups, respectively, with an overall accuracy of 80%. These results suggest that combining GNN-based modeling with explainable AI can capture both global and local molecular patterns relevant to tumor aggressiveness. However, as the model was developed and evaluated solely on the TCGA cohort, the findings should be regarded as exploratory, and external validation will be required to establish generalizability. Within these limitations, the proposed framework highlights the potential of molecular profiling and graph-based deep learning to support more precise, potentially less invasive, risk assessment and individualized treatment planning in prostate cancer.

Prostatic Neoplasms↗

Deep learning-based cell-specific gene regulatory networks inferred from single-cell multiome data.

Gene regulatory networks (GRNs) provide a global representation of how genetic/genomic information is transferred in living systems and are a key component in understanding genome regulation. Single-cell multiome data provide unprecedented opportunities to reconstruct GRNs at fine-grained resolution. However, the inference of GRNs is hindered by insufficient single omic profiles due to the characteristic high loss rate of single-cell sequencing data. In this study, we developed scMultiomeGRN, a deep learning framework to infer transcription factor (TF) regulatory networks via unique integration of single-cell genomic (single-cell RNA sequencing) and epigenomic (single-cell ATAC sequencing) data. We create scMultiomeGRN to elucidate these networks by conceptualizing TF network graph structures. Specifically, we build modality-specific neighbor aggregators and cross-modal attention modules to learn latent representations of TFs from single-cell multi-omics. We demonstrate that scMultiomeGRN outperforms state-of-the-art models on multiple benchmark datasets involved in diseases and health. Via scMultiomeGRN, we identified Alzheimer's disease-relevant regulatory network of SPI1 and RUNX1 for microglia. In summary, scMultiomeGRN offers a deep learning framework to identify cell type-specific gene regulatory network from single-cell multiome data.

Deep Learning↗

Architectural analysis of oral cancer, dysplastic, and normal epithelia.

BACKGROUND: We present a novel, automated, and quantitative approach to evaluate local epithelial tissue architecture based on mathematical graph theory. METHODS: Four hundred forty-one images of three diagnostic classes of oral epithelium (normal, dysplastic, and neoplastic) were analysed. The epithelial compartment was partitioned into exclusive areas associated with each nucleus to approach the theoretical cell extents. The spatial arrangement of cells in neighbourhoods of two sizes was characterised by constructing graph networks based on the cell centroids and recording 29 statistical properties. We analysed 104,627 and 67,590 neighbourhoods of diameters 37.5 and 75 microm, respectively. RESULTS: The discrimination power of the architectural descriptors was evaluated by using discriminant analysis. The best neighbourhood discrimination rate was 75% for normal versus carcinoma. For the pooled data, discrimination into three classes based on largest number of neighbourhoods associated with each class was 100% correct. Case-wise, discrimination rates were 67%, 100%, and 80% correct for normal, premalignant, and malignant. When considering two classes, discrimination rates was 89% (normal) and 100% (malignant) correct, with 71% of premalignant cases assigned to the malignant class. CONCLUSIONS: The results indicate that unbiased and reproducible quantification of tissue architectural features is possible and may provide valuable morphological information for diagnostic purposes.

Cytodiagnosis↗

Dissecting spatial patterning and signaling with directional diffusion in spatial multi-omics.

Spatial multi-omics sequencing enables the simultaneous profiling of transcriptomics, proteomics, and epigenomics at a spatial resolution, offering insights into complex tissue organization and molecular regulation. However, the effective integration of multiple omics modalities in a spatial context remains a major challenge. Here, we present SpaDDM, a spatial multi-omics integration framework based on directional diffusion models (DDMs), which supports spatial pattern identification, cross-omics alignment, and inter-and intracellular signaling flow analysis. SpaDDM employs DDM-based graph networks to learn omics-specific representations by jointly incorporating spatial coordinates and molecular measurements within each modality, followed by an attention mechanism to align features across modalities. We benchmarked SpaDDM on diverse spatial multi-omics datasets, including transcriptomics-epigenomics and transcriptomics-proteomics combinations across multiple tissues and species. SpaDDM consistently outperformed existing methods by more accurately deciphering spatial tissue patterns and effectively reducing the boundary noise between spatial regions. Moreover, the learned low-dimensional coembedded representations of individual cells serve as integral mediators for inferring the signaling flows that underlie spatial patterning. Finally, we demonstrated that SpaDDM alignment of complementary information across multi-omics layers facilitates cross-omics translation and significantly improves the prediction of cell state alignments.

Multiomics↗

A segment alignment approach to protein comparison.

MOTIVATION: Local structure segments (LSSs) are small structural units shared by unrelated proteins. They are extensively used in protein structure comparison, and predicted LSSs (PLSSs) are used very successfully in ab initio folding simulations. However, predicted or real LSSs are rarely exploited by protein sequence comparison programs that are based on position-by-position alignments. RESULTS: We developed a SEgment Alignment algorithm (SEA) to compare proteins described as a collection of predicted local structure segments (PLSSs), which is equivalent to an unweighted graph (network). Any specific structure, real or predicted corresponds to a specific path in this network. SEA then uses a network matching approach to find two most similar paths in networks representing two proteins. SEA explores the uncertainty and diversity of predicted local structure information to search for a globally optimal solution. It simultaneously solves two related problems: the alignment of two proteins and the local structure prediction for each of them. On a benchmark of protein pairs with low sequence similarity, we show that application of the SEA algorithm improves alignment quality as compared to FFAS profile-profile alignment, and in some cases SEA alignments can match the structural alignments, a feat previously impossible for any sequence based alignment methods.

Algorithms↗

A structural analysis of the qualitative networks regulating the cell cycle and apoptosis.

This paper proposes an integration and modular organization of the complex regulatory networks involved in the mammalian cell cycle, apoptosis, and related intracellular signaling cascades. A common node linking the cell cycle and apoptosis permits the possibility of coordinate control between the initiation of these two cellular processes. From this node, pathways emanate that lead to the activation of cyclin-dependent kinases (in the cell cycle) and caspases (in apoptosis). Computer simulations are carried out to demonstrate that the proposed network architecture and certain module-module interactions can account for the experimentally observed sequence of cellular events (quiescence, cell cycle, and apoptosis) as the transcriptional activities of E2F-1 and c-Myc are increased. Despite the lack of quantitative kinetic data on most of the pathways, it is demonstrated that there can be meaningful conclusions regarding system stability that arise from the topology of the network. It is shown that only cycles in the network graph determine stability. Thus, several positive and negative feedback loops are identified from a literature review of the major pathways involved in the initiation of the cell cycle and of apoptosis.

Animals↗

[Algorithm for diagnosis and prevention of postoperative deep vein thrombosis].

An algorithm is described in this paper for diagnosis and prevention of postoperative deep venous thrombosis. It is presented in the form of a network graph and is based on an evaluation of the relative risk of pulmonary embolism of 17.785 patients. Age above 60 years, malignant disease, and more than four days of postoperative immobilisation were found to be the greatest risk factors for lethal embolism of the pulmonary artery. Examination of the venous flow bed by non-invasive methods has proved to be indicated for any patient who has not resumed spontaneous movement on the fourth postoperative day. Diagnostic coverage has so far been achieved for 75 per cent of all patients still immobilised four days after surgery. Peroral or rectal administration of aspirin (1.5 g:24 h-1) is recommended for its good therapeutic effectiveness to reduce complications and for economic reasons.

Age Factors↗

Modularity from fluctuations in random graphs and complex networks.

The mechanisms by which modularity emerges in complex networks are not well understood but recent reports have suggested that modularity may arise from evolutionary selection. We show that finding the modularity of a network is analogous to finding the ground-state energy of a spin system. Moreover, we demonstrate that, due to fluctuations, stochastic network models give rise to modular networks. Specifically, we show both numerically and analytically that random graphs and scale-free networks have modularity. We argue that this fact must be taken into consideration to define statistically significant modularity in complex networks.

Journal Article↗

ASGCL: Adaptive Sparse Mapping-based graph contrastive learning network for cancer drug response prediction.

Personalized cancer drug treatment is emerging as a frontier issue in modern medical research. Considering the genomic differences among cancer patients, determining the most effective drug treatment plan is a complex and crucial task. In response to these challenges, this study introduces the Adaptive Sparse Graph Contrastive Learning Network (ASGCL), an innovative approach to unraveling latent interactions in the complex context of cancer cell lines and drugs. The core of ASGCL is the GraphMorpher module, an innovative component that enhances the input graph structure via strategic node attribute masking and topological pruning. By contrasting the augmented graph with the original input, the model delineates distinct positive and negative sample sets at both node and graph levels. This dual-level contrastive approach significantly amplifies the model's discriminatory prowess in identifying nuanced drug responses. Leveraging a synergistic combination of supervised and contrastive loss, ASGCL accomplishes end-to-end learning of feature representations, substantially outperforming existing methodologies. Comprehensive ablation studies underscore the efficacy of each component, corroborating the model's robustness. Experimental evaluations further illuminate ASGCL's proficiency in predicting drug responses, offering a potent tool for guiding clinical decision-making in cancer therapy.

Humans↗

On the limit cycle structure of threshold boolean networks over complete graphs.

In previous work, the limit structure of positive and negative finite threshold boolean networks without inputs (TBNs) over the complete digraph K(n) was analyzed and an algorithm was presented for computing this structure in polynomial time. Those results are generalized in this paper to cover the case of arbitrary TBNs over K(n). Although the limit structure is now more complicated, containing, not only fixed-points and cycles of length 2, but possibly also cycles of arbitrary length, a simple algorithm is still available for its determination in polynomial time. Finally, the algorithm is generalized to cover the case of symmetric finite boolean networks over K(n).

Algorithms↗

Random graph models of social networks.

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

Humans↗

A fast layout algorithm for protein interaction networks.

MOTIVATION: Graph drawing algorithms are often used for visualizing relational information, but a naive implementation of a graph drawing algorithm encounters real difficulties when drawing large-scale graphs such as protein interaction networks. RESULTS: We have developed a new, extremely fast layout algorithm for visualizing large-scale protein interaction networks in the three-dimensional space. The algorithm (1) first finds a layout of connected components of an entire network, (2) finds a global layout of nodes with respect to pivot nodes within a connected component and (3) refines the local layout of each connected component by first relocating midnodes with respect to their cutvertices and direct neighbors of the cutvertices and then by relocating all nodes with respect to their neighbors within distance 2. Advantages of this algorithm over classical graph drawing methods include: (1) it is an order of magnitude faster, (2) it can directly visualize data from protein interaction databases and (3) it provides several abstraction and comparison operations for effectively analyzing large-scale protein interaction networks. AVAILABILITY: http://wilab.inha.ac.kr/interviewer/

Algorithms↗