Two-Stage Optimization Methods to Solve the DNA-Sample Allocation Problem

Use this link to cite
http://hdl.handle.net/2183/32291
Except where otherwise noted, this item's license is described as Atribución 4.0 Internacional (CC BY 4.0)
Collections
- Investigación (FIC) [1654]
Metadata
Show full item recordTitle
Two-Stage Optimization Methods to Solve the DNA-Sample Allocation ProblemDate
2022-11Abstract
[Abstract]: This paper deals with new methods capable of solving the optimization problem concerning the allocation of DNA samples in plates in order to carry out the DNA sequencing with the Sanger technique. These methods make it possible to work with independent subproblems of lower complexity, obtaining solutions of good quality while maintaining a competitive time cost. They are compared with the ones introduced in the literature, obtaining interesting results. All the comparisons among the methods in the literature and the laboratory results have been made with real data.
Keywords
Scheduling
Linear programming
Metaheuristics
PCR technique
DNA sequencing
Linear programming
Metaheuristics
PCR technique
DNA sequencing
Editor version
Rights
Atribución 4.0 Internacional (CC BY 4.0)