Skip to main content
SpringerLink
Log in

Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1075))

Included in the following conference series:

Abstract

In this paper we consider graph traversal problems 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 a bounded-error approximation algorithm 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.

Partially supported by Department of Energy grant DE-FG03-90ER60999.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Even. Graph Algorithms. Computer Science Press, Mill Valley, CA., 1979.

    Google Scholar 

  2. M. Garey and D. Johnson. Computers and intractability. Freeman, San Francisco, 1979.

    Google Scholar 

  3. S. Golomb. Shift register sequences. Holden-Day, San Francisco, 1967.

    Google Scholar 

  4. D. Gusfield, L. Wang, and P. Stelling. Graph traversals, genes and matroids: An efficient special case of the travelling salesman problem. Technical Report 96-3, Department of Computer Science, University of California, Davis, January 1996.

    Google Scholar 

  5. R. Kosaraju, J. Park, and C. Stein. Long tours and short superstrings. In Proceedings of the 35'th Annual Symposium on Foundations of Computer Science, pages 166–177, 1994.

    Google Scholar 

  6. P. Pevzner. L-tuple dna sequencing: Computer analysis. Journal of Biomolecular structure and dynamics, 7:63–73, 1989.

    PubMed  Google Scholar 

  7. P. A. Pevzner. Dna physical mapping and alternating eulerian cycles in colored graphs. Algorithmica, 12:77–105, 1994.

    Google Scholar 

  8. S. Stein. The mathematician as explorer. Scientific American, pages 149–63, May 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, 95616, Davis, CA

    Dan Gusfield, Lusheng Wang & Paul Stelling

  2. Department of Computer Science and Engineering, University of Washington, 98195, Seattle, WA

    Richard Karp

Authors
  1. Dan Gusfield
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Karp
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paul Stelling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dan Hirschberg Gene Myers

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gusfield, D., Karp, R., Wang, L., Stelling, P. (1996). Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem. In: Hirschberg, D., Myers, G. (eds) Combinatorial Pattern Matching. CPM 1996. Lecture Notes in Computer Science, vol 1075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61258-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-61258-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61258-2

  • Online ISBN: 978-3-540-68390-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation