| 书目名称 | Optimization Approaches for Solving String Selection Problems |
| 编辑 | Elisa Pappalardo,Panos M. Pardalos,Giovanni Stracq |
| 视频video | |
| 概述 | 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 th |
| 丛书名称 | SpringerBriefs in Optimization |
| 图书封面 |  |
| 描述 | .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. . |
| 出版日期 | Book 2013 |
| 关键词 | NP-hard problems; String selection problems; closest string problem; computational biology; farthest str |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4614-9053-1 |
| isbn_softcover | 978-1-4614-9052-4 |
| isbn_ebook | 978-1-4614-9053-1Series ISSN 2190-8354 Series E-ISSN 2191-575X |
| issn_series | 2190-8354 |
| copyright | Elisa Pappalardo, Panos M. Pardalos, Giovanni Stracquadanio 2013 |
发表于 2025-3-21 19:01:52
