Given a set of all pairwise distances between points on a line. The Turnpike problem is to reconstruct the positions of those
points. We reduce the running time to generate a set of solution for the turnpike problem by designing a parallel algorithm on a
multicore system in case of the worst case. The algorithm is based on dividing the original problem into many independent subproblems
of balanced size. The experimental study shows that our parallel algorithm significantly reduces the running time of
the best practical sequential algorithm. Also, the scalability of the proposed algorithm is linear. Finally, we apply the proposed
algorithm on restriction site mapping of DNA.