文章基本信息

标题：A traveling salesman approach for predicting protein functions
本地全文：下载
作者：Olin Johnson ; Jing Liu
期刊名称：Source Code for Biology and Medicine
印刷版ISSN：1751-0473
电子版ISSN：1751-0473
出版年度：2006
卷号：1
期号：1
页码：3
DOI：10.1186/1751-0473-1-3
语种：English
出版社：BioMed Central
摘要：Protein-protein interaction information can be used to predict unknown protein functions and to help study biological pathways. Here we present a new approach utilizing the classic Traveling Salesman Problem to study the protein-protein interactions and to predict protein functions in budding yeast Saccharomyces cerevisiae. We apply the global optimization tool from combinatorial optimization algorithms to cluster the yeast proteins based on the global protein interaction information. We then use this clustering information to help us predict protein functions. We use our algorithm together with the direct neighbor algorithm [1] on characterized proteins and compare the prediction accuracy of the two methods. We show our algorithm can produce better predictions than the direct neighbor algorithm, which only considers the immediate neighbors of the query protein. Our method is a promising one to be used as a general tool to predict functions of uncharacterized proteins and a successful sample of using computer science knowledge and algorithms to study biological problems.
关键词：Travel Salesman Problem ; Travel Salesman Problem ; Yeast Protein ; Query Protein ; Uncharacterized Protein