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 613 records · Page 34Linked to original sources

IGCN: integrative graph convolution networks for patient level insights and biomarker discovery in multi-omics integration.

MOTIVATION: Developing computational tools for integrative analysis across multiple types of omics data has been of immense importance in cancer molecular biology and precision medicine research. While recent advancements have yielded integrative prediction solutions for multi-omics data, these methods lack a comprehensive and cohesive understanding of the rationale behind their specific predictions. To shed light on personalized medicine and unravel previously unknown characteristics within integrative analysis of multi-omics data, we introduce a novel integrative neural network approach for cancer molecular subtype and biomedical classification applications, named Integrative Graph Convolutional Networks (IGCN). RESULTS: To demonstrate the superiority of IGCN, we compare its performance with other state-of-the-art approaches across different cancer subtype and biomedical classification tasks. Our experimental results show that our proposed model outperforms the state-of-the-art and baseline methods. IGCN identifies which types of omics data receive more emphasis for each patient when predicting a specific class. Additionally, IGCN has the capability to pinpoint significant biomarkers from a range of omics data types. AVAILABILITY AND IMPLEMENTATION: The source code is available at https://github.com/bozdaglab/IGCN.

Humans↗

Tsbrowse: an interactive browser for ancestral recombination graphs.

SUMMARY: Ancestral recombination graphs (ARGs) represent the interwoven paths of genetic ancestry of a set of recombining sequences. The ability to capture the evolutionary history of samples makes ARGs valuable in a wide range of applications in population and statistical genetics. ARG-based approaches are increasingly becoming a part of genetic data analysis pipelines due to breakthroughs enabling ARG inference at biobank-scale. However, there is a lack of visualization tools, which are crucial for validating inferences and generating hypotheses. We present tsbrowse, an open-source, web-based Python application for the interactive visualization of the fundamental building blocks of ARGs, i.e. nodes, edges and mutations. We demonstrate the application of tsbrowse to various data sources and scenarios, and highlight its key features of browsability along the genome, user interactivity, and scalability to very large sample sizes. AVAILABILITY AND IMPLEMENTATION: Tsbrowse is installed as a Python package from PyPI (https://pypi.org/project/tsbrowse/), while a development version is maintained at https://github.com/tskit-dev/tsbrowse. Documentation is available at https://tskit.dev/tsbrowse/docs/. Source code is archived on Zenodo with DOI, https://doi.org/10.5281/zenodo.15683039.

Software↗

GBSC: graph-based sequence clustering method for similar short tandem repeats in protein sequences.

MOTIVATION: Short tandem repeats (STRs) are abundant in protein sequences and play important role in determining their structures and functions. Strikingly, the unusual compositional characteristics of tandem repeats break classical sequence analysis tools. RESULTS: Here, we establish the first algorithm to effectively identify and cluster STRs: Graph-Based Sequence Clustering (GBSC) features linear time complexity, and clusters protein sequence fragments based on their STRs, while allowing for insertions and mutations and supporting the analysis of imperfect or cryptic repeats. Due to its computational efficacy, our algorithm can be used to systematically scan for patterns in large datasets. We compare our method both to state-of-the-art methods for identifying STRs in proteins and alternative clustering approaches. Unlike existing STR analysis methods, GBSC clusters repeat patterns rather than raw sequences, operating at the level of structural repeat identity, while tolerating biological variations and preventing erroneous merging of structurally and functionally distinct motifs. Whereas functional annotation is typically only available at the protein level, the functions of individual STRs and sequences of adjacent STRs remain largely unknown. On a challenging use case we here demonstrate and discuss how our method can be used to associate previously unannotated repetitive protein fragments with similar ones, allowing the transfer of annotation by similarity. For the first time, GBSC offers a tool that systematically extends this fundamental bioinformatics principle to low-complexity regions across large datasets. AVAILABILITY AND IMPLEMENTATION: GBSC is available at GitHub https://github.com/patryk-jarnot/GBSC and https://doi.org/10.5281/zenodo.18965247. The data and scripts to reproduce the analysis are available at https://doi.org/10.5281/zenodo.16906653.

Microsatellite Repeats↗

ARGformer: learning on ancestral recombination graphs with transformers.

MOTIVATION: Recent advances in inference of the ancestral recombination graph (ARG), which describes how segments of chromosomes trace back through recombination and shared lineages, have made it possible to reconstruct genome-wide genealogies for large cohorts, but it remains difficult to summarize and use this information for population genetic analyses. RESULTS: We present ARGformer, an encoder-only transformer that learns context-dependent embeddings with a self-supervised masked objective finetuned with contrastive learning for downstream retrieval tasks. We train ARGformer on genealogies from coalescent simulations and on genealogies inferred from ancient and present-day Homo sapiens genomes. Using only these learned embeddings, without access to genotype matrices, ARGformer captures patterns of global population structure and supports ancestry inference through clustering and nearest-neighbor retrieval. On genealogies that include archaic hominins, ARGformer can highlight Denisovan-derived segments in Oceanian genomes and reveals Oceanian-like ancestry in South American Indigenous populations. AVAILABILITY AND IMPLEMENTATION: ARGformer is available at https://github.com/AI-sandbox/ARGformer.

Humans↗

Interactive exploration of biobank-scale ancestral recombination graphs with Lorax.

MOTIVATION: Ancestral Recombination Graphs (ARGs) provide a comprehensive representation of genetic ancestry and underpin analyses of natural selection, disease association, and population history. However, existing visualization tools are limited in scalability and interactivity, making ARGs difficult to explore at biobank scale. RESULTS: We introduce Lorax, a GPU-accelerated, web-native platform for real-time visualization of population-scale ARGs. Lorax integrates genomic position, coalescent time, local genealogy, and metadata, enabling interactive exploration of ancestry and variant inheritance in biobank-scale datasets. AVAILABILITY AND IMPLEMENTATION: Lorax is freely available as a live demo at https://lorax.ucsc.edu/ and as a Python package "lorax-arg" on PyPI. The source code and documentation are available on GitHub at https://github.com/pratikkatte/lorax.

Software↗

Generating consensus sequences from partial order multiple sequence alignment graphs.

MOTIVATION: Consensus sequence generation is important in many kinds of sequence analysis ranging from sequence assembly to profile-based iterative search methods. However, how can a consensus be constructed when its inherent assumption-that the aligned sequences form a single linear consensus-is not true? RESULTS: Partial Order Alignment (POA) enables construction and analysis of multiple sequence alignments as directed acyclic graphs containing complex branching structure. Here we present a dynamic programming algorithm (heaviest_bundle) for generating multiple consensus sequences from such complex alignments. The number and relationships of these consensus sequences reveals the degree of structural complexity of the source alignment. This is a powerful and general approach for analyzing and visualizing complex alignment structures, and can be applied to any alignment. We illustrate its value for analyzing expressed sequence alignments to detect alternative splicing, reconstruct full length mRNA isoform sequences from EST fragments, and separate paralog mixtures that can cause incorrect SNP predictions. AVAILABILITY: The heaviest_bundle source code is available at http://www.bioinformatics.ucla.edu/poa

Algorithms↗

Accelerating screening of 3D protein data with a graph theoretical approach.

MOTIVATION: The Dictionary of Interfaces in Proteins (DIP) is a database collecting the 3D structure of interacting parts of proteins that are called patches. It serves as a repository, in which patches similar to given query patches can be found. The computation of the similarity of two patches is time consuming and traversing the entire DIP requires some hours. In this work we address the question of how the patches similar to a given query can be identified by scanning only a small part of DIP. The answer to this question requires the investigation of the distribution of the similarity of patches. RESULTS: The score values describing the similarity of two patches can roughly be divided into three ranges that correspond to different levels of spatial similarity. Interestingly, the two iso-score lines separating the three classes can be determined by two different approaches. Applying a concept of the theory of random graphs reveals significant structural properties of the data in DIP. These can be used to accelerate scanning the DIP for patches similar to a given query. Searches for very similar patches could be accelerated by a factor of more than 25. Patches with a medium similarity could be found 10 times faster than by brute-force search.

Algorithms↗

A graph-theoretic modeling on GO space for biological interpretation of gene clusters.

MOTIVATION: With the advent of DNA microarray technologies, the parallel quantification of genome-wide transcriptions has been a great opportunity to systematically understand the complicated biological phenomena. Amidst the enthusiastic investigations into the intricate gene expression data, clustering methods have been the useful tools to uncover the meaningful patterns hidden in those data. The mathematical techniques, however, entirely based on the numerical expression data, do not show biologically relevant information on the clustering results. RESULTS: We present a novel methodology for biological interpretation of gene clusters. Our graph theoretic algorithm extracts common biological attributes of the genes within a cluster or a group of interest through the modified structure of gene ontology (GO) called GO tree. After genes are annotated with GO terms, the hierarchical nature of GO terms is used to find the representative biological meanings of the gene clusters. In addition, the biological significance of gene clusters can be assessed quantitatively by defining a distance function on the GO tree. Our approach has a complementary meaning to many statistical clustering techniques; we can see clustering problems from a different viewpoint by use of biological ontology. We applied this algorithm to the well-known data set and successfully obtained the biological features of the gene clusters with the quantitative biological assessment of clustering quality through GO Biological Process.

Algorithms↗

A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences.

MOTIVATION: RNA structure motifs contained in mRNAs have been found to play important roles in regulating gene expression. However, identification of novel RNA regulatory motifs using computational methods has not been widely explored. Effective tools for predicting novel RNA regulatory motifs based on genomic sequences are needed. RESULTS: We present a new method for predicting common RNA secondary structure motifs in a set of functionally or evolutionarily related RNA sequences. This method is based on comparison of stems (palindromic helices) between sequences and is implemented by applying graph-theoretical approaches. It first finds all possible stable stems in each sequence and compares stems pairwise between sequences by some defined features to find stems conserved across any two sequences. Then by applying a maximum clique finding algorithm, it finds all significant stems conserved across at least k sequences. Finally, it assembles in topological order all possible compatible conserved stems shared by at least k sequences and reports a number of the best assembled stem sets as the best candidate common structure motifs. This method does not require prior structural alignment of the sequences and is able to detect pseudoknot structures. We have tested this approach on some RNA sequences with known secondary structures, in which it is capable of detecting the real structures completely or partially correctly and outperforms other existing programs for similar purposes. AVAILABILITY: The algorithm has been implemented in C++ in a program called comRNA, which is available at http://ural.wustl.edu/softwares.html

Algorithms↗

Three-stage prediction of protein beta-sheets by neural networks, alignments and graph algorithms.

MOTIVATION: Protein beta-sheets play a fundamental role in protein structure, function, evolution and bioengineering. Accurate prediction and assembly of protein beta-sheets, however, remains challenging because protein beta-sheets require formation of hydrogen bonds between linearly distant residues. Previous approaches for predicting beta-sheet topological features, such as beta-strand alignments, in general have not exploited the global covariation and constraints characteristic of beta-sheet architectures. RESULTS: We propose a modular approach to the problem of predicting/assembling protein beta-sheets in a chain by integrating both local and global constraints in three steps. The first step uses recursive neural networks to predict pairing probabilities for all pairs of interstrand beta-residues from profile, secondary structure and solvent accessibility information. The second step applies dynamic programming techniques to these probabilities to derive binding pseudoenergies and optimal alignments between all pairs of beta-strands. Finally, the third step uses graph matching algorithms to predict the beta-sheet architecture of the protein by optimizing the global pseudoenergy while enforcing strong global beta-strand pairing constraints. The approach is evaluated using cross-validation methods on a large non-homologous dataset and yields significant improvements over previous methods. AVAILABILITY: http://www.igb.uci.edu/servers/psss.html.

Algorithms↗

A parallel graph decomposition algorithm for DNA sequencing with nanopores.

MOTIVATION: With the potential availability of nanopore devices that can sense the bases of translocating single-stranded DNA (ssDNA), it is likely that 'reads' of length approximately 10(5) will be available in large numbers and at high speed. We address the problem of complete DNA sequencing using such reads. We assume that approximately 10(2) copies of a DNA sequence are split into single strands that break into randomly sized pieces as they translocate the nanopore in arbitrary orientations. The nanopore senses and reports each individual base that passes through, but all information about orientation and complementarity of the ssDNA subsequences is lost. Random errors (both biological and transduction) in the reads create further complications. RESULTS: We have developed an algorithm that addresses these issues. It can be considered an extreme variation of the well-known Eulerian path approach. It searches over a space of de Bruijn graphs until it finds one in which (a) the impact of errors is eliminated and (b) both possible orientations of the two ssDNA sequences can be identified separately and unambiguously. Our algorithm is able to correctly reconstruct real DNA sequences of the order of 10(6) bases (e.g. the bacterium Mycoplasma pneumoniae) from simulated erroneous reads on a modest workstation in about 1 h. We describe, and give measured timings of, a parallel implementation of this algorithm on the Cray Multithreaded Architecture (MTA-2) supercomputer, whose architecture is ideally suited to this 'unstructured' problem. Our parallel implementation is crucial to the problem of rapidly sequencing long DNA sequences and also to the situation where multiple nanopores are used to obtain a high-bandwidth stream of reads.

Algorithms↗

Multiple flexible structure alignment using partial order graphs.

MOTIVATION: Existing comparisons of protein structures are not able to describe structural divergence and flexibility in the structures being compared because they focus on identifying a common invariant core and ignore parts of the structures outside this core. Understanding the structural divergence and flexibility is critical for studying the evolution of functions and specificities of proteins. RESULTS: A new method of multiple protein structure alignment, POSA (Partial Order Structure Alignment), was developed using a partial order graph representation of multiple alignments. POSA has two unique features: (1) identifies and classifies regions that are conserved only in a subset of input structures and (2) allows internal rearrangements in protein structures. POSA outperforms other programs in the cases where structural flexibilities exist and provides new insights by visualizing the mosaic nature of multiple structural alignments. POSA is an ideal tool for studying the variation of protein structures within diverse structural families. AVAILABILITY: POSA is freely available for academic users on a Web server at http://fatcat.burnham.org/POSA

Algorithms↗

LogoBar: bar graph visualization of protein logos with gaps.

SUMMARY: LogoBar is a Java application to display protein sequence logos. In our software gaps are accounted for when calculating the information content present at each residue position in a multiple alignment. The resulting logo is displayed as a graph consisting of bars, although traditional letter representation is also possible. Amino acids are displayed from the bottom up with decreasing frequencies i.e. the most abundant residue is placed at the bottom of the logo. The bars can be color-coded according to user specifications. Gaps in the alignment are also displayed, either on top or at the bottom of the logo. Furthermore, residues can either be arranged according to their relative abundance or grouped according to user criteria to emphasize the conserved nature of particular positions. AVAILABILITY: LogoBar and further documentation is available at http://www.biosci.ki.se/groups/tbu/logobar/

Algorithms↗

Estimation of the parameters of a binary Markov random field on a graph with application to fibre type distributions in a muscle cross-section.

Methods are discussed for the estimation of the parameters of a binary Markov random field (BMRF) defined on a graph. The standard method is maximum pseudo-likelihood (MPL) estimation. Maximum likelihood (ML) estimation has been hampered in the past by the intractability of the likelihood function. Recently Markov chain Monte Carlo (MCMC) methods have been introduced for ML estimation. In this paper a new method for Monte Carlo maximum likelihood is described. It is used for the estimation of the parameters of a simple model (the Ising model of statistical physics). As an application the distribution of fibre types in a cross-section of human muscle is analysed.

Animals↗

A class of perfect graphs in genetics.

A straightforward graphical representation of a genealogy is regularized by chording cycles using only male-female links. The resulting graph is shown to be perfect.

Female↗

Display and analysis of patterns of differential activity of drugs against human tumor cell lines: development of mean graph and COMPARE algorithm.

The objective of this study was to develop and investigate an approach to optimally detect, rank, display, and analyze patterns of differential growth inhibition among cultured cell lines. Such patterns of cellular responsiveness are produced by substances tested in vitro against disease-oriented panels of human tumor cell lines in a new anticancer screening model under development by the National Cancer Institute. In the first phase of the study, we developed a key methodological tool, the mean graph, which allowed the transformation of the numerical cell line response data into graphic patterns. These patterns were particularly expressive of differential cell growth inhibition and were conveniently amenable to further analyses by an algorithm we devised and implemented in the COMPARE computer program.

Antineoplastic Agents↗

Efficient RNA interference depends on global context of the target sequence: quantitative analysis of silencing efficiency using Eulerian graph representation of siRNA.

Several aspects of gene silencing by small interfering RNA duplexes (siRNA) influence the efficiency of the silencing. They can be divided into two categories, one covering the cell-specific factors and the other covering molecular factors of the RNA interference (RNAi). A prerequisite for sequence-based siRNA design is that hybridization thermodynamics is the dominant factor. Our assumption is that cell-specific parameters (cell line, degradation, cross-hybridization, target conformation, etc.) can be pooled into an average cellular factor. Our hypothesis is that the molecular basis of the positional dependence of siRNA-induced gene silencing is the uniqueness of context of a corresponding target sequence segment relative to all other such segments along the attacked RNA. We encode this context into descriptors derived from Eulerian graph representation of siRNAs and show that the descriptor based upon the contextual similarity and predicted thermodynamic stability correlates with the experimentally observed silencing efficiency of human lamin A/C gene. We further show that information encoded in this regression function is generalizable and can be used as a predictor of siRNA efficiency in unrelated genes (CD54 and PTEN). In summary, our method represents an evolution of siRNA design from the currently used algorithms which are only qualitative in nature.

Base Sequence↗