Logo - springer
Slogan - springer

New & Forthcoming Titles | Optimization Approaches for Solving String Selection Problems

Optimization Approaches for Solving String Selection Problems

Pappalardo, Elisa, Pardalos, Panos M., Stracquadanio, Giovanni

2013, VIII, 49 p. 2 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$39.99

(net) price for USA

ISBN 978-1-4614-9053-1

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$54.99

(net) price for USA

ISBN 978-1-4614-9052-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Provides both an easy and deep understanding of optimization methods for string selection problems
  • Problems are presented in a theoretical and practical manner
  • Highlights the importance of applying theoretical results to challenging problems occurring in genomics

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. ​

Content Level » Research

Keywords » NP-hard problems - String selection problems - closest string problem - computational biology - farthest string problem - heuristics

Related subjects » Computational Science & Engineering - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Optimization.