Skip Navigation


Nucleic Acids Research Advance Access originally published online on May 12, 2009
Nucleic Acids Research 2009 37(Web Server issue):W84-W89; doi:10.1093/nar/gkp373
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (3810K) Freely available
Right arrow Screen PDF (435K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
37/suppl_2/W84    most recent
gkp373v1
Right arrow Alert me when this article is cited
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 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 Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Datta, R. S.
Right arrow Articles by Sjölander, K.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Datta, R. S.
Right arrow Articles by Sjölander, K.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2009, Vol. 37, No. suppl_2 W84-W89
© 2009 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Articles

Berkeley PHOG: PhyloFacts orthology group prediction web server

Ruchira S. Datta1,*, Christopher Meacham1, Bushra Samad2, Christoph Neyer2 and Kimmen Sjölander1,2,3

1QB3 Institute, 2Department of Bioengineering and 3Department of Plant and Microbial Biology, University of California, Berkeley, CA, USA

*To whom correspondence should be addressed. Tel: +1 510 642 6642; Fax: +1 510 642 5835; Email: ruchira{at}berkeley.edu

Received March 3, 2009. Revised April 22, 2009. Accepted April 24, 2009.

Ortholog detection is essential in functional annotation of genomes, with applications to phylogenetic tree construction, prediction of protein–protein interaction and other bioinformatics tasks. We present here the PHOG web server employing a novel algorithm to identify orthologs based on phylogenetic analysis. Results on a benchmark dataset from the TreeFam-A manually curated orthology database show that PHOG provides a combination of high recall and precision competitive with both InParanoid and OrthoMCL, and allows users to target different taxonomic distances and precision levels through the use of tree-distance thresholds. For instance, OrthoMCL-DB achieved 76% recall and 66% precision on this dataset; at a slightly higher precision (68%) PHOG achieves 10% higher recall (86%). InParanoid achieved 87% recall at 24% precision on this dataset, while a PHOG variant designed for high recall achieves 88% recall at 61% precision, increasing precision by 37% over InParanoid. PHOG is based on pre-computed trees in the PhyloFacts resource, and contains over 366 K orthology groups with a minimum of three species. Predicted orthologs are linked to GO annotations, pathway information and biological literature. The PHOG web server is available at http://phylofacts.berkeley.edu/orthologs/.


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
DatabaseHome page
P. Gaudet, L. Lane, P. Fey, A. Bridge, S. Poux, A. Auchincloss, K. Axelsen, S. Braconi Quintaje, E. Boutet, P. Brown, et al.
Collaborative annotation of genes and proteins between UniProtKB/Swiss-Prot and dictyBase
Database, October 15, 2009; 2009(0): bap016 - bap016.
[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.