IMIST


Vue normale Vue MARC vue ISBD

Optimization Approaches for Solving String Selection Problems

par Pappalardo, Elisa. Collection : SpringerBriefs in Optimization, 2190-8354 Détails physiques : VIII, 49 p. 2 illus. in color. online resource. ISBN :9781461490531.
Tags de cette bibliothèque : Pas de tags pour ce titre. Connectez-vous pour ajouter des tags.
    Évaluation moyenne : 0.0 (0 votes)
Exemplaires : http://dx.doi.org/10.1007/978-1-4614-9053-1

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

Il n'y a pas de commentaire pour ce document.

pour proposer un commentaire.
© Tous droits résérvés IMIST/CNRST
Angle Av. Allal Al Fassi et Av. des FAR, Hay Ryad, BP 8027, 10102 Rabat, Maroc
Tél:(+212) 05 37.56.98.00
CNRST / IMIST

Propulsé par Koha