Variable neighborhood search for solving the DNA fragment assembly problem
The fragment assembly problem consists in the building of the DNA sequence from several hundreds (or even, thousands) of fragments obtained by biologists in the laboratory. This is an important task in any genome project, since the accuracy of the rest of the phases depends of the result of this sta...
Guardado en:
| Autores principales: | Minetti, Gabriela F., Alba Torres, Enrique, Luque, Gabriel |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2007
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23084 |
| Aporte de: |
Ejemplares similares
-
SAX: a new and efficient assembler for solving DNA Fragment Assembly Problem
por: Minetti, Gabriela F., et al.
Publicado: (2012) -
Recursive and iterative algorithms for N-ary search problems
por: Sklyarov, Valery, et al.
Publicado: (2006) -
A little respect (for the role of common components in heuristic search)
por: Chen, Stephen
Publicado: (2006) -
A hybrid metaheuristic based on differential evolution and local search with quadratic interpolation
por: Tardivo, María Laura, et al.
Publicado: (2012) -
Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)