Solving a Hamiltonian Path Problem with a bacterial computer

BACKGROUND: The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challeng...

Descripción completa

Detalles Bibliográficos
Autores principales: Baumgardner, Jordan, Acker, Karen, Adefuye, Oyinade, Crowley, Samuel Thomas, DeLoache, Will, Dickson, James O, Heard, Lane, Martens, Andrew T, Morton, Nickolaus, Ritter, Michelle, Shoecraft, Amber, Treece, Jessica, Unzicker, Matthew, Valencia, Amanda, Waters, Mike, Campbell, A Malcolm, Heyer, Laurie J, Poet, Jeffrey L, Eckdahl, Todd T
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2009
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2723075/
https://www.ncbi.nlm.nih.gov/pubmed/19630940
http://dx.doi.org/10.1186/1754-1611-3-11

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2723075/
https://www.ncbi.nlm.nih.gov/pubmed/19630940
http://dx.doi.org/10.1186/1754-1611-3-11

Ejemplares similares