Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Optimization Approaches for Solving String Selection Problems, Paperback / softback Book

Optimization Approaches for Solving String Selection Problems Paperback / softback

Part of the SpringerBriefs in Optimization series

Paperback / softback

Description

Optimization Approaches for Solving String Selection Problems provides an overview of optimization methods for a wide class of genomics-related problems in relation to the string selection problems.

This class of problems addresses the recognition of similar characteristics or differences within biological sequences.

Specifically, this book considers a large class of problems, ranging from the closest string and substring problems, to the farthest string and substring problems, to the far from most string problem.

Each problem includes a detailed description, highlighting both biological and mathematical features and presents state-of-the-art approaches. This Brief provides a quick  introduction of optimization methods for string selection problems for young scientists and a detailed description of the mathematical and computational methods developed for experts in the field of optimization who want to deepen their understanding of the string selection problems.

Researchers, practitioners and graduate students in the field of Computer Science, Operation Research, Mathematics, Computational Biology and Biomedicine will find this book useful. ?

Information

Other Formats

Save 16%

£44.99

£37.59

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the SpringerBriefs in Optimization series  |  View all