Describir: Ordering of high-density markers by the k-optimal algorithm for the traveling-salesman problem