So-called string problems are abundant in bioinformatics and computational biology. New optimization problems dealing with DNA or protein sequences are constantly arising and researchers are highly in need of efficient optimization techniques for solving them.
One obstacle for optimization practitioners is the atypical nature of these problems which require an interdisciplinary approach in order to solve them efficiently and accurately.
This book presents the current research methods and applications of metaheuristics in bioinformatics and focuses on string problems that are combinatorial in nature to shed further light on this widely applied methodology.
2. Minimum Common String Partition Problem.
3. Longest Common Subsequence Problems.
4. The Most Strings With Few Bad Columns Problem.
5. Consensus String Problems.
6. Alignment Problems.
Christian Blum is a senior scientist at the Spanish National Research Council (CSIC) in Bellaterra, Spain.
Paola Festa is Associate Professor in Operations Research at the University of Naples Federico II, Italy.
Table of Contents
PDF File 73 Kb