Searching the RRID Resource Information Network

Our searching services are busy right now. Please try again later

  • Register
X
Forgot Password

If you have forgotten your password you can enter your email here and get a temporary password sent to your email.

X

Leaving Community

Are you sure you want to leave this community? Leaving the community will revoke any permissions you have been granted in this community.

No
Yes

SciCrunch Registry is a curated repository of scientific resources, with a focus on biomedical resources, including tools, databases, and core facilities - visit SciCrunch to register your resource.

Search

Type in a keyword to search

On page 39 showing 761 ~ 780 out of 856 results
Snippet view Table view Download 856 Result(s)
Click the to add this resource to a Collection
  • RRID:SCR_005183

    This resource has 100+ mentions.

http://www.broadinstitute.org/cancer/cga/oncotator

A tool for annotating human genomic point mutations and indels with data relevant to cancer researchers. Genomic Annotations, Protein Annotations, and Cancer Annotations are aggregated from many resources. A standalone version of Oncotator is being developed.

Proper citation: Oncotator (RRID:SCR_005183) Copy   


  • RRID:SCR_006185

http://bioinformatics.biol.uoa.gr/AMYLPRED/

A web tool using the consensus prediction method for identifying possible amyloidogenic regions in protein sequences. This tool uses an assortment of different methods that have been found or specifically developed to predict features related to the formation of amyloid fibrils. The consensus of these methods is defined as the the hit overlap of at least two out of five methods and it is the primary output of the program. However, the individual predictions of these methods are also made available in the form of a text file, maintained on the server for 1 (one) day. Consequently, the tool predicts probable amyloidogenic determinants for a given amino acid sequence of a peptide or protein.

Proper citation: AMYL-PRED (RRID:SCR_006185) Copy   


  • RRID:SCR_006186

    This resource has 1+ mentions.

http://bioinformatics.biol.uoa.gr/HMM-TM/

A web tool using the Hidden Markov Model method for the topology prediction of alpha-helical membrane proteins that incorporates experimentally derived topological information. Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such as transmembrane protein topology prediction, the incorporation of limited amount of information regarding the topology, arising from biochemical experiments, has been proved a very useful strategy that increased remarkably the performance of even the top-scoring methods. However, no clear and formal explanation of the algorithms that retains the probabilistic interpretation of the models has been presented so far in the literature. We present here, a simple method that allows incorporation of prior topological information concerning the sequences at hand, while at the same time the HMMs retain their full probabilistic interpretation in terms of conditional probabilities. We present modifications to the standard Forward and Backward algorithms of HMMs and we also show explicitly, how reliable predictions may arise by these modifications, using all the algorithms currently available for decoding HMMs. A similar procedure may be used in the training procedure, aiming at optimizing the labels of the HMM''s classes, especially in cases such as transmembrane proteins where the labels of the membrane-spanning segments are inherently misplaced. We present an application of this approach developing a method to predict the transmembrane regions of alpha-helical membrane proteins, trained on crystallographically solved data. We show that this method compares well against already established algorithms presented in the literature, and it is extremely useful in practical applications.

Proper citation: HMM-TM (RRID:SCR_006186) Copy   


  • RRID:SCR_006187

    This resource has 10+ mentions.

http://bioinformatics.biol.uoa.gr/PRED-LIPO/

A web tool using the Hidden Markov Model method for the prediction of lipoprotein signal peptides of Gram-positive bacteria, trained on a set of 67 experimentally verified lipoproteins. The method outperforms LipoP and the methods based on regular expression patterns, in various data sets containing experimentally characterized lipoproteins, secretory proteins, proteins with an N-terminal TM segment and cytoplasmic proteins. The method is also very sensitive and specific in the detection of secretory signal peptides and in terms of overall accuracy outperforms even SignalP, which is the top-scoring method for the prediction of signal peptides.

Proper citation: PRED-LIPO (RRID:SCR_006187) Copy   


  • RRID:SCR_006181

    This resource has 10+ mentions.

http://bioinformatics.biol.uoa.gr/PRED-SIGNAL/

A web tool for prediction of signal peptides in archaea. Computational prediction of signal peptides (SPs) and their cleavage sites is of great importance in computational biology; however, currently there is no available method capable of predicting reliably the SPs of archaea, due to the limited amount of experimentally verified proteins with SPs. We performed an extensive literature search in order to identify archaeal proteins having experimentally verified SP and managed to find 69 such proteins, the largest number ever reported. A detailed analysis of these sequences revealed some unique features of the SPs of archaea, such as the unique amino acid composition of the hydrophobic region with a higher than expected occurrence of isoleucine, and a cleavage site resembling more the sequences of gram-positives with almost equal amounts of alanine and valine at the position-3 before the cleavage site and a dominant alanine at position-1, followed in abundance by serine and glycine. Using these proteins as a training set, we trained a hidden Markov model method that predicts the presence of the SPs and their cleavage sites and also discriminates such proteins from cytoplasmic and transmembrane ones.

Proper citation: PRED-SIGNAL (RRID:SCR_006181) Copy   


  • RRID:SCR_006216

http://athina.biol.uoa.gr/PRED-CLASS/

A system of cascading neural networks that classifies any protein, given its amino acid sequence alone, into one of four possible classes: membrane, globular, fibrous, mixed.

Proper citation: PRED-CLASS (RRID:SCR_006216) Copy   


  • RRID:SCR_006217

http://athina.biol.uoa.gr/CoPreTHi/

A Java based web application, which combines the results of methods that predict the location of transmembrane segments in protein sequences into a joint prediction histogram. Clearly, the joint prediction algorithm, produces superior quality results than individual prediction schemes.

Proper citation: CoPreTHi (RRID:SCR_006217) Copy   


  • RRID:SCR_005788

    This resource has 50+ mentions.

http://snps-and-go.biocomp.unibo.it/snps-and-go/

A server for the prediction of single point protein mutations likely to be involved in the insurgence of diseases in humans.

Proper citation: SNPsandGO (RRID:SCR_005788) Copy   


  • RRID:SCR_006194

    This resource has 1+ mentions.

http://bioinformatics.biol.uoa.gr/ConBBPRED/

A web tool for the Consensus Prediction of TransMembrane Beta-Barrel Proteins. Prediction of the transmembrane strands and topology of beta-barrel outer membrane proteins is of interest in current bioinformatics research. Several methods have been applied so far for this task, utilizing different algorithmic techniques and a number of freely available predictors exist. The methods can be grossly divided to those based on Hidden Markov Models (HMMs), on Neural Networks (NNs) and on Support Vector Machines (SVMs). In this work, we compare the different available methods for topology prediction of beta-barrel outer membrane proteins. We evaluate their performance on a non-redundant dataset of 20 beta-barrel outer membrane proteins of gram-negative bacteria, with structures known at atomic resolution. Also, we describe, for the first time, an effective way to combine the individual predictors, at will, to a single consensus prediction method. We assess the statistical significance of the performance of each prediction scheme and conclude that Hidden Markov Model based methods, HMM-B2TMR, ProfTMB and PRED-TMBB, are currently the best predictors, according to either the per-residue accuracy, the segments overlap measure (SOV) or the total number of proteins with correctly predicted topologies in the test set. Furthermore, we show that the available predictors perform better when only transmembrane beta-barrel domains are used for prediction, rather than the precursor full-length sequences, even though the HMM-based predictors are not influenced significantly. The consensus prediction method performs significantly better than each individual available predictor, since it increases the accuracy up to 4% regarding SOV and up to 15% in correctly predicted topologies.

Proper citation: ConBBPRED (RRID:SCR_006194) Copy   


http://web.cbio.uct.ac.za/ITGOM/

The Integrated Tool for IC-based GO Semantic Similarity Measures (IT-GOM) integrates the currently known GO semantic similarity measures into a single tool. It provides the information content (IC) of GO terms, semantic similarity between GO terms and GO-based protein functional similarity scores. The specificity of GO terms and the similarity of biological content between GO terms or proteins are transformed into numeric values for protein analyses at the functional level. The integration of the different measures enables users to choose the measure best suited to their application and to compare results between different semantic similarity measures. Platform: Online tool

Proper citation: IT-GOM: Integrated Tool for IC-based GO Semantic Similarity Measures (RRID:SCR_005815) Copy   


  • RRID:SCR_005322

    This resource has 100+ mentions.

http://www.mooneygroup.org/stop/input

STOP is a multi-ontology enrichment analysis tool. It is intended to be used to help from hypothesis about large sets of genes or proteins. The annoations used for enrichment analysis are obtained automatically applying text descriptions of genes and proteins to the NCBO annotator. Text for genes is found using NCBI entrez gene, and text for proteins is found using UniProt. The text is then run though NCBO annotator with all the available ontologies. For more information about the NCBO annotator please visit: http://bioportal.bioontology.org/ The goal of National Center for Biomedical Ontology (NCBO) is to support biomedical researchers in their knowledge-intensive work, by providing online tools and a Web portal enabling them to access, review, and integrate disparate ontological resources in all aspects of biomedical investigation and clinical practice. A major focus of our work involves the use of biomedical ontologies to aid in the management and analysis of data derived from complex experiments. This work is an expansion of the work of Rob Tirrell and others on RANSUM This probject would not be possible without the contributions of Emily Howe, Uday Evani, Corey Powell, Mathew Fleisch, Tobias Wittkop, Ari Berman, Nigam Shah and Sean Mooney An account is required.

Proper citation: STOP (RRID:SCR_005322) Copy   


  • RRID:SCR_005633

    This resource has 10+ mentions.

http://agbase.msstate.edu/cgi-bin/tools/goretriever_select.pl

GORetriever is used to find all of the GO annotations corresponding to a list of user-supplied protein identifiers. GORetriever produces a list of proteins and their annotations and a separate list of entries with no GO annotation. Platform: Online tool

Proper citation: GORetriever (RRID:SCR_005633) Copy   


  • RRID:SCR_005740

    This resource has 1+ mentions.

http://www.lasige.di.fc.ul.pt/webtools/proteinon/

ProteInOn calculates semantic similarity between GO terms or proteins annotated with GO terms. It also calculates term enrichment of protein sets, by applying a term representativity score, and gives additional information on protein interactions. The query compute protein semantic similarity returns the semantic similarity scores between all proteins entered, in matrix format. The option Measure allows users to choose one of several semantic similarity measures: Resnik, Lin, or Jiang & Conrath's measures with or without the DCA approach, plus the graph-based simUI and simGIC measures. These measures are listed by order of performance as evaluated with protein sequence similarity. The option GO type allows users to choose one of the aspects of GO: molecular function, biological process and cellular component. The option Ignore IEA limits the query to non-electronic annotations, excluding evidence types: IEA, NAS, ND, NR.

Proper citation: ProteInOn (RRID:SCR_005740) Copy   


  • RRID:SCR_008089

    This resource has 10+ mentions.

http://www.geneatlas.org/gene/main.jsp

This website allows visitors to search for genes of interest based on their spatial expression patterns in the Postnatal Day 7 mouse brain. Geneatlas provides two searching tools: A graphical interface for customized spatial queries; A textual interface for querying annotated structures. Geneatlas is the product of a collaboration between researchers at Baylor College of Medicine, Rice University, and University of Houston.

Proper citation: Gene Atlas (RRID:SCR_008089) Copy   


  • RRID:SCR_008353

    This resource has 1+ mentions.

http://knots.mit.edu/

The knot server allows the user to check PDB entries or uploaded structures for knots and to visualize them. The size of a knot is determined by deleting amino acids from both ends. This procedure is, however, not perfect and the resulting size should only be treated as a guideline. Mathematically, knots are only well defined in closed (circular) loops. However, both the N- and C-termini of open proteins are typically located close to the surface of the protein and can be connected unambiguously: We reduce the protein to its backbone and draw two lines outward starting at the termini in the direction of the connection line between the center of mass of the backbone and the respective ends. The two lines are joined by a big loop, and the structure is topologically classified by the determination of its Alexander polynomial. To determine an estimate for the size of the knotted core, we successively delete amino acids from the N-terminus until the protein becomes unknotted. The procedure is repeated at the C-terminus starting with the last N-terminal deletion structure that contained the original knot. For each deletion, the outward-pointing line through the new termini is parallel to the respective lines computed for the full structure. Unfortunately, the size of a knot is not always precisely determined by this procedure, so reported sizes should therefore only be treated as approximate. Sponsors: Knots is funded by MIT.

Proper citation: Protein Knots (RRID:SCR_008353) Copy   


  • RRID:SCR_007116

http://probeexplorer.cicancer.org/principal.php

Probe Explorer is an open access web-based bioinformatics application designed to show the association between microarray oligonucleotide probes and transcripts in the genomic context, but flexible enough to serve as a simplified genome and transcriptome browser. Coordinates and sequences of the genomic entities (loci, exons, transcripts), including vector graphics outputs, are provided for fifteen metazoa organisms and two yeasts. Alignment tools are used to built the associations between Affymetrix microarrays probe sequences and the transcriptomes (for human, mouse, rat and yeasts). Search by keywords is available and user searches and alignments on the genomes can also be done using any DNA or protein sequence query. Platform: Online tool

Proper citation: ProbeExplorer (RRID:SCR_007116) Copy   


http://www.imtech.res.in/raghava/bhairpred/

Bhairpred server is based on machine learning technique SVM using single sequence information, evolutionary profile, predicted and observed secondary structure (as obtained using Psipred and DSSP), predicted and observed accessibility values (as obtainned from Netasa and DSSP). The methods were trained and tested on dataset of 2880 proteins and their performance was evaluated on dataset of 534 proteins used by Thornton (PNAS, 2002). Best prediction results were obtained with hybrid approach that combined prediction results from evolutionary profile, predicted secondary structure and accessibility.

Proper citation: SVM based method for predicting beta hairpin structures in proteins (RRID:SCR_008349) Copy   


  • RRID:SCR_006952

    This resource has 50+ mentions.

http://funspec.med.utoronto.ca/

FunSpec is a web-based tool for statistical evaluation of groups of genes and proteins (e.g. co-regulated genes, protein complexes, genetic interactors) with respect to existing annotations, including GO terms. FunSpec (an acronym for Functional Specification) inputs a list of yeast gene names, and outputs a summary of functional classes, cellular localizations, protein complexes, etc. that are enriched in the list. The classes and categories evaluated were downloaded from the MIPS Database and the GO Database . In addition, many published datasets have been compiled to evaluate enrichment against. Hypertext links to the publications are given. The p-values, calculated using the hypergeometric distribution, represent the probability that the intersection of given list with any given functional category occurs by chance. The Bonferroni-correction divides the p-value threshold, that would be deemed significant for an individual test, by the number of tests conducted and thus accounts for spurious significance due to multiple testing over the categories of a database. After the Bonferroni correction, only those categories are displayed for which the chance probability of enrichment is lower than: p-value/#CD where #CD is the number of categories in the selected database. Without the Bonferroni Correction, all categories are displayed for which the same probability of enrichment is lower than: p-value threshold in an individual test Note that many genes are contained in many categories, especially in the MIPS database (which are hierarchical) and that this can create biases for which FunSpec currently makes no compensation. Also the databases are treated as independent from one another, which is really not the case, and each is searched seperately, which may not be optimal for statistical calculations. Nonetheless, we find it useful for sifting through the results of clustering analysis, TAP pulldowns, etc. Platform: Online tool

Proper citation: FunSpec (RRID:SCR_006952) Copy   


  • RRID:SCR_011822

    This resource has 5000+ mentions.

http://blast.ncbi.nlm.nih.gov/Blast.cgi?PROGRAM=tblastn&PAGE_TYPE=BlastSearch&LINK_LOC=blasthome

Tool to search translated nucleotide databases using a protein query.

Proper citation: TBLASTN (RRID:SCR_011822) Copy   


  • RRID:SCR_011972

http://www.imtech.res.in/raghava/hslpred/

A support vector machine (SVM)-based method for the prediction of 4 major subcellular localization (cytoplasm, mitochondrial, nuclear and plasma membrane) of human proteins using various features such as i) amino acid composition, ii) dipeptide composition and iii) evolutionary information of proteins.

Proper citation: HSLPred (RRID:SCR_011972) Copy   



Can't find your Tool?

We recommend that you click next to the search bar to check some helpful tips on searches and refine your search firstly. Alternatively, please register your tool with the SciCrunch Registry by adding a little information to a web form, logging in will enable users to create a provisional RRID, but it not required to submit.

Can't find the RRID you're searching for? X
  1. NIDDK Information Network Resources

    Welcome to the dkNET Resources search. From here you can search through a compilation of resources used by dkNET and see how data is organized within our community.

  2. Navigation

    You are currently on the Community Resources tab looking through categories and sources that dkNET has compiled. You can navigate through those categories from here or change to a different tab to execute your search through. Each tab gives a different perspective on data.

  3. Logging in and Registering

    If you have an account on dkNET then you can log in from here to get additional features in dkNET such as Collections, Saved Searches, and managing Resources.

  4. Searching

    Here is the search term that is being executed, you can type in anything you want to search for. Some tips to help searching:

    1. Use quotes around phrases you want to match exactly
    2. You can manually AND and OR terms to change how we search between words
    3. You can add "-" to terms to make sure no results return with that term in them (ex. Cerebellum -CA1)
    4. You can add "+" to terms to require they be in the data
    5. Using autocomplete specifies which branch of our semantics you with to search and can help refine your search
  5. Save Your Search

    You can save any searches you perform for quick access to later from here.

  6. Query Expansion

    We recognized your search term and included synonyms and inferred terms along side your term to help get the data you are looking for.

  7. Collections

    If you are logged into dkNET you can add data records to your collections to create custom spreadsheets across multiple sources of data.

  8. Sources

    Here are the sources that were queried against in your search that you can investigate further.

  9. Categories

    Here are the categories present within dkNET that you can filter your data on

  10. Subcategories

    Here are the subcategories present within this category that you can filter your data on

  11. Further Questions

    If you have any further questions please check out our FAQs Page to ask questions and see our tutorials. Click this button to view this tutorial again.

X