Having introduced a couple of core bioinformatics problems in the first chapter we now transform these problems into algorithmic problems using terminology that is well-known to a computer scientist. Usually, algorithmic bioinformatics problems are optimization problems. The following components characterize any optimization problem:
-
•
An alphabet Σ of characters.
-
•
A set I of admissible character strings that may occur as input instances.
-
•
A solution relation S defining what is to be found, given admissible input x.
-
•
An objective function c evaluating quality of solutions.
-
•
A mode, min or max.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Turning to Algorithmic Problems. In: Bioinformatics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78506-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-78506-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78505-7
Online ISBN: 978-3-540-78506-4
eBook Packages: Computer ScienceComputer Science (R0)