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...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
National Institute of Genetic Engineering and Biotechnology
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7461708/ https://www.ncbi.nlm.nih.gov/pubmed/32884959 http://dx.doi.org/10.30498/IJB.2020.195413.2547 |