loading...
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Stanford, California August 08-August 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSBW.2005.272005 IEEE Computational Systems Bioin ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Akshay Vashist, Rutgers University, Piscataway
Casimir Kulikowski, Rutgers University, Piscataway
Rutgers University, DIMACS, Rutgers University

Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog clusters from incomplete genomes that are evolutionary closely related to the genome of interest. To construct clusters, our method focuses on sequence similarities across genomes rather than similarities between sequences within a genome. We use the quasi-concave set function optimization for extracting the ortholog clusters as extreme groups of sequences such that similarity of the least similar sequence in this group is maximum. A protein sequence is annotated with the ortholog cluster whose average similarity is highest. We have applied this method for annotating the Rice proteome based on clusters constructed on four partially complete cereal proteomes and the complete proteome from Arabidopsis.

Citation:
Akshay Vashist, Casimir Kulikowski, Rutgers University, "Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes," csbw, pp.73-74, 2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.