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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Minetti, Gabriela F., Leguizamón, Guillermo, Alba, Enrique
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2012
Materias:
SAX
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