Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Graph”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

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

At least 595 records · Page 33Linked to original sources
PubMed2002

Protein structure comparison using bipartite graph matching and its application to protein structure classification.

A measure of protein structure similarity is calculated from the matching of pairs of secondary structure elements between two proteins. The interaction of each pair was estimated from their axial line segments and combined with other geometric features to produce an optimal discrimination between intrafamily and interfamily relationships. The matching used a fast bipartite graph-matching algorithm that avoids the computational complexity of searching for the full subgraph isomorphism between the two sets of interactions. The main algorithm used was the "stable marriage" algorithm, which works on the ranked "preferences" of one interaction for another. The method takes 1/10 of a second for a typical comparison making it suitable as a fast pre-filter for slower, more exhaustive approaches. An application to protein structure classification is described.

Algorithms↗
PubMed1980

Early detection of abnormal labor using the Friedman labor graph.

Early recognition and appropriate management of abnormal labor can reduce perinatal mortality and morbidity and lower the cesarean section rate. A simple labor graph devised over 25 years ago and later modified makes labor abnormalities easy to detect; the two main divisions of labor, the latent and active phases, are easily recognized. A prolonged latent phase has no serious effects on mother or fetus, but protraction and arrest disorders of the active phase--eg, protracted cervical dilatation, arrest or failure of descent of the presenting part--may have a deleterious effect. Common causes of a prolonged latent phase include false labor and inappropriate use of analgesia and anesthesia. Fetopelvic disproportion and fetal malposition are common causes of disorders of the active phase.

Adolescent↗
PubMed2004

A new computational efficient approach for trabecular bone analysis using beam models generated with skeletonized graph technique.

Micro-finite element (FE) analysis is a well established technique for the evaluation of the elastic properties of trabecular bone, but is limited in its application due to the large number of elements that it requires to represent the complex internal structure of the bone. In this paper, we present an alternative FE approach that makes use of a recently developed 3D-Line Skeleton Graph Analysis (LSGA) technique to represent the complex internal structure of trabecular bone as a network of simple straight beam elements in which the beams are assigned geometrical properties of the trabeculae that they represent. Since an enormous reduction of cputime can be obtained with this beam modeling approach, ranging from approximately 1,200 to 3,600 for the problems investigated here, we think that the FE modeling technique that we introduced could potentially constitute an interesting alternative for the evaluation of the elastic mechanical properties of trabecular bone.

Algorithms↗
PubMed2002

The dynamics of germinal centre selection as measured by graph-theoretical analysis of mutational lineage trees.

We have developed a rigorous graph-theoretical algorithm for quantifying the shape properties of mutational lineage trees. We show that information about the dynamics of hypermutation and antigen-driven clonal selection during the humoral immune response is contained in the shape of mutational lineage trees deduced from the responding clones. Age and tissue related differences in the selection process can be studied using this method. Thus, tree shape analysis can be used as a means of elucidating humoral immune response dynamics in various situations.

Algorithms↗
PubMed1993

Structure-activity maps for visualizing the graph variables arising in drug design.

Structure-activity problems are characterized by the topological and topographical character of the structural information determining the activity. Traditional statistical methodology requires that this predictive information be mapped to a vector space. To circumvent this vexing conversion of structural information to vector form, the edge-deletion metric is defined on the space of chemical graphs that defines the topology of the molecules. This paper proposes structure-activity maps and transformation-effect maps for directly visualizing the structure-activity relationships. The maps are illustrated using the hypotensive activities of clonidine analogs and the sweet taste of Perillartine analogs.

Clonidine↗
PubMed2001

BRIDGE 2 (Building the Relationship Between Body Image and Disordered Eating Graph and Explanation): interventions and transitions.

BRIDGE 2 (Building the Relationship Between Body Image and Disordered Eating Graph and Explanation): Interventions and Transitions, builds upon the framework presented in the first publication of BRIDGE. BRIDGE 2 moves beyond increasing the understanding of the relationship between body image and eating disorders and encourages a movement into action. First, it suggests the appropriate point of intervention for both parents and teachers. Second, the continuum of health care from promotion to prevention, to early intervention, and to basic and specialized treatment services is positioned on the BRIDGE framework. This added dimension offers a new level of understanding specific to eating disorders by utilizing concepts from mental health promotion and mental illness prevention literature.

Journal Article↗
PubMed2006

Mapping trait loci by use of inferred ancestral recombination graphs.

Large-scale association studies are being undertaken with the hope of uncovering the genetic determinants of complex disease. We describe a computationally efficient method for inferring genealogies from population genotype data and show how these genealogies can be used to fine map disease loci and interpret association signals. These genealogies take the form of the ancestral recombination graph (ARG). The ARG defines a genealogical tree for each locus, and, as one moves along the chromosome, the topologies of consecutive trees shift according to the impact of historical recombination events. There are two stages to our analysis. First, we infer plausible ARGs, using a heuristic algorithm, which can handle unphased and missing data and is fast enough to be applied to large-scale studies. Second, we test the genealogical tree at each locus for a clustering of the disease cases beneath a branch, suggesting that a causative mutation occurred on that branch. Since the true ARG is unknown, we average this analysis over an ensemble of inferred ARGs. We have characterized the performance of our method across a wide range of simulated disease models. Compared with simpler tests, our method gives increased accuracy in positioning untyped causative loci and can also be used to estimate the frequencies of untyped causative alleles. We have applied our method to Ueda et al.'s association study of CTLA4 and Graves disease, showing how it can be used to dissect the association signal, giving potentially interesting results of allelic heterogeneity and interaction. Similar approaches analyzing an ensemble of ARGs inferred using our method may be applicable to many other problems of inference from population genotype data.

Algorithms↗
PubMed2005

Constructing minimal ancestral recombination graphs.

By viewing the ancestral recombination graph as defining a sequence of trees, we show how possible evolutionary histories consistent with given data can be constructed using the minimum number of recombination events. In contrast to previously known methods, which yield only estimated lower bounds, our method of detecting recombination always gives the minimum number of recombination events if the right kind of rooted trees are used in our algorithm. A new lower bound can be defined if rooted trees with fewer constraints are used. As well as studying how often it actually is equal to the minimum, we test how this new lower bound performs in comparison to some other lower bounds. Our study indicates that the new lower bound is an improvement on earlier bounds. Also, using simulated data, we investigate how well our method can recover the actual site-specific evolutionary relationships. In the presence of recombination, using a single tree to describe the evolution of the entire locus clearly leads to lower average recovery percentages than does our method. Our study shows that recovering the actual local tree topologies can be done more accurately than estimating the actual number of recombination events.

Algorithms↗
PubMed2002

Effect heterogeneity by a matching covariate in matched case-control studies: a method for graphs-based representation.

The authors describe a method for assessing and characterizing effect heterogeneity related to a matching covariate in case-control studies, using an example from veterinary medicine. Data are from a case-control study conducted in Texas during 1997-1998 of 498 pairs of horses with colic and their controls. Horses were matched by veterinarian and by month of examination. The number of matched pairs of cases and controls varied by veterinarian. The authors demonstrate that there is effect heterogeneity related to this characteristic (i.e., cluster size of veterinarians) for the association of colic with certain covariates, using a moving average approach to conditional logistic regression and graphs-based methods. The method described in this report can be applied to examining effect heterogeneity (or effect modification) by any ordered categorical or continuous covariates for which cases have been matched with controls. The method described enables one to understand the pattern of variation across ordered categorical or continuous matching covariates and allows for any shape for this pattern. This method applies to effect modification when causality might be reasonably assumed.

Animals↗
PubMed2006

Invited commentary: the perils of birth weight--a lesson from directed acyclic graphs.

The strong association of birth weight with infant mortality is complicated by a paradoxical finding: Small babies in high-risk populations usually have lower risk than small babies in low-risk populations. In this issue of the Journal, Hernández-Díaz et al. (Am J Epidemiol 2006;164:1115-20) address this "birth weight paradox" using directed acyclic graphs (DAGs). They conclude that the paradox is the result of bias created by adjustment for a factor (birth weight) that is affected by the exposure of interest and at the same time shares causes with the outcome (mortality). While this bias has been discussed before, the DAGs presented by Hernández-Díaz et al. provide more firmly grounded criticism. The DAGs demonstrate (as do many other examples) that seemingly reasonable adjustments can distort epidemiologic results. In this commentary, the birth weight paradox is shown to be an illustration of Simpson's Paradox. It is possible for a factor to be protective within every stratum of a variable and yet be damaging overall. Questions remain as to the causal role of birth weight.

Causality↗
PubMed2025

Learning directed acyclic graphs for ligands and receptors based on spatially resolved transcriptomic data of ovarian cancer.

To unravel the mechanism of immune activation and suppression within tumors, a critical step is to identify transcriptional signals governing cell-cell communication between tumor and immune/stromal cells in the tumor microenvironment. Central to this communication are interactions between secreted ligands and cell-surface receptors, creating a highly connected signaling network among cells. Recent advancements in in situ-omics profiling, particularly spatial transcriptomic (ST) technology, provide unique opportunities to directly characterize ligand-receptor signaling networks that power cell-cell communication. In this paper, we propose a novel statistical method, LRnetST, to characterize the ligand-receptor interaction networks between adjacent tumor and immune/stroma cells based on ST data. LRnetST utilizes a directed acyclic graph model with a novel approach to handle the zero-inflated distributions of ST data. It also leverages existing ligand-receptor regulation databases as prior information, and employs a bootstrap aggregation strategy to achieve robust network estimation. Application of LRnetST to ST data of high-grade serous ovarian tumor samples revealed both common and distinct ligand-receptor regulations across different tumors. Some of these interactions were validated through both a MERFISH dataset and a CosMx SMI dataset of independent ovarian tumor samples. These results cast light on biological processes relating to the communication between tumor and immune/stromal cells in ovarian tumors. An open-source R package of LRnetST is available on GitHub at https://github.com/jie108/LRnetST.

Humans↗
PubMed2000

Protein domain decomposition using a graph-theoretic approach.

MOTIVATION: Automatic decomposition of a multi-domain protein into individual domains represents a highly interesting and unsolved problem. As the number of protein structures in PDB is growing at an exponential rate, there is clearly a need for more reliable and efficient methods for protein domain decomposition simply to keep the domain databases up-to-date. RESULTS: We present a new algorithm for solving the domain decomposition problem, using a graph-theoretic approach. We have formulated the problem as a network flow problem, in which each residue of a protein is represented as a node of the network and each residue--residue contact is represented as an edge with a particular capacity, depending on the type of the contact. A two-domain decomposition problem is solved by finding a bottleneck (or a minimum cut) of the network, which minimizes the total cross-edge capacity, using the classical Ford--Fulkerson algorithm. A multi-domain decomposition problem is solved through repeatedly solving a series of two-domain problems. The algorithm has been implemented as a computer program, called DomainParser. We have tested the program on a commonly used test set consisting of 55 proteins. The decomposition results are 78.2% in agreement with the literature on both the number of decomposed domains and the assignments of residues to each domain, which compares favorably to existing programs. On the subset of two-domain proteins (20 in number), the program assigned 96.7% of the residues correctly when we require that the number of decomposed domains is two.

Algorithms↗
PubMed2002

Multiple sequence alignment using partial order graphs.

MOTIVATION: Progressive Multiple Sequence Alignment (MSA) methods depend on reducing an MSA to a linear profile for each alignment step. However, this leads to loss of information needed for accurate alignment, and gap scoring artifacts. RESULTS: We present a graph representation of an MSA that can itself be aligned directly by pairwise dynamic programming, eliminating the need to reduce the MSA to a profile. This enables our algorithm (Partial Order Alignment (POA)) to guarantee that the optimal alignment of each new sequence versus each sequence in the MSA will be considered. Moreover, this algorithm introduces a new edit operator, homologous recombination, important for multidomain sequences. The algorithm has improved speed (linear time complexity) over existing MSA algorithms, enabling construction of massive and complex alignments (e.g. an alignment of 5000 sequences in 4 h on a Pentium II). We demonstrate the utility of this algorithm on a family of multidomain SH2 proteins, and on EST assemblies containing alternative splicing and polymorphism. AVAILABILITY: The partial order alignment program POA is available at http://www.bioinformatics.ucla.edu/poa.

Algorithms↗
PubMed2002

Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees.

MOTIVATION: Gene expression data clustering provides a powerful tool for studying functional relationships of genes in a biological process. Identifying correlated expression patterns of genes represents the basic challenge in this clustering problem. RESULTS: This paper describes a new framework for representing a set of multi-dimensional gene expression data as a Minimum Spanning Tree (MST), a concept from the graph theory. A key property of this representation is that each cluster of the expression data corresponds to one subtree of the MST, which rigorously converts a multi-dimensional clustering problem to a tree partitioning problem. We have demonstrated that though the inter-data relationship is greatly simplified in the MST representation, no essential information is lost for the purpose of clustering. Two key advantages in representing a set of multi-dimensional data as an MST are: (1) the simple structure of a tree facilitates efficient implementations of rigorous clustering algorithms, which otherwise are highly computationally challenging; and (2) as an MST-based clustering does not depend on detailed geometric shape of a cluster, it can overcome many of the problems faced by classical clustering algorithms. Based on the MST representation, we have developed a number of rigorous and efficient clustering algorithms, including two with guaranteed global optimality. We have implemented these algorithms as a computer software EXpression data Clustering Analysis and VisualizATiOn Resource (EXCAVATOR). To demonstrate its effectiveness, we have tested it on three data sets, i.e. expression data from yeast Saccharomyces cerevisiae, expression data in response of human fibroblasts to serum, and Arabidopsis expression data in response to chitin elicitation. The test results are highly encouraging. AVAILABILITY: EXCAVATOR is available on request from the authors.

Algorithms↗
PubMed2002

An automatic block and spot indexing with k-nearest neighbors graph for microarray image analysis.

MOTIVATION: In this paper, we propose a fully automatic block and spot indexing algorithm for microarray image analysis. A microarray is a device which enables a parallel experiment of ten to hundreds of thousands of test genes in order to measure gene expression. Due to this huge size of experimental data, automated image analysis is gaining importance in microarray image processing systems. Currently, most of the automated microarray image processing systems require manual block indexing and, in some cases, spot indexing. If the microarray image is large and contains a lot of noise, it is very troublesome work. In this paper, we show it is possible to locate the addresses of blocks and spots by applying the Nearest Neighbors Graph Model. Also, we propose an analytic model for the feasibility of block addressing. Our analytic model is validated by a large body of experimental results. RESULTS: We demonstrate the features of automatic block detection, automatic spot addressing, and correction of the distortion and skewedness of each microarray image.

Algorithms↗
PubMed2002

ProClust: improved clustering of protein sequences with an extended graph-based approach.

MOTIVATION: The problem of finding remote homologues of a given protein sequence via alignment methods is not fully solved. In fact, the task seems to become more difficult with more data. As the size of the database increases, so does the noise level; the highest alignment scores due to random similarities increase and can be higher than the alignment score between true homologues. Comparing two sequences with an arbitrary alignment method yields a similarity value which may indicate an evolutionary relationship between them. A threshold value is usually chosen to distinguish between true homologue relationships and random similarities. To compensate for the higher probability of spurious hits in larger databases, this threshold is increased. Increasing specificity however leads to decreased sensitivity as a matter of principle. Sensitivity can be recovered by utilizing refined protocols. A number of approaches to this challenge have made use of the fact that proteins are often members of some larger protein family. This can be exploited by using position-specific substitution matrices or profiles, or by making use of transitivity of homology. Transitivity refers to the concept of concluding homology between proteins A and C based on homology between A and a third protein B and between B and C. It has been demonstrated that transitivity can lead to substantial improvement in recognition of remote homologues particularly in cases where the alignment score of A and C is below the noise level. A natural limit to the use of transitivity is imposed by domains. Domains, compact independent sub-units of proteins, are often shared between otherwise distinct proteins, and can cause substantial problems by incorrectly linking otherwise unrelated proteins. RESULTS: We extend a graph-based clustering algorithm which uses an asymmetric distance measure, scaling similarity values based on the length of the protein sequences compared. Additionally, the significance of alignment scores is taken into account and used for a filtering step in the algorithm. Post-processing, to merge further clusters based on profile HMMs is proposed. SCOP sequences and their super-family level classification are used as a test set for a clustering computed with our method for the joint data set containing both SCOP and SWISS-PROT. Note, the joint data set includes all multi-domain proteins, which contain the SCOP domains that are a potential source of incorrect links. Our method compares at high specificities very favorably with PSI-Blast, which is probably the most widely-used tool for finding remote homologues. We demonstrate that using transitivity with as many as twelve intermediate sequences is crucial to achieving this level of performance. Moreover, from analysis of false positives we conclude that our method seems to correctly bound the degree of transitivity used. This analysis also yields explicit guidance in choosing parameters. The heuristics of the asymmetric distance measure used neither solve the multi-domain problem from a theoretical point of view, nor do they avoid all types of problems we have observed in real data. Nevertheless, they do provide a substantial improvement over existing approaches. AVAILABILITY: The complete software source is freely available to all users under the GNU General Public License (GPL) from http://www.bioinformatik.uni-koeln.de/~proclust/download/

Algorithms↗
PubMed1989

An extension of the graph theoretical approach to predict the secondary structure of large RNAs: the complex of 16S and 23S rRNAs from E. coli as a case study.

An algorithm using the graph theoretical approach to predict secondary structures of large nucleic acids is discussed. Reliability of prediction can be improved by incorporating available experimental data and sequence homology information. As a case study, this algorithm is applied to predict the secondary structure of the 16S-23S rRNA complex from E. coli. It was found that several structures of the complex can coexist. The computer program developed to predict the secondary structure of large RNAs can be run on IBM PC/AT compatible systems.

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