Mostrar o rexistro simple do ítem

dc.contributor.authorNoceda-Davila, Diego
dc.contributor.authorLorenzo Freire, Silvia
dc.contributor.authorCarpente, Luisa
dc.date.accessioned2023-01-03T12:32:23Z
dc.date.available2023-01-03T12:32:23Z
dc.date.issued2022-11
dc.identifier.urihttp://hdl.handle.net/2183/32291
dc.description.abstract[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.es_ES
dc.description.sponsorshipMinisterio de Economía y Competitividad; MTM2017-87197-C3-1-Pes_ES
dc.description.sponsorshipAgencia Estatal de Investigación; PID2021-124030NB-C31es_ES
dc.description.sponsorshipXunta de Galicia; ED431C-2020/14es_ES
dc.description.sponsorshipXunta de Galicia; ED431G-2019/01es_ES
dc.language.isoenges_ES
dc.publisherMDPIes_ES
dc.relation.urihttps://doi.org/10.3390/math10224359es_ES
dc.rightsAtribución 4.0 Internacional (CC BY 4.0)es_ES
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/es/*
dc.subjectschedulinges_ES
dc.subjectlinear programminges_ES
dc.subjectMetaheuristicses_ES
dc.subjectPCR techniquees_ES
dc.subjectDNA sequencinges_ES
dc.titleTwo-stage optimization methods to solve the DNA-sample allocation problemes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessinfo:eu-repo/semantics/openAccesses_ES
UDC.journalTitleMathematicses_ES
UDC.volume10es_ES
UDC.issue22es_ES
dc.identifier.doi10.3390/math10224359


Ficheiros no ítem

Thumbnail
Thumbnail

Este ítem aparece na(s) seguinte(s) colección(s)

Mostrar o rexistro simple do ítem