DocumentCode :
2527151
Title :
Automatic protein function annotation through candidate ortholog clusters from incomplete genomes
Author :
Vashist, Akshay ; Kulikowski, Casimir ; Muchnik, Ilya
Author_Institution :
Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ, USA
fYear :
2005
fDate :
8-11 Aug. 2005
Firstpage :
73
Lastpage :
74
Abstract :
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.
Keywords :
biology computing; genetics; molecular biophysics; pattern clustering; proteins; statistical analysis; Arabidopsis; Rice proteome; automatic protein function annotation; evolution; genomes annotation; ortholog cluster; protein sequence; Bioinformatics; Clustering methods; Computer science; Conferences; Genomics; Nearest neighbor searches; Optimization methods; Protein engineering; Protein sequence; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Systems Bioinformatics Conference, 2005. Workshops and Poster Abstracts. IEEE
Print_ISBN :
0-7695-2442-7
Type :
conf
DOI :
10.1109/CSBW.2005.27
Filename :
1540546
Link To Document :
بازگشت