The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences, if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method on the testing of distance calculation algorithms between a pair of DNA’s to restore the partially filled matrix.