Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.
Methods in molecular biology (Clifton, N.J.)（2017）
Abstract
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.
MoreTranslated text
Key words
Computational intractability,NP-hard problems,Algorithm design,Exponential running times,Discrete problems,Fixed-parameter tractability,Optimal solutions
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined