PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Network inference”

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 73 records · Page 4Linked to original sources
PubMed2003

Inferring genetic networks and identifying compound mode of action via expression profiling.

The complexity of cellular gene, protein, and metabolite networks can hinder attempts to elucidate their structure and function. To address this problem, we used systematic transcriptional perturbations to construct a first-order model of regulatory interactions in a nine-gene subnetwork of the SOS pathway in Escherichia coli. The model correctly identified the major regulatory genes and the transcriptional targets of mitomycin C activity in the subnetwork. This approach, which is experimentally and computationally scalable, provides a framework for elucidating the functional properties of genetic networks and identifying molecular targets of pharmacological compounds.

Algorithms↗
PubMed2003

Inference of common genetic network using fuzzy adaptive resonance theory associated matrix method.

Inferring genetic networks from gene expression data is the most challenging work in the post-genomic era. However, most studies tend to show their genetic network inference ability by using artificial data. Here, we developed the fuzzy adaptive resonance theory associated matrix (F-ART matrix) method to infer genetic networks and applied it to experimental time series data, which are gene expression profiles of Saccharomyces cerevisiae responding under oxidative stresses such as diamide, heat shock and H2O2. We preprocessed them using the fuzzy adaptive resonance theory and successfully identified genetic interactions by drawing a 2-dimensional matrix. The identified interactions between diamide and heat shock stress were confirmed to be the common interactions for two stresses, compared with the KEGG metabolic map, BRITE protein interaction map, and gene interaction data of other papers. In the predicted common genetic network, the hit ratio was 60% for the KEGG map. Several gene interactions were also drawn, which have been reported to be important in oxidative stress. This result suggests that F-ART matrix has the potential to function as a new method to extract the common genetic networks of two different stresses using experimental time series microarray data.

Journal Article↗
PubMed2006

Computational inference of neural information flow networks.

Determining how information flows along anatomical brain pathways is a fundamental requirement for understanding how animals perceive their environments, learn, and behave. Attempts to reveal such neural information flow have been made using linear computational methods, but neural interactions are known to be nonlinear. Here, we demonstrate that a dynamic Bayesian network (DBN) inference algorithm we originally developed to infer nonlinear transcriptional regulatory networks from gene expression data collected with microarrays is also successful at inferring nonlinear neural information flow networks from electrophysiology data collected with microelectrode arrays. The inferred networks we recover from the songbird auditory pathway are correctly restricted to a subset of known anatomical paths, are consistent with timing of the system, and reveal both the importance of reciprocal feedback in auditory processing and greater information flow to higher-order auditory areas when birds hear natural as opposed to synthetic sounds. A linear method applied to the same data incorrectly produces networks with information flow to non-neural tissue and over paths known not to exist. To our knowledge, this study represents the first biologically validated demonstration of an algorithm to successfully infer neural information flow networks.

Action Potentials↗
PubMed2005

Are scale-free networks robust to measurement errors?

BACKGROUND: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false negative links in the observed networks, especially in biological networks inferred from high-throughput experiments. Therefore, it is important to study the impact of these measurement errors on the topology of the observed networks. RESULTS: This article addresses the impact of erroneous links on network topological inference and explores possible error mechanisms for scale-free networks with an emphasis on Saccharomyces cerevisiae protein interaction networks. We study this issue by both theoretical derivations and simulations. We show that the ignorance of erroneous links in network analysis may lead to biased estimates of the scale parameter and recommend robust estimators in such scenarios. Possible error mechanisms of yeast protein interaction networks are explored by comparisons between real data and simulated data. CONCLUSION: Our studies show that, in the presence of erroneous links, the connectivity distribution of scale-free networks is still scale-free for the middle range connectivities, but can be greatly distorted for low and high connecitivities. It is more appropriate to use robust estimators such as the least trimmed mean squares estimator to estimate the scale parameter gamma under such circumstances. Moreover, we show by simulation studies that the scale-free property is robust to some error mechanisms but untenable to others. The simulation results also suggest that different error mechanisms may be operating in the yeast protein interaction networks produced from different data sources. In the MIPS gold standard protein interaction data, there appears to be a high rate of false negative links, and the false negative and false positive rates are more or less constant across proteins with different connectivities. However, the error mechanism of yeast two-hybrid data may be very different, where the overall false negative rate is low and the false negative rates tend to be higher for links involving proteins with more interacting partners.

Algorithms↗
PubMed2026

Differential cell signaling testing for cell-cell communication inference from single-cell data by dominoSignal.

MOTIVATION: Algorithms for ligand-receptor network inference have emerged as commonly used tools to estimate cell-cell communication from reference single-cell data. Many studies employ these algorithms to compare signaling between conditions and lack methods to statistically identify signals that are significantly different. We previously developed the cell communication inference algorithm Domino, which considers ligand and receptor gene expression in association with downstream transcription factor activity scoring. We developed the dominoSignal software to innovate upon Domino and extend its functionality to test statistically differential cellular signaling. RESULTS: This new functionality includes the compilation of active signals as linkages from multiple subjects in a single-cell data set and testing condition-dependent signaling linkage. The software is applicable for analysis of single-cell data sets with multiple subjects as biological replicates as well as with bootstrapped replicates from data sets with few or pooled subjects. We use simulation studies to benchmark the number of subjects in compared groups and cells within an annotated cell type sufficient to accurately identify differential linkages. We demonstrate the application of the Differential Cell Signaling Test (DCST) in the dominoSignal software to investigate consequences of cancer cell phenotypes and immunotherapy on cell-cell communication in tumor microenvironments. These applications in cancer studies demonstrate the ability of differential cell signaling analysis to infer changes to cell communication networks from therapeutic or experimental perturbations, which is broadly applicable across biological systems. AVAILABILITY: dominoSignal is available through Bioconductor at https://www.bioconductor.org/packages/release/bioc/html/dominoSignal.html.

Cell Communication↗
PubMed2004

A novel prosodic-information synthesizer based on recurrent fuzzy neural network for the Chinese TTS system.

In this paper, a new technique for the Chinese text-to-speech (TTS) system is proposed. Our major effort focuses on the prosodic information generation. New methodologies for constructing fuzzy rules in a prosodic model simulating human's pronouncing rules are developed. The proposed Recurrent Fuzzy Neural Network (RFNN) is a multilayer recurrent neural network (RNN) which integrates a Self-cOnstructing Neural Fuzzy Inference Network (SONFIN) into a recurrent connectionist structure. The RFNN can be functionally divided into two parts. The first part adopts the SONFIN as a prosodic model to explore the relationship between high-level linguistic features and prosodic information based on fuzzy inference rules. As compared to conventional neural networks, the SONFIN can always construct itself with an economic network size in high learning speed. The second part employs a five-layer network to generate all prosodic parameters by directly using the prosodic fuzzy rules inferred from the first part as well as other important features of syllables. The TTS system combined with the proposed method can behave not only sandhi rules but also the other prosodic phenomena existing in the traditional TTS systems. Moreover, the proposed scheme can even find out some new rules about prosodic phrase structure. The performance of the proposed RFNN-based prosodic model is verified by imbedding it into a Chinese TTS system with a Chinese monosyllable database based on the time-domain pitch synchronous overlap add (TD-PSOLA) method. Our experimental results show that the proposed RFNN can generate proper prosodic parameters including pitch means, pitch shapes, maximum energy levels, syllable duration, and pause duration. Some synthetic sounds are online available for demonstration.

Journal Article↗
PubMed2004

An empirical Bayes approach to inferring large-scale gene association networks.

MOTIVATION: Genetic networks are often described statistically using graphical models (e.g. Bayesian networks). However, inferring the network structure offers a serious challenge in microarray analysis where the sample size is small compared to the number of considered genes. This renders many standard algorithms for graphical models inapplicable, and inferring genetic networks an 'ill-posed' inverse problem. METHODS: We introduce a novel framework for small-sample inference of graphical models from gene expression data. Specifically, we focus on the so-called graphical Gaussian models (GGMs) that are now frequently used to describe gene association networks and to detect conditionally dependent genes. Our new approach is based on (1) improved (regularized) small-sample point estimates of partial correlation, (2) an exact test of edge inclusion with adaptive estimation of the degree of freedom and (3) a heuristic network search based on false discovery rate multiple testing. Steps (2) and (3) correspond to an empirical Bayes estimate of the network topology. RESULTS: Using computer simulations, we investigate the sensitivity (power) and specificity (true negative rate) of the proposed framework to estimate GGMs from microarray data. This shows that it is possible to recover the true network topology with high accuracy even for small-sample datasets. Subsequently, we analyze gene expression data from a breast cancer tumor study and illustrate our approach by inferring a corresponding large-scale gene association network for 3883 genes.

Algorithms↗
PubMed2005

Inferring gene regulatory networks with time delays using a genetic algorithm.

Recently a state-space model with time delays for inferring gene regulatory networks was proposed. It was assumed that each regulation between two internal state variables had multiple time delays. This assumption caused underestimation of the model with many current gene expression datasets. In biological reality, one regulatory relationship may have just a single time delay, and not multiple time delays. This study employs Boolean variables to capture the existence of the time-delayed regulatory relationships in gene regulatory networks in terms of the state-space model. As the solution space of time delayed relationships is too large for an exhaustive search, a genetic algorithm (GA) is proposed to determine the optimal Boolean variables (the optimal time-delayed regulatory relationships). Coupled with the proposed GA, Bayesian information criterion (BIC) and probabilistic principle component analysis (PPCA) are employed to infer gene regulatory networks with time delays. Computational experiments are performed on two real gene expression datasets. The results show that the GA is effective at finding time-delayed regulatory relationships. Moreover, the inferred gene regulatory networks with time delays from the datasets improve the prediction accuracy and possess more of the expected properties of a real network, compared to a gene regulatory network without time delays.

Algorithms↗
PubMed2026

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↗
PubMed1998

Identification of patterns of neuronal connectivity--partial spectra, partial coherence, and neuronal interactions.

The cross-correlation histogram has provided the primary tool for inferring the structure of common inputs to pairs of neurones. While this technique has produced useful results it not clear how it may be extended to complex networks. In this report we introduce a linear model for point process systems. The finite Fourier transform of this model leads to a regression type analysis of the relations between spike trains. An advantage of this approach is that the full range of techniques for multivariate regression analyses becomes available for spike train analysis. The two main parameters used for the identification of neural networks are the coherence and partial coherences. The coherence defines a bounded measure of association between two spike trains and plays the role of a squared correlation coefficient defined at each frequency lambda. The partial coherences, analogous to the partial correlations of multiple regression analysis, allow an assessment of how any number of putative input processes may influence the relation between any two output processes. In many cases analytic solutions may be found for coherences and partial coherences for simple neural networks, and in combination with simulations may be used to test hypotheses concerning proposed networks inferred from spike train analyses.

Animals↗
PubMed2004

Tracking a maneuvering target using neural fuzzy network.

A fast target maneuver detecting and highly accurate tracking technique using a neural fuzzy network based on Kalman filter is proposed in this paper. In the automatic target tracking system, there exists an important and difficult problem: how to detect the target maneuvers and fast response to avoid miss-tracking? The traditional maneuver detection algorithms, such as variable dimension filter (VDF) and input estimation (IE) etc., are computation intensive and difficult to implement in real time. To solve this problem, neural network algorithms have been issued recently. However, the normal neural networks such as backpropagation networks usually produce the extra problems of low convergence speed and/or large network size. Furthermore, the way to decide the network structure is heuristic. To overcome these defects and to make use of neural learning ability, a developed standard Kalman filter with a self-constructing neural fuzzy inference network (KF-SONFIN) algorithm for target tracking is presented in this paper. By generating possible target trajectories including maneuver information to train the SONFIN, the trained SONFIN can detect when the maneuver occurred, the magnitude of maneuver values and when the maneuver disappeared. Without having to change the structure of Kalman filter nor modeling the maneuvering target, this new algorithm, SONFIN, can always find itself an economic network size with a fast learning process. Simulation results show that the KF-SONFIN is superior to the traditional IE and VDF methods in estimation accuracy.

Journal Article↗
PubMed2007

Large-scale mapping and validation of Escherichia coli transcriptional regulation from a compendium of expression profiles.

Machine learning approaches offer the potential to systematically identify transcriptional regulatory interactions from a compendium of microarray expression profiles. However, experimental validation of the performance of these methods at the genome scale has remained elusive. Here we assess the global performance of four existing classes of inference algorithms using 445 Escherichia coli Affymetrix arrays and 3,216 known E. coli regulatory interactions from RegulonDB. We also developed and applied the context likelihood of relatedness (CLR) algorithm, a novel extension of the relevance networks class of algorithms. CLR demonstrates an average precision gain of 36% relative to the next-best performing algorithm. At a 60% true positive rate, CLR identifies 1,079 regulatory interactions, of which 338 were in the previously known network and 741 were novel predictions. We tested the predicted interactions for three transcription factors with chromatin immunoprecipitation, confirming 21 novel interactions and verifying our RegulonDB-based performance estimates. CLR also identified a regulatory link providing central metabolic control of iron transport, which we confirmed with real-time quantitative PCR. The compendium of expression data compiled in this study, coupled with RegulonDB, provides a valuable model system for further improvement of network inference algorithms using experimental data.

Algorithms↗
PubMed2006

Unravelling gene networks from noisy under-determined experimental perturbation data.

Systems biology aims to study the properties of biological systems in terms of the properties of their molecular constituents. This occurs frequently by a process of mathematical modelling. The first step in this modelling process is to unravel the interaction structure of biological systems from experimental data. Previously, an algorithm for gene network inference from gene expression perturbation data was proposed. Here, the algorithm is extended by using regression with subset selection. The performance of the algorithm is extensively evaluated on a set of data produced with gene network models at different levels of simulated experimental noise. Regression with subset selection outperforms the previously stated matrix inverse approach in the presence of experimental noise. Furthermore, this regression approach enables us to deal with under-determination, that is, when not all genes are perturbed. The results on incomplete data sets show that the new method performs well at higher number of perturbations, even when noise levels are high. At lower number of perturbations, although still being able to recover the majority of the connections, less confidence can be placed in the recovered edges.

Cell Physiological Phenomena↗
PubMed2006

Causality and pathway search in microarray time series experiment.

MOTIVATION: Interaction among time series can be explored in many ways. All the approach has the usual problem of low power and high dimensional model. Here we attempted to build a causality network among a set of time series. The causality has been established by Granger causality, and then constructing the pathway has been implemented by finding the Minimal Spanning Tree within each connected component of the inferred network. False discovery rate measurement has been used to identify the most significant causalities. RESULTS: Simulation shows good convergence and accuracy of the algorithm. Robustness of the procedure has been demonstrated by applying the algorithm in a non-stationary time series setup. Application of the algorithm in a real dataset identified many causalities, with some overlap with previously known ones. Assembled network of the genes reveals features of the network that are common wisdom about naturally occurring networks.

Algorithms↗
PubMed1993

A decision aid for diagnosis of liver lesions on MRI.

Abdominal magnetic resonance imaging (MRI) plays an important role in the evaluation of liver abnormalities. The interpretation of MR images requires expert training in a rapidly changing field. DAFODILL (Decision Aid for Diagnosing Liver Lesions) is a decision-support tool designed to aid radiologists in the diagnosis of hepatic lesions seen on MRI. DAFODILL uses a knowledge base of MRI findings and a belief-network inference engine to generate probabilistic differential diagnoses of the most commonly encountered hepatic lesions. DAFODILL performs limited image processing to identify clinically relevant features, which are presented to the user for confirmation before they are used by the network. Preliminary evaluation of an initial version of the system suggests that DAFODILL may be a useful tool for radiology residents and nonexpert radiologists in interpreting MR images of the liver.

Artificial Intelligence↗
PubMed2025

Decoding the Functional Interactome of Non-Model Organisms with PHILHARMONIC.

Despite the widespread availability of genome sequencing pipelines, many genes remain part of the genome's "dark matter," where existing inference tools cannot even begin to guess the biological function of their proteins from sequence alone. This challenge is especially pronounced in organisms that are highly evolutionarily distant from well-studied models, where homology-based methods break down. Here, we describe PHILHARMONIC, a computational method that combines deep learning-based de novo protein interaction network inference with robust unsupervised spectral clustering and remote homology to illuminate functional organization in any non-model organism. From only a sequenced proteome, we show PHILHARMONIC predicts protein functions, functional communities, and higher-order network structure with high accuracy. We validate its performance using experimental gene expression and pathway data in D. melanogaster, and we demonstrate its broad utility by analyzing temperature sensing and stress response pathways in the reef-building coral P. damicornis and its algal symbiont C. goreaui. PHILHARMONIC provides a general-purpose engine for functional discovery and biological hypothesis generation in non-model organisms, enabling systems-level insights across the full diversity of life.

Journal Article↗
PubMed2004

Inferring pathways and networks with a Bayesian framework.

Numerous mathematical methods have been adapted and developed to quantitatively reverse engineer biological networks, for example, signal transduction pathways, from experimental micro-array data. Compared with stochastic methods, such as Boolean networks, and deterministic methods, such as thermodynamic or differential equation-based models, Bayesian network analysis has the ability to assess, with scoring metrics, causal relations based on conditional probabilities and thus permit hypothesis testing. The goal of this paper is to illustrate the integration of several Bayesian based techniques into a unified Bayesian framework that can infer hepatocellular networks from metabolic data. Reverse engineering of pathways and networks provides a framework for predictive modeling and hypotheses testing to gain deeper insight into living organisms, disease mechanisms, and targeted therapeutics. Evaluating this methodology initially against the known biochemical network provides confidence in the networks that are uncovered from the experimental data using this framework. From the metabolic data we inferred the known sub-networks, such as the tricarboxylic acid (TCA) and urea cycles. In addition, we combined the relationships learned from the data and our current knowledge of the biological system to postulate several alternative metabolic sub-network models that can predict a particular cellular function, such as intracellular triglyceride accumulation.

Algorithms↗