Fixed-parameter algorithms can efficiently find optimal solutions to some computationally hard (NP-hard) problems. This chapter surveys five main practical techniques to develop such algorithms. Each technique is circumstantiated by case studies of applications to biological problems. It also presents other known bioinformatics-related applications and gives pointers to experimental results.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1007/978-1-60327-429-6_21 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!