Skip Navigation


Bioinformatics Advance Access originally published online on February 5, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/7/1151    most recent
bth054v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (36)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cai, Y.-D.
Right arrow Articles by Chou, K.-C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Cai, Y.-D.
Right arrow Articles by Chou, K.-C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(7) © Oxford University Press 2004; all rights reserved.

Predicting subcellular localization of proteins in a hybridization space

Yu-Dong Cai 1,* and Kuo-Chen Chou 2,3

1 Biomolecular Sciences Department, UMIST, PO Box 88, Manchester M60 1QD, UK, 2 Gordon Life Science Institute, San Diego, CA 92130, USA and 3 Tianjin Research Institute of Bioinformatics and Drug Discovery (TRIBD), Tianjin, China

Received on July 14, 2003; revised on November 18, 2003; accepted on December 5, 2003
Advance Access Publication February 5, 2004

Motivation: The localization of a protein in a cell is closely correlated with its biological function. With the number of sequences entering into databanks rapidly increasing, the importance of developing a powerful high-throughput tool to determine protein subcellular location has become self-evident. In view of this, the Nearest Neighbour Algorithm was developed for predicting the protein subcellular location using the strategy of hybridizing the information derived from the recent development in gene ontology with that from the functional domain composition as well as the pseudo amino acid composition.

Results: As a showcase, the same plant and non-plant protein datasets as investigated by the previous investigators were used for demonstration. The overall success rate of the jackknife test for the plant protein dataset was 86%, and that for the non-plant protein dataset 91.2%. These are the highest success rates achieved so far for the two datasets by following a rigorous cross-validation test procedure, suggesting that such a hybrid approach (particularly by incorporating the knowledge of gene ontology) may become a very useful high-throughput tool in the area of bioinformatics, proteomics, as well as molecular cell biology.

Availability: The software would be made available on sending a request to the authors.

Contact: y.cai{at}umist.ac.uk

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Protein Eng Des SelHome page
Q.-B. Gao and Z.-Z. Wang
Classification of G-protein coupled receptors at four levels
Protein Eng. Des. Sel., November 1, 2006; 19(11): 511 - 516.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Hoglund, P. Donnes, T. Blum, H.-W. Adolph, and O. Kohlbacher
MultiLoc: prediction of protein subcellular localization using N-terminal targeting sequences, sequence motifs and amino acid composition
Bioinformatics, May 15, 2006; 22(10): 1158 - 1165.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.