Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

Falk Hüffner,Christian Komusiewicz,Rolf Niedermeier,Sebastian Wernicke

BIOINFORMATICS, VOL II: STRUCTURE, FUNCTION, AND APPLICATIONS, 2ND EDITION（2017）

引用 2|浏览9

暂无评分

摘要

Fixed-parameter algorithms are designed to efficiently find optimal solutions to some computationally hard (NP-hard) problems by identifying and exploiting "small" problem-specific parameters. We survey practical techniques to develop such algorithms. Each technique is introduced and supported by case studies of applications to biological problems, with additional pointers to experimental results.

查看译文

关键词

Computational intractability, NP-hard problems, Algorithm design, Exponential running times, Discrete problems, Fixed-parameter tractability, Optimal solutions

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要