Metaheuristics for string problems in bio-informatics /
نام عام مواد
[Book]
نام نخستين پديدآور
Christian Blum, Paola Festa
مشخصات ظاهری
نام خاص و کميت اثر
1 online resource.
فروست
عنوان فروست
Metaheuristics set ;
مشخصه جلد
volume 6
یادداشتهای مربوط به کتابنامه ، واژه نامه و نمایه های داخل اثر
متن يادداشت
Includes bibliographical references and index
یادداشتهای مربوط به مندرجات
متن يادداشت
Minimum Common String Partition Problem -- Longest Common Subsequence Problems -- The Most Strings With Few Bad Columns Problem -- Consensus String Problems -- Alignment Problems -- Conclusions
بدون عنوان
0
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Bioinformatics.
رده بندی ديویی
شماره
570
.
285
ويراست
23
رده بندی کنگره
شماره رده
QH324
.
2
نشانه اثر
.
B58
2016
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )