Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multipl...

Descripción completa

Detalles Bibliográficos
Autor principal: Martín H., José Antonio
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3544923/
https://www.ncbi.nlm.nih.gov/pubmed/23349711
http://dx.doi.org/10.1371/journal.pone.0053437

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3544923/
https://www.ncbi.nlm.nih.gov/pubmed/23349711
http://dx.doi.org/10.1371/journal.pone.0053437

Ejemplares similares