Library Services | Technical University of Kenya

Your cart is empty.
Normal view MARC view ISBD view

Optimization Approaches for Solving String Selection Problems [electronic resource] / by Elisa Pappalardo, Panos M. Pardalos, Giovanni Stracquadanio.

By: Pappalardo, Elisa [author.].
Contributor(s): Pardalos, Panos M [author.] | Stracquadanio, Giovanni [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: SpringerBriefs in Optimization: Publisher: New York, NY : Springer New York : Imprint: Springer, 2013Description: VIII, 49 p. 2 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781461490531.Subject(s): Mathematics | Computational complexity | Computer science | Computer science -- Mathematics | Mathematics | Discrete Optimization | Mathematical and Computational Biology | Discrete Mathematics in Computer Science | Math Applications in Computer Science | Computational Mathematics and Numerical AnalysisDDC classification: 519.6 Online resources: Click here to access online
Contents:
1. Biological Sequences -- 2. Strings: Theory, Properties and Applications -- 3. Mathematical Optimization -- 4. String Selection Problems.
In: Springer eBooksSummary: 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. 
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue