Metaheuristics for String Problems in Bio-informatics

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.

Keywords: acronyms; list; ix; optimization; combinatorial; methods; linear; plane; algorithms; search; local; book; outline; minimum; problem; common; description; umcsp problem; technical; ilp; model; subsequence; longest; problems, Computer Security & Cryptography, Bioinformatics & Computational Biology, Computer Security & Cryptography, Bioinformatics & Computational Biology