reine Buchbestellungen ab 5 Euro senden wir Ihnen Portofrei zuDiesen Artikel senden wir Ihnen ohne weiteren Aufpreis als PAKET

Optimization Approaches for Solving String Selection Problems
(Englisch)
SpringerBriefs in Optimization
Elisa Pappalardo & Panos M. Pardalos & Giovanni Stracquadanio

Print on Demand - Dieser Artikel wird für Sie gedruckt!

44,95 €

inkl. MwSt. · Portofrei
Dieses Produkt wird für Sie gedruckt, Lieferzeit ca. 10 Werktage
Menge:

Optimization Approaches for Solving String Selection Problems

Seiten
Erscheinungsdatum
Auflage
Ausstattung
Erscheinungsjahr
Sprache
alternative Ausgabe
Vertrieb
Kategorie
Buchtyp
Warengruppenindex
Warengruppe
Laenge
Breite
Hoehe
Gewicht
Hersteller Artikelnummer
Herkunft
Relevanz
Referenznummer
Moluna-Artikelnummer
  • 4199877

Produktbeschreibung

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 deillegalscription, 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 deillegalscription 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. 


1. Biological Sequences.- 2. Strings: Theory, Properties and Applications.- 3. Mathematical Optimization.- 4. String Selection Problems.


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 deillegalscription, 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 deillegalscription 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.


1. Biological Sequences.- 2. Strings: Theory, Properties and Applications.- 3. Mathematical Optimization.- 4. String Selection Problems.


Inhaltsverzeichnis



1. Biological Sequences.- 2. Strings: Theory, Properties and Applications.- 3. Mathematical Optimization.- 4. String Selection Problems.


Klappentext



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 deillegalscription, 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 deillegalscription 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. ¿




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

Includes supplementary material: sn.pub/extras



Datenschutz-Einstellungen