Metaheuristics for string problems in bio-informatics

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Christian Blum, Paola Festa

Ngôn ngữ: eng

ISBN-10: 1848218125

ISBN-13: 978-1848218123

Ký hiệu phân loại: 570.285 Life sciences Biology

Thông tin xuất bản: London, UK : Hoboken, NJ : ISTE ; Wiley, 2016.

Mô tả vật lý: x, 204 pages : , illustrations ; , 24 cm.

Bộ sưu tập: Khoa học tự nhiên

ID: 156629

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.-- Source other than Library of Congress.
Includes bibliographical references (pages 187-204) and index.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 71010608 | Email: tt.thuvien@hutech.edu.vn

Copyright @2020 THƯ VIỆN HUTECH