SAX: a new and efficient assembler for solving DNA Fragment Assembly Problem
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 analyz...
Guardado en:
| Autores principales: | Minetti, Gabriela F., Leguizamón, Guillermo, Alba, Enrique |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2012
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/123746 https://41jaiio.sadio.org.ar/sites/default/files/16_ASAI_2012.pdf |
| Aporte de: |
Ejemplares similares
-
Variable neighborhood search for solving the DNA fragment assembly problem
por: Minetti, Gabriela F., et al.
Publicado: (2007) -
Turbo Assembler : Quick reference guide
Publicado: (1991) -
Assembly language programming for the Intel 80XXX family
por: Giles, William B.
Publicado: (1991) -
Turbo Assembler 2.5 : User's guide
Publicado: (1991) -
Power Programming with Microsoft Macro Assembler
por: Duncan, Ray
Publicado: (1992)