Heuristic algorithms in computational molecular biology

被引：8
|
作者：
Karp, Richard M. [1 ,2 ]
机构：
[1] Univ Calif Berkeley, Dept Comp Sci, Berkeley, CA 94720 USA
[2] Int Comp Sci Inst, Berkeley, CA 94704 USA
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2011年 / 77卷 / 01期
基金：
美国国家科学基金会;
关键词：
Heuristic algorithm; Implicit hitting set; Multi-genome alignment; Protein interaction; PROTEIN-INTERACTION NETWORKS; ALIGNMENT; PATHWAYS;
D O I：
10.1016/j.jcss.2010.06.009
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we develop a framework for designing and validating heuristic algorithms for NP-hard problems arising in computational biology and other application areas. We introduce two areas of current research in which we are applying the framework: implicit hitting set problems and analysis of protein-protein interaction networks, with emphasis on a specific problem in each area: multi-genome alignment and colorful connected graph detection. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：122 / 128
页数：7
相关论文
共 50 条
12345