Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2021-08-30T15:39:13Z
dc.date.available 2021-08-30T15:39:13Z
dc.date.issued 2012
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/123746
dc.description.abstract In the past, the Fragment Assembly Problem has been solved efficiently by many metaheuristics. In this work, we propose a new one, called SAX, which consists in combining two metaheuristics: a trajectory method as Simulated Annealing and a population-based method as Genetic Algorithm. We also analyze the relative advantages of this hybridization against other assemblers from literature. From this analysis, we conclude that SAX improves the quality results found by other metaheuristic and non-metaheuristic assemblers for solving 100% of the largest instances for this problem. en
dc.format.extent 177-188 es
dc.language en es
dc.subject DNA Fragment Assembly Problem es
dc.subject Assembler es
dc.subject SAX es
dc.title SAX: a new and efficient assembler for solving DNA Fragment Assembly Problem en
dc.type Objeto de conferencia es
sedici.identifier.uri https://41jaiio.sadio.org.ar/sites/default/files/16_ASAI_2012.pdf es
sedici.identifier.issn 1850-2784 es
sedici.creator.person Minetti, Gabriela F. es
sedici.creator.person Leguizamón, Guillermo es
sedici.creator.person Alba, Enrique es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.date.exposure 2012-08
sedici.relation.event XIII Argentine Symposium on Artificial Intelligence (ASAI 2012) (XLI JAIIO, La Plata, 27 y 28 de agosto de 2012) es
sedici.description.peerReview peer-review es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)