NetGrep: fast network schema searches in interactomes.
Ontology highlight
ABSTRACT:
SUBMITTER: Banks E
PROVIDER: S-EPMC2592716 | biostudies-literature | 2008
REPOSITORIES: biostudies-literature
Publications
NetGrep: fast network schema searches in interactomes.
Banks Eric E Nabieva Elena E Peterson Ryan R Singh Mona M
Genome biology 20080918 9
NetGrep (http://genomics.princeton.edu/singhlab/netgrep/) is a system for searching protein interaction networks for matches to user-supplied 'network schemas'. Each schema consists of descriptions of proteins (for example, their molecular functions or putative domains) along with the desired topology and types of interactions among them. Schemas can thus describe domain-domain interactions, signaling and regulatory pathways, or more complex network patterns. NetGrep provides an advanced graphic ...[more]
Similar Datasets
Project description:A fundamental question in psychotherapy is whether interventions should target client problems (i.e., problem-focused approaches) or client strengths (i.e., strength-focused approaches). In this study, we first propose to address this question from a network perspective on schema modes (i.e., healthy or dysfunctional patterns of co-occurring emotions, cognitions, and behaviours). From this perspective, schema modes mutually influence each other (e.g., healthy modes reduce dysfunctional modes). Recent evidence suggests that changes in modes that are strongly associated to other modes (i.e., central modes) could be associated with greater treatment effects. We therefore suggest research should investigate the relative centrality of healthy and dysfunctional modes. To make an exploratory start, we investigated the cross-sectional network structure of schema modes in a clinical (comprising individuals diagnosed with paranoid, narcissistic, histrionic, and Cluster C personality disorders) and non-clinical sample. Results showed that, in both samples, the Healthy Adult was significantly less central than several dysfunctional modes (e.g., Undisciplined Child and Abandoned and Abused Child). Although our study cannot draw causal conclusions, this finding could suggest that weakening dysfunctional modes (compared to strengthening the Healthy Adult) might be more effective in decreasing other dysfunctional modes. Our study further indicates that several schema modes are negatively associated, which could suggest that decreasing one might increase another. Finally, the Healthy Adult was among the modes that most strongly discriminated between clinical and non-clinical individuals. Longitudinal and experimental research into the network structure of schema modes is required to further clarify the relative influence of schema modes.
| S-EPMC8596577 | biostudies-literature
Project description:We present and validate BlastR, a method for efficiently and accurately searching non-coding RNAs. Our approach relies on the comparison of di-nucleotides using BlosumR, a new log-odd substitution matrix. In order to use BlosumR for comparison, we recoded RNA sequences into protein-like sequences. We then showed that BlosumR can be used along with the BlastP algorithm in order to search non-coding RNA sequences. Using Rfam as a gold standard, we benchmarked this approach and show BlastR to be more sensitive than BlastN. We also show that BlastR is both faster and more sensitive than BlastP used with a single nucleotide log-odd substitution matrix. BlastR, when used in combination with WU-BlastP, is about 5% more accurate than WU-BlastN and about 50 times slower. The approach shown here is equally effective when combined with the NCBI-Blast package. The software is an open source freeware available from www.tcoffee.org/blastr.html.
| S-EPMC3167602 | biostudies-literature
Project description:The need for larger-scale and increasingly complex protein-protein interaction (PPI) prediction tasks demands that state-of-the-art predictors be highly efficient and adapted to inter- and cross-species predictions. Furthermore, the ability to generate comprehensive interactomes has enabled the appraisal of each PPI in the context of all predictions leading to further improvements in classification performance in the face of extreme class imbalance using the Reciprocal Perspective (RP) framework. We here describe the PIPE4 algorithm. Adaptation of the PIPE3/MP-PIPE sequence preprocessing step led to upwards of 50x speedup and the new Similarity Weighted Score appropriately normalizes for window frequency when applied to any inter- and cross-species prediction schemas. Comprehensive interactomes for three prediction schemas are generated: (1) cross-species predictions, where Arabidopsis thaliana is used as a proxy to predict the comprehensive Glycine max interactome, (2) inter-species predictions between Homo sapiens-HIV1, and (3) a combined schema involving both cross- and inter-species predictions, where both Arabidopsis thaliana and Caenorhabditis elegans are used as proxy species to predict the interactome between Glycine max (the soybean legume) and Heterodera glycines (the soybean cyst nematode). Comparing PIPE4 with the state-of-the-art resulted in improved performance, indicative that it should be the method of choice for complex PPI prediction schemas.
| S-EPMC6989690 | biostudies-literature
Project description:The identification of structurally similar proteins can provide a range of biological insights, and accordingly, the alignment of a query protein to a database of experimentally determined protein structures is a technique commonly used in the fields of structural and evolutionary biology. The PhyreStorm Web server has been designed to provide comprehensive, up-to-date and rapid structural comparisons against the Protein Data Bank (PDB) combined with a rich and intuitive user interface. It is intended that this facility will enable biologists inexpert in bioinformatics access to a powerful tool for exploring protein structure relationships beyond what can be achieved by sequence analysis alone. By partitioning the PDB into similar structures, PhyreStorm is able to quickly discard the majority of structures that cannot possibly align well to a query protein, reducing the number of alignments required by an order of magnitude. PhyreStorm is capable of finding 93±2% of all highly similar (TM-score>0.7) structures in the PDB for each query structure, usually in less than 60s. PhyreStorm is available at http://www.sbg.bio.ic.ac.uk/phyrestorm/.
| S-EPMC7610957 | biostudies-literature
Project description:Single-cell technologies have made it possible to profile millions of cells, but for these resources to be useful they must be easy to query and access. To facilitate interactive and intuitive access to single-cell data we have developed scfind, a single-cell analysis tool that facilitates fast search of biologically or clinically relevant marker genes in cell atlases. Using transcriptome data from six mouse cell atlases, we show how scfind can be used to evaluate marker genes, perform in silico gating, and identify both cell-type-specific and housekeeping genes. Moreover, we have developed a subquery optimization routine to ensure that long and complex queries return meaningful results. To make scfind more user friendly, we use indices of PubMed abstracts and techniques from natural language processing to allow for arbitrary queries. Finally, we show how scfind can be used for multi-omics analyses by combining single-cell ATAC-seq data with transcriptome data.
| S-EPMC7116898 | biostudies-literature
Project description:Large-scale protein-protein interaction networks provide new opportunities for understanding cellular organization and functioning. We introduce network schemas to elucidate shared mechanisms within interactomes. Network schemas specify descriptions of proteins and the topology of interactions among them. We develop algorithms for systematically uncovering recurring, over-represented schemas in physical interaction networks. We apply our methods to the S. cerevisiae interactome, focusing on schemas consisting of proteins described via sequence motifs and molecular function annotations and interacting with one another in one of four basic network topologies. We identify hundreds of recurring and over-represented network schemas of various complexity, and demonstrate via graph-theoretic representations how more complex schemas are organized in terms of their lower-order constituents. The uncovered schemas span a wide range of cellular activities, with many signaling and transport related higher-order schemas. We establish the functional importance of the schemas by showing that they correspond to functionally cohesive sets of proteins, are enriched in the frequency with which they have instances in the H. sapiens interactome, and are useful for predicting protein function. Our findings suggest that network schemas are a powerful paradigm for organizing, interrogating, and annotating cellular networks.
| S-EPMC2561054 | biostudies-literature
Project description:BACKGROUND:For many predictive applications a large number of models is generated and later clustered in subsets based on structure similarity. In most clustering algorithms an all-vs-all root mean square deviation (RMSD) comparison is performed. Most of the time is typically spent on comparison of non-similar structures. For sets with more than, say, 10,000 models this procedure is very time-consuming and alternative faster algorithms, restricting comparisons only to most similar structures would be useful. RESULTS:We exploit the inverse triangle inequality on the RMSD between two structures given the RMSDs with a third structure. The lower bound on RMSD may be used, when restricting the search of similarity to a reasonably low RMSD threshold value, to speed up similarity searches significantly. Tests are performed on large sets of decoys which are widely used as test cases for predictive methods, with a speed-up of up to 100 times with respect to all-vs-all comparison depending on the set and parameters used. Sample applications are shown. CONCLUSIONS:The algorithm presented here allows fast comparison of large data sets of structures with limited memory requirements. As an example of application we present clustering of more than 100000 fragments of length 5 from the top500H dataset into few hundred representative fragments. A more realistic scenario is provided by the search of similarity within the very large decoy sets used for the tests. Other applications regard filtering nearly-indentical conformation in selected CASP9 datasets and clustering molecular dynamics snapshots. AVAILABILITY:A linux executable and a Perl script with examples are given in the supplementary material (Additional file 1). The source code is available upon request from the authors.
| S-EPMC3403935 | biostudies-literature
Project description:SummaryThe MMseqs2 desktop and web server app facilitates interactive sequence searches through custom protein sequence and profile databases on personal workstations. By eliminating MMseqs2's runtime overhead, we reduced response times to a few seconds at sensitivities close to BLAST.Availability and implementationThe app is easy to install for non-experts. GPLv3-licensed code, pre-built desktop app packages for Windows, MacOS and Linux, Docker images for the web server application and a demo web server are available at https://search.mmseqs.com.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6691333 | biostudies-literature
Project description:In all organisms, major biological processes are controlled by complex protein-protein interactions networks (interactomes), yet their structural complexity presents major analytical challenges. Here, we integrate a compendium of over 4300 phenotypes with Arabidopsis interactome (AI-1MAIN). We show that nodes with high connectivity and betweenness are enriched and depleted in conditional and essential phenotypes, respectively. Such nodes are located in the innermost layers of AI-1MAIN and are preferential targets of pathogen effectors. We extend these network-centric analyses to Cell Surface Interactome (CSILRR) and predict its 35 most influential nodes. To determine their biological relevance, we show that these proteins physically interact with pathogen effectors and modulate plant immunity. Overall, our findings contrast with centrality-lethality rule, discover fast information spreading nodes, and highlight the structural properties of pathogen targets in two different interactomes. Finally, this theoretical framework could possibly be applicable to other inter-species interactomes to reveal pathogen contact points.
| S-EPMC5998135 | biostudies-literature
Project description:BackgroundSchema, a concept from cognitive psychology used to explain how new information is integrated with previous experience, is a framework of acquired knowledge within associative network structures as biological correlate, which allows new relevant information to be quickly assimilated by parallel cortical encoding in the hippocampus (HPC) and cortex. Previous work demonstrated that myelin generation in the anterior cingulate cortex (ACC) plays a critical role for dynamic paired association (PA) learning and consolidation, while astrocytes in ACC play a vital role in cognitive decision-making. However, circuit components and mechanism involving HPC-anterior cingulate cortex (ACC) during schema formation remain uncertain. Moreover, the correlation between HPC-ACC circuit and HPC astrocytic activity is unclear.ResultsUtilizing a paired association (PA) behavioral paradigm, we dynamically recorded calcium signals of CA1-ACC projection neurons and ACC neurons during schema formation. Depending on the characteristics of the calcium signals, three distinct stages of schema establishment process were identified. The recruitment of CA1-ACC network was investigated in each stage under CA1 astrocytes Gi pathway chemogenetic activation. Results showed that CA1-ACC projecting neurons excitation gradually decreased along with schema development, while ACC neurons revealed an excitation peak in the middle stage. CA1 astrocytic Gi pathway activation will disrupt memory schema development by reducing CA1-ACC projection neuron recruitment in the initial stage and prevent both CA1-ACC projection neurons and ACC neuron excitation in the middle stage. CA1 astrocytes Gi markedly suppress new PA assimilation into the established memory schema.ConclusionsThese results not only reveal the dynamic feature of CA1-ACC network during schema establishment, but also suggest CA1 astrocyte contribution in different stages of schema establishment.
| S-EPMC9648012 | biostudies-literature