首页> 外文会议>ICETC 2010;International Conference on Education Technology and Computer >A Quick Algorithm for Minimal Vertex Cover of Bio network
【24h】

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 node's 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.
机译:为了改善生命蛋白的区分,提出了顶点覆盖参数(VCP)来缩放生物网络中节点的状态。为了避免在获取VCP时可能遇到的NP难题,使用参数化算法压缩网络的大小以获取其内核,然后使用精确或非精确算法来求解内核和获取每个节点的VCP。在仿真中,VCP明显提高了重要蛋白质的区分率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号