One such representation is designed to solve the Hamiltonian path problem, or in fact the 'travelling salesman' problem.

Solving a Hamiltonian Path Problem with a bacterial computer. Journal of Biological Engineering, (in press) [abstract] Haynes et al. Engineering bacteria to solve the Burnt Pancake Problem.

Given a graph whose arc traversal times vary over time, the time-dependent travelling salesman problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of ...

This variant is called the Hamiltonian path problem, and it belongs to a class of problems widely believed to be computationally intractable.

In theory, if molecules involved in the reaction arranged themselves along the Hamiltonian path of such a quasicrystal, they could attach to the surface with maximum efficiency.