| dc.creator | Minetti, Gabriela F. | |
| dc.creator | Leguizamón, Guillermo | |
| dc.creator | Alba, Enrique | |
| dc.date | 2012-08 | |
| dc.date | 2012 | |
| dc.date | 2021-08-30T15:39:13Z | |
| dc.date.accessioned | 2023-07-15T03:01:15Z | |
| dc.date.available | 2023-07-15T03:01:15Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/123746 | |
| dc.identifier | https://41jaiio.sadio.org.ar/sites/default/files/16_ASAI_2012.pdf | |
| dc.identifier | issn:1850-2784 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7464144 | |
| dc.description | 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. | |
| dc.description | Sociedad Argentina de Informática e Investigación Operativa | |
| dc.format | application/pdf | |
| dc.format | 177-188 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | DNA Fragment Assembly Problem | |
| dc.subject | Assembler | |
| dc.subject | SAX | |
| dc.title | SAX: a new and efficient assembler for solving DNA Fragment Assembly Problem | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
