logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Metaheuristics For String Problems In Bioinformatics Blum Christian Festa

  • SKU: BELL-5700042
Metaheuristics For String Problems In Bioinformatics Blum Christian Festa
$ 31.00 $ 45.00 (-31%)

0.0

0 reviews

Metaheuristics For String Problems In Bioinformatics Blum Christian Festa instant download after payment.

Publisher: ISTE
File Extension: PDF
File size: 2.65 MB
Pages: 219
Author: Blum, Christian; Festa, Paola
ISBN: 9781119136798, 9781119136811, 9781848218123, 1119136792, 1119136814, 1848218125
Language: English
Year: 2016

Product desciption

Metaheuristics For String Problems In Bioinformatics Blum Christian Festa by Blum, Christian; Festa, Paola 9781119136798, 9781119136811, 9781848218123, 1119136792, 1119136814, 1848218125 instant download after payment.

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.
Abstract: 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.

Related Products