Tools   Select Another Resource Report Type

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

A web tool to create, display and manipulate structures of small molecules, proteins and DNA.

Proper citation: SCAR (RRID:SCR_006227) Copy   

•   Source: SciCrunch Registry

http://athina.biol.uoa.gr/bioinformatics/NON-RED/index.html

A web tool to select biological sequences from a given set, with similarity / homology less than a user-defined level. This web-based application takes as input a set of N sequences and outputs a set of sequences of user-determined redundancy. Initially, the algorithm runs an all-against-all BLAST alignment on the input data set and creates an NxN matrix of pairwise distances defined by the similarity percentages. In the next step, the algorithm removes the sequence with the largest number of neighbors, causing that sequence not to be counted as a neighbor of any other sequence during the next iterations. It then reassesses the number of neighbors of each sequence and repeats the previous step until the sequences left over have no more neighbors. The user can specify the similarity (%) threshold and the minimum coverage length of the alignments. Sequences with a similarity below the threshold or a smaller coverage than the minimum length are not considered to be neighbors.

Proper citation: NON-RED (RRID:SCR_006225) Copy   

•   Source: SciCrunch Registry

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

A tool to Predict the Secondary Structure of a protein from its amino acid sequence alone. The SecStr package uses six different secondary structure prediction methods (Nagano, Garnier et al., Burges et al., Chou and Fasman , Lim and Dufton and Hider). The results of those methods are combined into a Joint Prediction Histogram (JPH) as described by Hamodrakas, 1988 and Hamodrakas et al., 1982. As previously mentioned, the SecStr package contains computer programs making use of the secondary structure prediction methods of Nagano, Garnier et al., Burges et al., Chou and Fasman, Lim and Dufton and Hider. These programs were written in Fortran. The results of individual prediction methods are combined as described by Hamodrakas (1988), using a Perl program, to produce joint prediction histograms (JPH), for three types of secondary structure, which may be presented separately on a Java Applet. The output may be given either in text or graphics mode. For the latter a Java capable browser is required.

Proper citation: SecStr (RRID:SCR_006220) Copy   

•   Source: SciCrunch Registry

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

A web tool for the prediction of Cell Wall-Anchored Proteins in Gram+ Bacteria. Gram-positive bacteria have surface proteins that are often implicated in virulence. A group of extracellular proteins attached to the cell wall contains an LPXTG-like motif that is target for cleavage and covalent coupling to peptidoglycan by sortase enzymes. A new Hidden Markov Model (HMM), an extension to the HMM model from Litou et al., http://www.ncbi.nlm.nih.gov/pubmed/18464329, was developed for predicting the LPXTG and LPXTG-like cell-wall proteins of Gram-positive bacteria. An analysis of 177 completely sequenced genomes has been performed as well. We identified in total 1456 cell-wall proteins, from which 1283 have the LPXTG motif, 39 the NPXTG motif, 53 have the LPXTA and 81 the LAXTG motif.

Proper citation: CW-PRED (RRID:SCR_006188) Copy   

•   Source: SciCrunch Registry

http://mutationassessor.org/

A web server that predicts the functional impact of amino-acid substitutions in proteins, such as mutations discovered in cancer or nonsynonymous polymorphisms. The functional impact is assessed based on evolutionary conservation of the affected amino acid in protein homologs. The method has been validated on a large set (51k) of disease associated (OMIM) and polymorphic variants., THIS RESOURCE IS NO LONGER IN SERVICE. Documented on September 16,2025.

Proper citation: MutationAssessor (RRID:SCR_005762) Copy   

•   Source: SciCrunch Registry

http://webclu.bio.wzw.tum.de/profcom/

Profiling of Complex Functionality (ProfCom) is a web-based tool for the functional interpretation of a gene list that was identified to be related by experiments. A trait which makes ProfCom a unique tool is an ability to profile enrichments of not only available Gene Ontology (GO) terms but also of complex function. A complex function is constructed as Boolean combination of available GO terms. The complex functions inferred by ProfCom are more specific in comparison to single terms and describe more accurately the functional role of genes. Platform: Online tool

Proper citation: ProfCom - Profiling of complex functionality (RRID:SCR_005797) Copy   

•   Source: SciCrunch Registry

http://www.compbio.dundee.ac.uk/gotcha/gotcha.php

GOtcha provides a prediction of a set of GO terms that can be associated with a given query sequence. Each term is scored independently and the scores calibrated against reference searches to give an accurate percentage likelihood of correctness. These results can be displayed graphically. Why is GOtcha different to what is already out there and why should you be using it? * GOtcha uses a method where it combines information from many search hits, up to and including E-values that are normally discarded. This gives much better sensitivity than other methods. * GOtcha provides a score for each individual term, not just the leaf term or branch. This allows the discrimination between confident assignments that one would find at a more general level and the more specific terms that one would have lower confidence in. * The scores GOtcha provides are calibrated to give a real estimate of correctness. This is expressed as a percentage, giving a result that non-experts are comfortable in interpreting. * GOtcha provides graphical output that gives an overview of the confidence in, or potential alternatives for, particular GO term assignments. The tool is currently web-based; contact David Martin for details of the standalone version. Platform: Online tool

Proper citation: GOtcha (RRID:SCR_005790) Copy   

•   Source: SciCrunch Registry

http://xldb.fc.ul.pt/biotools/rebil/goa/

A tool for assisting the GO annotation of UniProt entries by linking the GO terms present in the uncurated annotations with evidence text automatically extracted from the documents linked to UniProt entries. Platform: Online tool

Proper citation: GoAnnotator (RRID:SCR_005792) Copy   

•   Source: SciCrunch Registry

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

Service to summarize the GO function associated with a data set using prepared GO Slim sets. The input is a tab separated list of gene product IDs and GO IDs.

Proper citation: GOSlimViewer (RRID:SCR_005665) Copy   

•   Source: SciCrunch Registry

http://pipeclip.qbrc.org/

A Galaxy framework-based online pipeline for reliable analysis of data generated by three types of CLIP-seq protocols: HITS-CLIP, PAR-CLIP and iCLIP. It provides both data processing and statistical analysis to determine candidate cross-linking regions, which are comparable to those regions identified from the original studies or using existing computational tools., THIS RESOURCE IS NO LONGER IN SERVICE. Documented on September 16,2025.

Proper citation: PIPE-CLIP (RRID:SCR_005820) Copy   

•   Source: SciCrunch Registry

http://www.ebi.ac.uk/expressionprofiler/

THIS RESOURCE IS NO LONGER IN SERVCE, documented September 2, 2016. The EP:GO browser is built into EBI's Expression Profiler, a set of tools for clustering, analysis and visualization of gene expression and other genomic data. With it, you can search for GO terms and identify gene associations for a node, with or without associated subnodes, for the organism of your choice.

Proper citation: Expression Profiler (RRID:SCR_005821) Copy   

•   Source: SciCrunch Registry

http://www.snubi.org/software/GOChase/

GOChase is a set of web-based utilities to detect and correct the errors in GO-based annotations. # GOChase-History resolves the whole modification history of GO IDs. # GOChase-Correct highlights merged GO IDs and redirects to the correct primary term into which the secondary ID was merged. For obsolete GO terms, the nearest non-discarded parent term is recommended by GOChase. This function may be used by GO browsers such as AmiGO and QuickGO to fix broken hyperlinks. # A whole database (such as LocusLink) as a flat file can be loaded into GOChase, reporting the annotation errors and GOChase corrections. # When one inputs a GO ID, GOChase will resolve all gene products annotated with the GO ID across all the major databases. Platform: Online tool

Proper citation: GOChase (RRID:SCR_005822) Copy   

•   Source: SciCrunch Registry

http://www.yeastgenome.org/cgi-bin/GO/goSlimMapper.pl

The GO Slim Mapper (aka GO Term Mapper) maps the specific, granular GO terms used to annotate a list of budding yeast gene products to corresponding more general parent GO slim terms. Uses the SGD GO Slim sets. Three GO Slim sets are available at SGD: * Macromolecular complex terms: protein complex terms from the Cellular Component ontology * Yeast GO-Slim: GO terms that represent the major Biological Processes, Molecular Functions, and Cellular Components in S. cerevisiae * Generic GO-Slim: broad, high level GO terms from the Biological Process and Cellular Component ontologies selected and maintained by the Gene Ontology Consortium (GOC) Platform: Online tool

Proper citation: SGD Gene Ontology Slim Mapper (RRID:SCR_005784) Copy   

•   Source: SciCrunch Registry

http://athina.biol.uoa.gr/bioinformatics/mcmbb/

A web tool used in the discrimination of beta-barrel outer membrane proteins with a Markov chain model. MCMBB is a fast algorithm, which discriminates beta-barrel outer membrane proteins from globular proteins and from alpha-helical membrane proteins. The algorithm is based on a 1st order Markov Chain model, which captures the alternating pattern of hydrophilic-hydrophobic residues occurring in the membrane-spanning beta-strands of beta-barrel outer membrane proteins. The model achieves high accuracy in discriminating outer membrane proteins, since it can discriminate beta-barrel outer membrane with a correct classification rate of 90.08% and the globular proteins with a correct classification rate of 92.67%. When submitting alpha-helical membrane proteins, the method shows an accuracy of 100%. A score greater than zero, indicates that the protein is more likely to be a beta-barrel outer membrane protein, whereas a result lower than zero, indicates that the protein is probable not a beta-barrel. You may enter up to 1000 sequences in Fasta format.

Proper citation: MCMBB (RRID:SCR_006198) Copy   

•   Source: SciCrunch Registry

http://athina.biol.uoa.gr/bioinformatics/waveTM/

A web tool for the prediction of transmembrane segments in alpha-helical membrane proteins. A sliding window of 20 residues is used in order to calculate an average residue hydrophobicity profile, using a hydrophobicity scale. Discrete Wavelet Transform is applied on the average residue hydrophobicity signal and the different frequency coefficients produced are adaptively thresholded so that a denoised signal is reconstructed. A dynamic programming algorithm processes the denoised signal to provide the optimal model for the number, the length and the location of membrane-spanning segments. The end points of the predicted segments are extended to include flanking hydrophobic residues. Topology prediction can also be obtained in conjunction with OrienTM (Liakopoulos et al, 2001). Analysis of a non-redundant test set, provides a ~95% per segment accuracy and ~90% per residue accuracy. Now, you can: * Run waveTM on a sequence * Browse the results obtained with the algorithm * View additional material concerning the hydrophobicity scale

Proper citation: waveTM (RRID:SCR_006199) Copy   

•   Source: SciCrunch Registry

http://athina.biol.uoa.gr/bioinformatics/PRED-COUPLE2/

A tool that predicts the coupling specificity of G-protein coupled receptors to G-proteins. We present a method that combines hidden Markov models and a feed-forward artificial neural network to overcome these limitations, while producing the most accurate predictions currently available. Using an up-to-date curated dataset, our method yields a 94% correct classification rate in a 5-fold cross-validation test. The method predicts also promiscuous coupling preferences, including coupling to G12/13, whereas unlike other methods avoids overpredictions (false positives) when non-GPCR sequences are encountered. * The PRED-COUPLE 2.00 system predicts coupling specificty of GPCRs to all families of G-proteins (including G12/13). * Coupling to more than one G-protein families can also be predicted with this tool. * No membrane topology information is required. Furthermore, no membrane topology prediction is executed by this method. * The method is based on a refined library of highly-discriminative Hidden Markov Models. Hits from individual profiles are combined by a feed-forward Artificial Neural Network to produce the final output. * Seven (7) transmembrane receptor signatures from the Pfam database version 17.00 are also applied in order to verify a true GPCR sequence. When a query sequence is not recognized as a 7 transmembrane receptor a message is shown.

Proper citation: PRED-COUPLE 2 (RRID:SCR_006193) Copy   

•   Source: SciCrunch Registry

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

A web tool, based on a Hidden Markov Model, capable of predicting the transmembrane beta-strands of the gram-negative bacteria outer membrane proteins, and of discriminating such proteins from water-soluble ones when screening large datasets. The model is trained in a discriminative manner, aiming at maximizing the probability of the correct prediction rather than the likelihood of the sequences. The training is performed on a non-redundant database consisting of 16 outer membrane proteins (OMP''s) with their structures known at atomic resolution. We show that we can achieve predictions at least as good comparing with other existing methods, using as input only the amino-acid sequence, without the need of evolutionary information included in multiple alignments. The method is also powerful when used for discrimination purposes, as it can discriminate with a high accuracy the outer membrane proteins from water soluble in large datasets, making it a quite reliable solution for screening entire genomes. This web-server can help you run a discriminating process on any amino-acid sequence and thereafter localize the transmembrane strands and find the topology of the loops.

Proper citation: PRED-TMBB (RRID:SCR_006190) Copy   

•   Source: SciCrunch Registry

http://www.uniprot.org/uniparc/

Database that contains publicly available protein sequences with stable and unique identifiers (UPI) which are never removed, changed or reassigned. UniParc tracks sequence changes in the source databases and archives the history of all changes. Information other than protein sequence must be retrieved from the UniParc source databases using the database cross-references.

Proper citation: UniParc (RRID:SCR_005818) Copy   

•   Source: SciCrunch Registry

http://lussierlab.org/GO-Module/GOModule.cgi

GO-Module provides an interface to reduce the dimensionality of GO enrichment results and produce interpretable biomodules of significant GO terms organized by hierarchical knowledge that contain only true positive results. Users can download a text file of GO terms annotated with their significance and identified biomodules, a network visualization of resultant GO IDs or terms in PDF format, and view results in an online table. Platform: Online tool

Proper citation: GO-Module (RRID:SCR_005813) Copy   

•   Source: SciCrunch Registry

http://wishart.biology.ualberta.ca/polysearch/index.htm

A web-based tool that supports more than 50 different classes of queries against nearly a dozen different types of text, scientific abstract or bioinformatic databases. The typical query supported by PolySearch is Given X, find all Y''s where X or Y can be diseases, tissues, cell compartments, gene/protein names, SNPs, mutations, drugs and metabolites. PolySearch also exploits a variety of techniques in text mining and information retrieval to identify, highlight and rank informative abstracts, paragraphs or sentences.

Proper citation: PolySearch (RRID:SCR_005291) Copy   

•   Source: SciCrunch Registry