Actions for Metaheuristics for string problems in bio-informatics

Email RIS file
Bookmark
Report an Issue

Metaheuristics for string problems in bio-informatics / Christian Blum, Paola Festa

Author
Blum, Christian, 1972-
Published
London, UK : ISTE, Ltd. ; Hoboken, New Jersey : Wiley, 2016.
Physical Description
1 online resource
Additional Creators
Festa, Paola
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Contents
Minimum Common String Partition Problem -- Longest Common Subsequence Problems -- The Most Strings With Few Bad Columns Problem -- Consensus String Problems -- Alignment Problems -- Conclusions.
Summary
This book will present the latest research on metaheuristic algorithms for some of the most important string problems in bio-informatics. Optimization problems related to strings-such as protein or DNA sequences-are very common in bioinformatics. Examples include string selection problems such as the "far from most string" problem, and other string problems such as the longest common subsequence problem and its variants, alignment problems, and similarity search. These problems are often computationally very hard. Therefore, during the last 10-15 years the research community has focused especially on metaheuristic algorithms for solving this type of problems. This book aims at presenting some of the most interesting recent work in this line of research.
Subject(s)
ISBN
1119136792 (electronic bk.)
1119136814 (electronic bk.)
9781119136798 (electronic bk.)
9781119136811 (electronic bk.)
9781848218123
Bibliography Note
Includes bibliographical references and index.
View MARC record | catkey: 19515839