The development of PIPA: an integrated and automated pipeline for genome-wide protein function annotation
Open Access
- 25 January 2008
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (1) , 52
- https://doi.org/10.1186/1471-2105-9-52
Abstract
Background Automated protein function prediction methods are needed to keep pace with high-throughput sequencing. With the existence of many programs and databases for inferring different protein functions, a pipeline that properly integrates these resources will benefit from the advantages of each method. However, integrated systems usually do not provide mechanisms to generate customized databases to predict particular protein functions. Here, we describe a tool termed PIPA (Pipeline for Protein Annotation) that has these capabilities. Results PIPA annotates protein functions by combining the results of multiple programs and databases, such as InterPro and the Conserved Domains Database, into common Gene Ontology (GO) terms. The major algorithms implemented in PIPA are: (1) a profile database generation algorithm, which generates customized profile databases to predict particular protein functions, (2) an automated ontology mapping generation algorithm, which maps various classification schemes into GO, and (3) a consensus algorithm to reconcile annotations from the integrated programs and databases. PIPA's profile generation algorithm is employed to construct the enzyme profile database CatFam, which predicts catalytic functions described by Enzyme Commission (EC) numbers. Validation tests show that CatFam yields average recall and precision larger than 95.0%. CatFam is integrated with PIPA. We use an association rule mining algorithm to automatically generate mappings between terms of two ontologies from annotated sample proteins. Incorporating the ontologies' hierarchical topology into the algorithm increases the number of generated mappings. In particular, it generates 40.0% additional mappings from the Clusters of Orthologous Groups (COG) to EC numbers and a six-fold increase in mappings from COG to GO terms. The mappings to EC numbers show a very high precision (99.8%) and recall (96.6%), while the mappings to GO terms show moderate precision (80.0%) and low recall (33.0%). Our consensus algorithm for GO annotation is based on the computation and propagation of likelihood scores associated with GO terms. The test results suggest that, for a given recall, the application of the consensus algorithm yields higher precision than when consensus is not used. Conclusion The algorithms implemented in PIPA provide automated genome-wide protein function annotation based on reconciled predictions from multiple resources.Keywords
This publication has 28 references indexed in Scilit:
- Applying negative rule mining to improve genome annotationBMC Bioinformatics, 2007
- AGMIAL: implementing an annotation strategy for prokaryote genomes as a distributed systemNucleic Acids Research, 2006
- A categorization approach to automated ontological function annotationProtein Science, 2006
- Pfam: clans, web tools and servicesNucleic Acids Research, 2006
- Beyond annotation transfer by homology: novel protein-function prediction methods to assist drug discoveryDrug Discovery Today, 2005
- PSORTb v.2.0: Expanded prediction of bacterial protein subcellular localization and insights gained from comparative proteome analysisBioinformatics, 2004
- Mapping gene ontology to proteins based on protein–protein interaction dataBioinformatics, 2004
- A Combined Transmembrane Topology and Signal Peptide Prediction MethodPublished by Elsevier ,2004
- Multiple sequence alignment with the Clustal series of programsNucleic Acids Research, 2003
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997