Dataset Information

High throughput profile-profile based fold recognition for the entire human proteome.

ABSTRACT: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold recognition methods. The ability to carry out these updates on demand is necessary to keep pace with the regular updates of sequence and structure databases. Providing the highest quality structural models requires the most intensive profile-profile fold recognition methods running with the very latest available sequence databases and fold libraries. However, running these methods on such a regular basis for every sequenced proteome requires large amounts of processing power. In this paper we describe and benchmark the JYDE (Job Yield Distribution Environment) system, which is a meta-scheduler designed to work above cluster schedulers, such as Sun Grid Engine (SGE) or Condor. We demonstrate the ability of JYDE to distribute the load of genomic-scale fold recognition across multiple independent Grid domains. We use the most recent profile-profile version of our mGenTHREADER software in order to annotate the latest version of the Human proteome against the latest sequence and structure databases in as short a time as possible.We show that our JYDE system is able to scale to large numbers of intensive fold recognition jobs running across several independent computer clusters. Using our JYDE system we have been able to annotate 99.9% of the protein sequences within the Human proteome in less than 24 hours, by harnessing over 500 CPUs from 3 independent Grid domains.This study clearly demonstrates the feasibility of carrying out on demand high quality structural annotations for the proteomes of major eukaryotic organisms. Specifically, we have shown that it is now possible to provide complete regular updates of profile-profile based fold recognition models for entire eukaryotic proteomes, through the use of Grid middleware such as JYDE.

SUBMITTER: McGuffin LJ

PROVIDER: S-EPMC1513610 | biostudies-literature | 2006 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

High throughput profile-profile based fold recognition for the entire human proteome.

McGuffin Liam J LJ Smith Richard T RT Bryson Kevin K Sørensen Søren-Aksel SA Jones David T DT

BMC bioinformatics 20060607

<h4>Background</h4>In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold recognition methods. The ability to carry out these updates on demand is necessary to keep pace with the regular updates of sequence and structure databases. Providing the highest quality structural models requires the most intensive profile-profile fold recognition methods running with the very latest available s ...[more]

PMID: 16759376

Similar Datasets

Project description:Conserved domains in proteins are one of the major sources of functional information for experimental design and genome-level annotation. Though search tools for conserved domain databases such as Hidden Markov Models (HMMs) are sensitive in detecting conserved domains in proteins when they share sufficient sequence similarity, they tend to miss more divergent family members, as they lack a reliable statistical framework for the detection of low sequence similarity. We have developed a greatly improved HMMerThread algorithm that can detect remotely conserved domains in highly divergent sequences. HMMerThread combines relaxed conserved domain searches with fold recognition to eliminate false positive, sequence-based identifications. With an accuracy of 90%, our software is able to automatically predict highly divergent members of conserved domain families with an associated 3-dimensional structure. We give additional confidence to our predictions by validation across species. We have run HMMerThread searches on eight proteomes including human and present a rich resource of remotely conserved domains, which adds significantly to the functional annotation of entire proteomes. We find ?4500 cross-species validated, remotely conserved domain predictions in the human proteome alone. As an example, we find a DNA-binding domain in the C-terminal part of the A-kinase anchor protein 10 (AKAP10), a PKA adaptor that has been implicated in cardiac arrhythmias and premature cardiac death, which upon stress likely translocates from mitochondria to the nucleus/nucleolus. Based on our prediction, we propose that with this HLH-domain, AKAP10 is involved in the transcriptional control of stress response. Further remotely conserved domains we discuss are examples from areas such as sporulation, chromosome segregation and signalling during immune response. The HMMerThread algorithm is able to automatically detect the presence of remotely conserved domains in proteins based on weak sequence similarity. Our predictions open up new avenues for biological and medical studies. Genome-wide HMMerThread domains are available at http://vm1-hmmerthread.age.mpg.de.

Project description:Chemokines are small secreted proteins with important roles in immune responses. They consist of a conserved three-dimensional (3D) structure, so-called IL8-like chemokine fold, which is supported by disulfide bridges characteristic of this protein family. Sequence- and profile-based computational methods have been proficient in discovering novel chemokines by making use of their sequence-conserved cysteine patterns. However, it has been recently shown that some chemokines escaped annotation by these methods due to low sequence similarity to known chemokines and to different arrangement of cysteines in sequence and in 3D. Innovative methods overcoming the limitations of current techniques may allow the discovery of new remote homologs in the still functionally uncharacterized fraction of the human genome. We report a novel computational approach for proteome-wide identification of remote homologs of the chemokine family that uses fold recognition techniques in combination with a scaffold-based automatic mapping of disulfide bonds to define a 3D profile of the chemokine protein family. By applying our methodology to all currently uncharacterized human protein sequences, we have discovered two novel proteins that, without having significant sequence similarity to known chemokines or characteristic cysteine patterns, show strong structural resemblance to known anti-HIV chemokines. Detailed computational analysis and experimental structural investigations based on mass spectrometry and circular dichroism support our structural predictions and highlight several other chemokine-like features. The results obtained support their functional annotation as putative novel chemokines and encourage further experimental characterization. The identification of remote homologs of human chemokines may provide new insights into the molecular mechanisms causing pathologies such as cancer or AIDS, and may contribute to the development of novel treatments. Besides, the genome-wide applicability of our methodology based on 3D protein family profiles may open up new possibilities for improving and accelerating protein function annotation processes.

Project description:Filter aided sample preparation (FASP) is becoming a central method for proteomic sample cleanup and peptide generation prior to LC-MS analysis. We previously adapted this method to a 96-well filter plate, and applied to prepare protein digests from cell lysate and body fluid samples in a high throughput quantitative manner. While the 96FASP approach is scalable and can handle multiple samples simultaneously, two key advantages compared to single FASP, it is also time-consuming. The centrifugation-based liquid transfer on the filter plate takes 3-5 times longer than single filter. To address this limitation, we now present a quick 96FASP (named q96FASP) approach that, relying on the use of filter membranes with a large MWCO size (~30kDa), significantly reduces centrifugal times. We show that q96FASP allows the generation of protein digests derived from whole cell lysates and body fluids in a quality similar to that of the single FASP method. Processing a sample in multiple wells in parallel, we observed excellent experimental repeatability by label-free quantitation approach. We conclude that the q96FASP approach promises to be a promising cost- and time-effective method for shotgun proteomics and will be particularly useful in large scale biomarker discovery studies.SignificanceHigh throughput sample processing is of particular interests for quantitative proteomics. The previously developed 96FASP is high throughput and appealing, however it is time-consuming in the context of centrifugation-based liquid transfer (~1.5h per spin). This study presents a truly high throughput sample preparation method based on large cut-off 96-well filter plate, which shortens the spin time to ~20min. To our knowledge, this is the first multi-well method that is entirely comparable with conventional FASP. This study thoroughly examined two types of filter plates and performed side-by-side comparisons with single FASP. Two types of samples, whole cell lysate of a UTI (urinary tract infection)-associated Klebsiella pneumoniae cell and human urine, were tested which demonstrated its capability for quantitative proteomics. The q96FSAP approach makes the filter plate-based approach more appealing for protein biomarker discovery projects, and could be broadly applied to large scale proteomics analysis.

Project description:SummaryThe protein structure prediction approaches can be categorized into template-based modeling (including homology modeling and threading) and free modeling. However, the existing threading tools perform poorly on remote homologous proteins. Thus, improving fold recognition for remote homologous proteins remains a challenge. Besides, the proteome-wide structure prediction poses another challenge of increasing prediction throughput. In this study, we presented FALCON@home as a protein structure prediction server focusing on remote homologue identification. The design of FALCON@home is based on the observation that a structural template, especially for remote homologous proteins, consists of conserved regions interweaved with highly variable regions. The highly variable regions lead to vague alignments in threading approaches. Thus, FALCON@home first extracts conserved regions from each template and then aligns a query protein with conserved regions only rather than the full-length template directly. This helps avoid the vague alignments rooted in highly variable regions, improving remote homologue identification. We implemented FALCON@home using the Berkeley Open Infrastructure of Network Computing (BOINC) volunteer computing protocol. With computation power donated from over 20,000 volunteer CPUs, FALCON@home shows a throughput as high as processing of over 1000 proteins per day. In the Critical Assessment of protein Structure Prediction (CASP11), the FALCON@home-based prediction was ranked the 12th in the template-based modeling category. As an application, the structures of 880 mouse mitochondria proteins were predicted, which revealed the significant correlation between protein half-lives and protein structural factors.Availability and implementationFALCON@home is freely available at http://protein.ict.ac.cn/FALCON/.Contactshuaicli@cityu.edu.hk, dbu@ict.ac.cnSupplementary informationSupplementary data are available at Bioinformatics online.

Dataset Information

High throughput profile-profile based fold recognition for the entire human proteome.

Publications

High throughput profile-profile based fold recognition for the entire human proteome.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets