SEARCH · PubMed Health

Results for “network”

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 19 recordsLinked to original sources

PubMed2025

Gene behaviors-based network enrichment analysis and its application to reveal immune disease pathways enriched with COVID-19 severity-specific gene networks.

MOTIVATION: Gene network analysis is essential for understanding the complex mechanisms underlying diseases, which often involve disruptions in molecular networks rather than individual genes. Despite the availability of large-scale omics datasets and computational tools for gene network analysis, interpretation of the biological relevance of these extensive networks remains challenging. RESULTS: We propose a novel computational strategy, gene behaviors-based network enrichment analysis, which systematically identifies functional pathways enriched in phenotype-specific gene networks. Our novel method incorporates comprehensive network characteristics, i.e. gene expression levels, edge strengths, and structural patterns of edges, to rank genes based on activity and assess pathway enrichment, effectively identifying functional pathways enriched within these networks. Through simulation studies, our strategy demonstrated superior performance compared with that of existing methods in identifying enriched pathways. We applied this strategy to whole-blood RNA-seq data from 1102 COVID-19 samples provided by the Japan COVID-19 Task Force. The analysis revealed immune disease pathways enriched with COVID-19 severity-specific gene networks, including "Systemic lupus erythematosus" in asymptomatic and severe samples and "Inflammatory bowel disease," "Primary immunodeficiency," and "Rheumatoid arthritis" in mild samples. Key biomarkers of COVID-19, such as CXCL8, S100A9, and HLA class I genes, have been identified as critical hub genes and the main players within these networks. AVAILABILITY AND IMPLEMENTATION: Code is available in Figshare (https://doi.org/10.6084/m9.figshare.29093648.v3).

COVID-19↗

PubMed2026

BioNeuralNet: a graph neural network based Multi-Omics network data analysis tool.

SUMMARY: Multi-omics data offer unprecedented insights into complex biological systems, yet their high dimensionality, sparsity, and intricate interactions pose significant analytical challenges. Network-based approaches have advanced multi-omics research by effectively capturing biologically relevant relationships among molecular features (e.g., genes, proteins, metabolites). While these methods are powerful for representing molecular interactions, there remains a need for tools specifically designed to effectively utilize these network representations across diverse downstream analyses. To fulfill this need, we introduce BioNeuralNet, a flexible and modular Python framework tailored for end-to-end network-based multi-omics data analysis. BioNeuralNet leverages Graph Neural Networks (GNNs) to learn biologically meaningful low-dimensional representations from multi-omics networks, converting these complex molecular networks into versatile embeddings. BioNeuralNet supports all major stages of multi-omics network analysis, including several network construction techniques, generation of low-dimensional representations, and a broad range of downstream analytical tasks. Its extensive utilities, including diverse GNN architectures, and compatibility with established Python packages (e.g., scikit-learn, PyTorch, NetworkX), enhance usability and facilitate quick adoption. BioNeuralNet is an open-source, user-friendly, and extensively documented framework designed to support flexible and reproducible multi-omics network analysis in precision medicine. AVAILABILITY AND IMPLEMENTATION: The BioNeuralNet library is available via The Python Package Index (PyPI). Source code, documentation, tutorials, and workflows are hosted at https://bioneuralnet.readthedocs.io. Code archived at https://doi.org/10.5281/zenodo.17503083.

Graph Neural Networks↗

PubMed2025

MiNEApy: enhancing enrichment network analysis in metabolic networks.

MOTIVATION: Modeling genome-scale metabolic networks (GEMs) helps understand metabolic fluxes in cells at a specific state under defined environmental conditions or perturbations. Elementary flux modes (EFMs) are powerful tools for simplifying complex metabolic networks into smaller, more manageable pathways. However, the enumeration of all EFMs, especially within GEMs, poses significant challenges due to computational complexity. Additionally, traditional EFM approaches often fail to capture essential aspects of metabolism, such as co-factor balancing and by-product generation. The previously developed Minimum Network Enrichment Analysis (MiNEA) method addresses these limitations by enumerating alternative minimal networks for given biomass building blocks and metabolic tasks. MiNEA facilitates a deeper understanding of metabolic task flexibility and context-specific metabolic routes by integrating condition-specific transcriptomics, proteomics, and metabolomics data. This approach offers significant improvements in the analysis of metabolic pathways, providing more comprehensive insights into cellular metabolism. RESULTS: Here, I present MiNEApy, a Python package reimplementation of MiNEA, which computes minimal networks and performs enrichment analysis. I demonstrate the application of MiNEApy on both a small-scale and a genome-scale model of the bacterium Escherichia coli, showcasing its ability to conduct minimal network enrichment analysis using minimal networks and context-specific data. AVAILABILITY AND IMPLEMENTATION: MiNEApy can be accessed at: https://github.com/vpandey-om/mineapy.

Metabolic Networks and Pathways↗

PubMed2026

Integrative computational analysis combining network pharmacology, regulatory network modeling, and molecular dynamics reveals the mechanisms of Quanshen compound in ITP.

UNLABELLED: Immune thrombocytopenia (ITP) is a hemorrhagic disorder caused by immune dysfunction. Quanshen Compound (QSC) is an in-house preparation developed by the Uyghur Hospital in Hotan Prefecture. This study primarily investigates and validates the potential pharmacological basis and mechanism of action of QSC in modulating immune thrombopoiesis. Based on the multi-database screening of the QSC and the related targets of ITP, the intersection was obtained to construct a protein-protein interaction (PPI) network and screen the core targets; the intersection targets were analyzed for gene ontology (GO) functional enrichment and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway analysis using R packages; a component-target-pathway network was constructed to screen the key active components and their mechanisms of action. At the same time, the TF-mRNA-miRNA regulatory network of the core targets was constructed, and chromosome localization and subcellular localization analysis were performed; further, the binding stability of key components and core targets was verified through molecular docking and molecular dynamics simulation. A total of 227 potential target sites were screened out, among which TNF, IL6, AKT1, TP53 and IL1B were the core targets. The enrichment results indicated that these intersecting target sites mainly participated in inflammatory responses, immune regulation and hemostasis-related biological processes, and were significantly enriched in the PI3K-Akt signaling pathway, Toll-like receptor signaling pathway, Th17 cell differentiation and PD-1/PD-L1 signaling pathway. The core target TF-mRNA-miRNA regulatory network contained 184 nodes and 200 edges, suggesting that the core targets were subject to multi-level regulation. Molecular docking results showed that the main active components had good binding activity with the core targets, and molecular dynamics simulation further verified the stability of the complex. QSC may improve ITP through a multi-component, multi-target, and multi-pathway synergistic mechanism involving key targets such as TNF, IL6, AKT1, TP53, and IL1B, as well as the PI3K-Akt signaling pathway. These findings provide new insights into the potential therapeutic mechanisms of QSC against ITP and warrant further experimental validation. SUPPLEMENTARY INFORMATION: The online version contains supplementary material available at https://doi.org/10.1007/s40203-026-00718-0.

Immune thrombocytopenia↗

PubMed2025

Integration of multi-source gene interaction networks and omics data with graph attention networks to identify novel disease genes.

MOTIVATION: The pathogenesis of diseases is closely associated with genes, and the discovery of disease genes holds significant importance for understanding disease mechanisms and designing targeted therapeutics. However, biological validation of all genes for diseases is expensive and challenging. RESULTS: In this study, we propose DGP-AMIO, a computational method based on graph attention networks, to rank all unknown genes and identify potential novel disease genes by integrating multi-omics and gene interaction networks from multiple data sources. DGP-AMIO outperforms other methods significantly on 20 disease datasets, with an average AUROC and AUPR exceeding 0.9. The superior performance of DGP-AMIO is attributed to the integration of multiomics and gene interaction networks from multiple databases, as well as triGAT, a proposed GAT-based method that enables precise identification of disease genes in directed gene networks. Enrichment analysis conducted on the top 100 genes predicted by DGP-AMIO and literature research revealed that a majority of enriched GO terms, KEGG pathways and top genes were associated with diseases supported by relevant studies. We believe that our method can serve as an effective tool for identifying disease genes and guiding subsequent experimental validation efforts. AVAILABILITY AND IMPLEMENTATION: DGP-AMIO is publicly available at https://github.com/yangkaiyuan1027/DGP-AMIO.

Gene Regulatory Networks↗

PubMed1978

The replication of kinetoplast DNA networks in Crithidia fasciculata.

Kinetoplast DNA from the mitochondria of Crithidia is in the form of a two-dimensional network of thousands of minicircles each containing about 2.5 kb, and a small number of maxicircles each containing about 40 kb. Fractionation of kinetoplast DNA by equilibrium centrifugation in a CsCl-propidium diiodide gradient resolves it into three types of networks. Form I networks band at high density and contain minicircles which are covalently closed; form II networks band at low density and contain minicircles which are nicked or gapped; and replicating networks band at intermediate density and contain some minicircles of each type. Form I networks contain about 5000 minicircles; form II networks contain about 11,000; and replicating networks contain an intermediate number. When cells are pulse-labeled with 3H-thymidine, radioactivity in mitochondrial DNA is preferentially incorporated into replicating networks, but after a chase it appears first in form II networks and finally in form I. Examination of replicating networks by electron microscopy in the presence of ethidium bromide reveals that minicircles in the central region of the network are twisted and therefore covalently closed, whereas those in the peripheral region are not twisted and therefore must be nicked or gapped. The pulse-label is incorporated into the nicked or gapped minicircles of the replicating networks. These results indicate that replication of form I networks begins in peripheral minicircles and that progeny minicircles remain nicked or gapped. As replication proceeds, the size of the network increases, and the peripheral zone of nicked or gapped minicircles enlarges. Finally, when all minicircles have replicated, the network, now form II is double the size of form I and contains only nicked or gapped minicircles. The final step in replication presumably includes both the cleavage of the network into two form I species and the covalent closure of all the minicircles.

Animals↗

PubMed2026

PaNDA: Efficient Optimization of Phylogenetic Diversity in Networks.

Phylogenetic diversity (PD) plays an important role in biodiversity, conservation, and evolutionary studies by measuring the diversity of a set of taxa based on their phylogenetic relationships. In phylogenetic trees, a subset of k taxa with maximum PD can be found by a simple and efficient greedy algorithm. However, this algorithmic tractability is lost when considering phylogenetic networks, which incorporate reticulate evolutionary events such as hybridization and horizontal gene transfer. To address this challenge, we introduce PaNDA (Phylogenetic Network Diversity Algorithms), the first software package and interactive graphical user-interface for exploring, visualizing, and maximizing diversity in phylogenetic networks. PaNDA includes a novel algorithm to find a subset of k taxa with maximum diversity, running in polynomial time for networks of bounded scanwidth, a measure of tree-likeness of a network that grows slower than the well-known level measure. This algorithm considers the variant of PD on networks in which the branch lengths of all paths from the root to the selected taxa contribute towards their diversity. We demonstrate the scalability of this algorithm on simulated networks, successfully analyzing level-15 networks with up to 200 taxa in seconds. We also provide a proof-of-concept analysis using a phylogenetic network on Xiphophorus species, illustrating how the tool can support diversity studies based on real genomic data. The software is easily installable and freely available at https://github.com/nholtgrefe/panda. Additionally, we extend the definition of PD to semi-directed phylogenetic networks, which are mixed graphs increasingly used in phylogenetic analysis to model uncertainty of the root location. We prove that finding a subset of k taxa with maximum diversity remains NP-hard on semi-directed networks, but do present a polynomial-time algorithm for networks with bounded level.

network↗

PubMed1979

Structure and dynamics of neural network oscillators.

Techniques are given to represent oscillating neural networks by asynchronous logical switching networks, and to analyze the oscillating networks using a directed graph called a state transition diagram. Consideration is restricted to network oscillators containing no rhythm determining pacemaker neurons, and no neurons exhibiting self-limiting properties such as post-inhibitory rebound or accumulating refractoriness. In the state transition diagrams, stable oscillations are associated with a particular geometric configuration called a cyclic attractor (the heavy cycle in Fig. 2). We show that given the network connectivity it is possible to predict autonomous dynamic behaviour, as well as behaviour following hyperpolarizing or depolarizing inputs to neurons of the network. Conversely, given information about patterns of firing activity during cycles and transients of neural networks, the network connectivity can be predicted. The theoretical techniques can be used to generate a census of network structures capable of generating stable oscillations. Several representative network oscillators are discussed in the context of previous theoretical and experimental studies of the structure of neural network oscillators. Although the number of theoretically possile network oscillators capable of generating sustained oscillations is very large, the techniques which are given should be useful in the design of experiments capable of distinguishing between equally plausible hypotheses.

Action Potentials↗

PubMed1976

A critical evaluation of the relationship between the presynaptic network, synaptic vesicles and dense projections in central synapses.

Synapses of the oculomotor nucleus of Echidna have been examined ultrastructurally with the aim of integrating data obtained from osmicated and nonosmicated PTA stained material. Particular emphasis has been laid on the relationship between the synaptic vesicles of the osmicated material and the presynaptic network and vesicular grid of the PTA material. This relationship has been explored qualitatively by examining osmicated material of varying qualities of fixation. Such material contains dense projections in addition to synaptic vesicles, and various vesicular network appearances. A variety of measurement techniques have shown that the PTA network is characterised by reticular strands, spaces, and regular hexagonal units smaller than vesicles, these observations prompting the formulation of a "vesicle-network coincidence" model of the presynaptic terminal. This model has been tested by tracing the profiles of vesicles within the PTA network and comparing their size and shape frequency distributions with those of osmicated synaptic vesicles. The distributions have been found to be essentially similar, suggesting that vesicles can be located within the network, and that the hexagonal network units are formed only in the presence of an underlying vesicular matrix. Additionally, the following points have emerged: 1) the dense projections in the two types of material appear to be quivalent; 2) a loose correlation exists between dense projections and vesicles in osmicated terminals, increase in the area of the dense projections being associated with a decrease in the area of the vesicles; 3) network and dense projection units are similar. In view of the similarity between network and dense projection units, the demonstrated vesicular basis of the network raises the question of whether dense projections are entirely independent structures, or whether they depend in part for their existence on the nearby presence of synaptic vesicles.

Animals↗

PubMed1979

Spatial firing patterns of auditory neuron network modelling by computer simulation.

This communication examines, in digital computer simulated network, input signals and response patterns established at excitatory neurons' level i.e. the membrane potential of neuron soma. It is restricted to spatial patterns of the auditory neuron networks and time factor for nervous conduction and transmission is neglected compared with long maintained membrane potentials of neuron somas. The model analyzes the change in the spatial patterns of the membrane potential in the two dimensional networks of the auditory system. In order to evaluate the contribution of the various parameters, it is started that the simplest model has only one parameter, lateral inhibition. The other parameters are then added, one at a time, to successive models. The lateral inhibition is a necessary condition in the auditory nervous system if any sharpening of the response areas in the single neurons is to occur. A necessary condition for the validity of the model is that is should be applicable to the other senses such as vision and chemical patterns, taste. The threshold feature of auditory neurons aids in producing a sharpening in the neuron of the auditory relay nuclei. It does this clipping the spatial response patterns in one dimensional arrays of excitatory neurons. Recurrent inhibition seems a necessary condition in the sensory nervous system that any kinds of input signals are to be preserved over a wide range of stimulus intensity. In other words, this network has a wide dynamic range against any kinds of input signals. A simple self-recurrent negative feedback does not contribute to the sharpening, but more complex socalled averaged type does. A neuron network is capable of responding stably to stimuli with a wide range of intensity and with any kind of spatial patterns if there is a simple negative feedback mechanism. When there is no negative feedback, input signals soon disappear or saturate in the neuron network. Therefore, recurrent inhibition is the most important mechanism. Spontaneous activity appears to aid in the sharpening by providing a kind of contrast, that is by reducting the amount of activity in neurons adjacent to the excitatory area. Moreover, the effect of spontaneous activity in the model seems to make repples around the excitatory area and suggests that an introduction of activity at any stage of the networks, from whatever source for example reticulum formation and thalamus, might appreciably alter the response patterns at subsequent neuron network. This suggests that the mechanism of the consciousness that might be controlled by the thalamus and or reticular formation. These two dimensional neuron networks may be expanded to three dimensional neuron networks. The former might simulate the auditory nervous system while the latter might simulate the visual system.

Animals↗

PubMed2026

Cells and Networks in Flux: Rethinking Ontogenesis and Pathogenesis.

Organ and tissue functions emerge from the coordinated activity of cell networks. Therapeutics that act on pathogenic cell networks, modulating their cellular interplay, follow naturally. Over several decades, our laboratory has developed a series of approaches for rewiring cell networks, culminating in a class of cell surface-directed signal converter proteins (SCPs) that do so by modulating juxtacrine and autocrine signaling in and among their nodal cells. A first such SCP has now produced encouraging clinical data for cancer immunotherapy. Yet, these early network-directed fusion proteins rest on a deliberately simplified picture: discrete end-cell types plugged into graphically tractable networks. That picture is increasingly at odds with what computational cell typing and spatiotemporal analytics, along with epigenetics, now reveal-a hyperdiverse, plastic, experience-shaped cellular landscape embedded in dynamic, multiway networks. Setting the stage for a next generation of network modulators, an extended cell differentiation synthesis is proposed, which formalizes paracell ultradifferentiation and aging-associated differentiation phases. According to this model, cells are ever evolving, and no two cells are alike. A richer cellular ontology forces a more elaborate network ontology, with paralogous networks and their shifting subnetworks opening a concrete design space for next-generation network-directed SCP therapeutics. This exploration calls for a willingness to embrace complexity more fully and borrow freely from conceptual fields close and afar.

Humans↗

PubMed2026

Schizophrenia and bipolar disorder: a comparative analysis of genetic and brain network connectivity.

BACKGROUND: Schizophrenia (SCZ) and bipolar disorder (BD) are severe psychiatric conditions with overlapping clinical presentations, genetic risk factors, and brain network dysfunction. Whether alterations in large-scale intrinsic brain networks reflect shared or disorder-specific genetic influences remains poorly understood. Clarifying this distinction is essential for refining etiological models and improving diagnostic precision. METHODS: Genome-wide inferred statistics (GWIS) were applied to decompose the genetic architecture of SCZ and BD into shared and unique components. Using resting-state network (RSN) data from the UK Biobank, functional connectivity (FC) and structural connectivity (SC) were extracted as neuroimaging phenotypes. Causal inference approaches were subsequently employed to infer potential directional relationships between brain network connectivity and each disorder. RESULTS: Analyses revealed both common and distinct patterns of brain network connectivity associated with SCZ and BD. Notably, SC within the default mode network (DMN) exhibited opposing effects across the two disorders, suggesting divergent structural underpinnings despite clinical overlap. Additionally, SC within the limbic network (LN) and frontotemporal control network demonstrated potential causal relationships with both conditions, implicating these circuits astransdiagnostic neural substrates. CONCLUSION: These findings illuminate the shared and disorder-specific genetic and neural architecture underlying SCZ and BD. Integrating genome-wide genetic methods with large-scale neuroimaging data offers a powerful framework for disentangling psychiatric comorbidity and may inform more targeted diagnostic criteria and individualized treatment strategies.

Humans↗

PubMed2025

Beyond Level-1: Identifiability of a Class of Galled Tree-Child Networks.

Inference of phylogenetic networks is of increasing interest in the genomic era. However, the extent to which phylogenetic networks are identifiable from various types of data remains poorly understood, despite its crucial role in justifying methods. This work obtains strong identifiability results for large sub-classes of galled tree-child semidirected networks. Some of the conditions our proofs require, such as the identifiability of a network's tree of blobs or the circular order of 4 taxa around a cycle in a level-1 network, are already known to hold for many data types. We show that all these conditions hold for quartet concordance factor data under various gene tree models, yielding the strongest results from 2 or more samples per taxon. Although the network classes we consider have topological restrictions, they include non-planar networks of any level and are substantially more general than level-1 networks - the only class previously known to enjoy identifiability from many data types. Our work establishes a route for proving future identifiability results for tree-child galled networks from data types other than quartet concordance factors, by checking that explicit conditions are met.

Mathematical Concepts↗

PubMed2025

DyNDG: Identifying Leukemia-related Genes Based on Time-series Dynamic Network by Integrating Differential Genes.

Leukemia is a malignant disease characterized by progressive accumulation with high morbidity and mortality rates, and investigating its disease genes is crucial for understanding its etiology and pathogenesis. Network propagation methods have emerged and been widely employed in disease gene prediction, but most of them focus on static biological networks, which hinders their applicability and effectiveness in the study of progressive diseases. Moreover, there is currently a lack of special algorithms for the identification of leukemia disease genes. Here, we proposed a novel Dynamic Network-based model integrating Differentially expressed Genes (DyNDG) to identify leukemia-related genes. Initially, we constructed a time-series dynamic network to model the development trajectory of leukemia. Then, we built a background-temporal multilayer network by integrating both the dynamic network and the static background network, which was initialized with differentially expressed genes at each stage. To quantify the associations between genes and leukemia, we extended a random walk process to the background-temporal multilayer network. The results demonstrate that DyNDG achieves superior accuracy compared to several state-of-the-art methods. Moreover, after excluding housekeeping genes, DyNDG yields a set of promising candidate genes associated with leukemia progression or potential biomarkers, indicating the value of dynamic network information in identifying leukemia-related genes. The implementation of DyNDG is available at both https://ngdc.cncb.ac.cn/biocode/tool/BT7617 and https://github.com/CSUBioGroup/DyNDG.

Leukemia↗

PubMed2025

Computational network biology analysis revealed COVID-19 severity markers: Molecular interplay between HLA-II with CIITA.

COVID-19, severe acute respiratory syndrome coronavirus 2, rapidly spread worldwide. Severe and critical patients are expected to rapidly deteriorate. Although several studies have attempted to uncover the mechanisms underlying COVID-19 severity, most have focused on the perturbations of single genes. However, the complex mechanism of COVID-19 involves numerous perturbed genes in a molecular network rather than a single abnormal gene. Thus, we aimed to identify COVID-19 severity-specific markers in the Japanese population using gene network analysis. In order to reveal the severity-specific molecular interplays, we developed a novel computational network biology strategy that measures dissimilarity between networks based on the comprehensive information of gene network (i.e., expression levels of genes and network structure) by using Kullback-Leibler divergence. Monte Carlo simulations demonstrated the effectiveness of our strategy for differential gene network analysis. We applied this method to publicly available whole blood RNA-seq data from the Japan coronavirus disease 2019 Task Force and identified differentially regulated molecular interplays between 368 severe and 105 non-severe samples. Our analysis suggests the gene network between HLA class II, CIITA, and CD74 as a COVID-19 severity specific molecular marker. Although the association between HLA class II and COVID-19 has been demonstrated, our data analysis revealed that the molecular interplay of HLA class II with its target and/or regulator is a crucial marker for COVID-19 severity. Our findings from computational network biology analysis suggest that suppression and activation of the molecular interplay between HLA class II, CIITA, and CD74 provide crucial clues to uncover the mechanisms of COVID-19 severity.

Humans↗

PubMed2025

Glaucoma and brain functional networks: a bidirectional Mendelian randomisation study.

OBJECTIVE: Glaucoma is a complex neurodegenerative ocular disorder accompanied by brain functional abnormalities that extend beyond the visual system. However, the causal association between the two remains unclear at present. This study aimed to investigate the potential causal relationships between glaucoma and brain functional networks in order to provide novel insights into the neuropathic mechanism of glaucoma. METHODS AND ANALYSIS: Based on the genome-wide association studies data of glaucoma and resting-state functional MRI (Rs-fMRI), a bidirectional Mendelian randomisation (MR) analysis was conducted between glaucoma and brain functional networks. Inverse variance weighting was applied as the primary method to estimate causality with false discovery rate correction. Additional sensitivity analyses were conducted to evaluate the robustness of the results. RESULTS: Forward MR analysis suggested that glaucoma was causally associated with two brain networks between the subcortical cerebellum and the attention or visual network (p=0.022), as well as the default mode and central executive network (p=0.008), but without significance after false discovery rate correction (q>0.1). Reverse MR analysis revealed 19 Rs-fMRI traits related to glaucoma risk, including the salience or central executive network in the frontal region (p=0.0005, q=0.08) and the motor network (p=0.0009, q=0.08) with significant causality. CONCLUSIONS: This MR study revealed potentially causal relationships between glaucoma and brain functional networks. Especially, the functional connectivity of the motor network between the postcentral or precentral areas may potentially lead to increased risk of glaucoma.

Humans↗

PubMed2025

Balanced state of networks of winner-take-all units.

Irregularly timed action potentials, or spikes, are pervasively observed in the brain activity of awake mammals. However, the role of this temporal irregularity in neural computation is still not well understood. In canonical network models irregular spiking emerges via balanced, fluctuating input currents, leading to collective responses that track inputs linearly. How networks characterized by irregular spiking could support flexible nonlinear dynamics needed for general-purpose computation remains under ongoing debate. Here we characterize the dynamics of networks whose elementary unit is not a single neuron but a small group of neurons, with distinct tunings, that compete at each timestep via a winner-take-all (WTA) interaction. While WTA has long been proposed as an elementary functional motif in the brain and represents a powerful computational primitive, how large networks of such units behave has received less investigation. We show that these networks, like classic excitatory-inhibitory balanced networks, exhibit a chaotic fluctuation-driven regime characterized by sustained irregular activity resembling realistic cortical spiking, which we interpret as a multidimensional balance spread over several competing neural populations with different tunings. We develop a mean-field theory for the network, which shows how irregular spiking sustained by time-varying input fluctuations can support flexible nonlinear collective dynamics. Using the theory we predict and verify network regimes in which input fluctuations alone yield multistability, stable sequence generation, or complex heterogeneous firing rate dynamics-three core dynamical primitives thought to underlie memory-dependent neural computation-via consistent Poisson-like spiking produced through chaos. Thus, networks of WTA units support a chaotic fluctuation-driven regime characterized by irregular spiking that can power complex nonlinear collective dynamics. This represents a new model of brain activity capable of simultaneously reproducing realistic spike trains and diverse nonlinear firing rate patterns well posed for flexible computation, and which can be trained or fit to data.

Models, Neurological↗

PubMed2026

Screening of biomarkers related to lung adenocarcinoma based on construction of ceRNA regulation network.

BACKGROUND: Lung adenocarcinoma (LUAD) is a common malignant tumor with a poor prognosis and limited effective therapeutic targets. The underlying molecular regulatory mechanisms driving its progression remain largely unclear. The study objectives were to build a circRNA-miRNA-mRNA ceRNA regulation network of LUAD and to identify miRNAs and mRNAs significantly related to the prognosis . METHODS: The gene expression data and GSE101684 were downloaded from the UCSC Xene and NCBI-GEO databases, respectively. The differentially expressed RNAs (DEcircRNAs, DEmiRNAs, and DEmRNAs; DERs) were obtained by the Limma package in R. Then, the differential LUAD-related genes were identified, and the Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathways of the differential LUAD-related genes were analyzed. Moreover, the circRNA-miRNA-mRNA ceRNA network of LUAD was built. The Kaplan-Meier (K-M) survival curve analysis of ceRNA network nodes was performed. In addition, the proliferation-related ceRNA network was built. RESULTS: A total of 382 DEcircRNAs, 1907 DEmRNAs and 156 DEmiRNAs were acquired. A total of 245 differential LUAD-related genes were acquired, which were significantly associated with 189 GO biological processes (BP) and 17 KEGG pathways. Moreover, the ceRNA network of LUAD was built. The K-M survival curve analysis of ceRNA network nodes revealed that a total of 2 miRNAs (hsa-miR-96-5p and hsa-miR-125b-2-3p) and 22 mRNAs (CGNL1, CTHRC1, TK1, etc) were significantly related to the prognosis. mRNAs were significantly enriched in 92 GO BPs (such as cell division, cell adhesion) and 9 KEGG pathways (such as cell cycle, HTLV-1 infection). In addition, the proliferation-related ceRNA network was built. CONCLUSION: This research built a ceRNA regulation network of LUAD and is of great significance for identifying biomarkers related to the prognosis in LUAD.

Humans↗