A Quick Algorithm for Minimal Vertex Cover of Bio network

摘要：

To improve the distinguishing of vital protein, vertex-cover-parameter (VCP) is proposed to scale a nodes status in a bionetwork. To keep away from the NP-hard which probable met in the acquisition of VCP, a parameterized algorithm is used to compress the size of the network to get its kernel, and then an exact or non-exact algorithm is used to solve the kernel and obtain the VCP of each node. In simulation, the distinguishing ratio of vital protein is obviously improved by VCP.

关键词： quick algorithm vertex-cover-parameter bionetwork

作者: Haibin Huang Xiuying Du Jian Pan

作者单位: Department of Mathematics and Computer Science Yulin Normal University Yulin, PR China

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

会议地点: 上海

会议语种:英文

页码: 267-271

在线出版日期: 2010-06-22（万方平台首次上网日期，不代表论文的发表时间）