doi: 10.1007/978-1-60327-429-6_21.
Developing fixed-parameter algorithms to solve combinatorially explosive biological problems
Affiliations
- PMID: 18712316
- DOI: 10.1007/978-1-60327-429-6_21
Item in Clipboard
Developing fixed-parameter algorithms to solve combinatorially explosive biological problems
Methods Mol Biol.
2008.
Abstract
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.
Similar articles
-
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.Methods Mol Biol. 2017;1526:363-402. doi: 10.1007/978-1-4939-6613-4_20. Methods Mol Biol. 2017. PMID: 27896752
-
Finding optimal gene networks using biological constraints.Genome Inform. 2003;14:124-33. Genome Inform. 2003. PMID: 15706527
-
Overview of commonly used bioinformatics methods and their applications.Ann N Y Acad Sci. 2004 May;1020:10-21. doi: 10.1196/annals.1310.003. Ann N Y Acad Sci. 2004. PMID: 15208179 Review.
-
Quantifying hybridization in realistic time.J Comput Biol. 2011 Oct;18(10):1305-18. doi: 10.1089/cmb.2009.0166. Epub 2011 Jan 6. J Comput Biol. 2011. PMID: 21210735
-
Fixed-parameter algorithms in phylogenetics.Methods Mol Biol. 2008;452:507-35. doi: 10.1007/978-1-60327-159-2_24. Methods Mol Biol. 2008. PMID: 18566780 Review.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Miscellaneous
