Optimization Approaches for Solving 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.
Wesley Curnow, a young Cornish miner, arrives in the United States to seek an uncle who is working on the mines in Missouri. Taking passage on a boat from New York, bound for New Orleans, he meets up with a charismatic U.S. marshal who is en route to the western territories to bring law to the area. After a gun fight with pirates on the…
This Brief provides a quickintroduction 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.
How to download book
Buy this book
You can buy this book now only for $41.59. This is the lowest price for this book.
Download book free
If you want to download this book for free, please register, approve your account and get one book for free.
After that you may download book «Optimization Approaches for Solving String Selection Problems»: