Prior works formulated the problem of finding the shortest path between the start oligonucleotide probe and the destination one as finding the shortest path in a graph as depicted in Figure 1. The set of vertices are the probes {v1, . . ., vn} with special nodes 0 and n + 1, which are virtual probes. It is required to tile before the start and after the end of the sequence. For an edge (va, vb), with va ≥1, vb ≤ n Where n is the total number of vertices in the graph. The total weight is computed as w(va, vb). The weights w(0, va) and w(va, n+1) are defined as d(0, va). Prior work depends to find the shortest path using Dikstra’s shortest path algorithm (Schliep & Krause, 2007; Dai, 2005). Another algorithm that find the shortest path is A* algorithm. It is an efficient more than Dikstra’s algorithm but its applications appears only in engineering science such as civil engineering, town planning and roads. The next subsections depict the structure and the behavior of these algorithms in details (Dai, 2005).