Genetic algorithm solution for double digest problem

The strongly NP-Hard Double Digest Problem, for reconstructing the physical map of DNA sequence, in now using for efficient genotyping. Most of the existing methods are inefficient in tackling large instances due to the large search space for the problem which grows as a factorial function (a!)(b!)...

Descripción completa

Detalles Bibliográficos
Autores principales: Ganjtabesh, Mohammad, Ahrabian, H, Nowzari-Dalini, A, Kashani Moghadam, Z Razaghi
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Biomedical Informatics 2012
Materias:
Hypothesis
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3374354/
https://www.ncbi.nlm.nih.gov/pubmed/22715298
http://dx.doi.org/10.6026/97320630008453

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3374354/
https://www.ncbi.nlm.nih.gov/pubmed/22715298
http://dx.doi.org/10.6026/97320630008453

Ejemplares similares