Cargando...
Parallelizing Assignment Problem with DNA Strands
BACKGROUND: Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. Howeve...
Gardado en:
| Publicado en: | Iran J Biotechnol |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
National Institute of Genetic Engineering and Biotechnology
2020
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7461708/ https://ncbi.nlm.nih.gov/pubmed/32884959 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.30498/IJB.2020.195413.2547 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|