Optimization Approaches For Solving String Selection Problems - Info and Reading Options

The Open Library:

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.

Search for “Optimization Approaches For Solving String Selection Problems” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Optimization Approaches For Solving String Selection Problems” in Libraries Near You:

Read or borrow “Optimization Approaches For Solving String Selection Problems” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Optimization Approaches For Solving String Selection Problems” at a library near you.