Abstract
Purchase PDF (993 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (1002 K)
doi:10.1016/S0166-218X(98)00071-7 
Copyright © 1998 Published by Elsevier Science B.V.
Graph traversals, genes and matroids: An efficient case of the travelling salesman problem*1
Received 15 September 1996;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper we consider graph traversal problems (Euler and Travelling Salesman traversals) that arise from a particular technology for DNA sequencing - sequencing by hybridization (SBH). We first explain the connection of the graph problems to SBH and then focus on the traversal problems. We describe a practical polynomial time solution to the Travelling Salesman Problem in a rich class of directed graphs (including edge weighted binary de Bruijn graphs), and provide bounded-error approximation algorithms for the maximum weight TSP in a superset of those directed graphs. We also establish the existence of a matroid structure defined on the set of Euler and Hamilton paths in the restricted class of graphs.
Author Keywords: Travelling salesman problem; Euler tours; DNA sequencing; De Bruijn graphs; Approximation algorithms; Graph algorithms
