• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Optimization Approaches for Solving String Selection Problems

Optimization Approaches for Solving String Selection Problems

Paperback

Series: Springerbriefs in Optimization

General ComputersGeneral Mathematics

ISBN10: 1461490529
ISBN13: 9781461490524
Publisher: Springer Nature
Published: Oct 10 2013
Pages: 49
Weight: 0.21
Height: 0.12 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Mathematics