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

Discrete Applied Mathematics

Volumn 88, Issue 1-3, 1998, Pages 167-180

  Gusfield, Dan ^a   Karp, Richard ^b   Wang, Lusheng ^c   Stelling, Paul ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Washington   (United States)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d AEROSPACE CORPORATION   (United States)

Author keywords

Approximation algorithms; De Bruijn graphs; DNA sequencing; Euler tours; Graph algorithms; Travelling salesman problem

Indexed keywords

EID: 0001334161     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00071-7     Document Type: Article

References (11)

1. S. Even, Graph Algorithm, Computer Science Press, Mill Valley, CA, 1979.
2. M. Garey, D. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
3. S. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967.
4. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
5. D. Gusfield, R. Karp, L. Wang, P. Stelling, Graph traversals, genes and matroids: an efficient special case of the Travelling Salesman Problem, Proc. 7th Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 1075, Springer, Berlin, 1996, pp. 304-319.
6. D. Gusfield, L. Wang, P. Stelling, Graph traversals, genes and matroids: An efficient special case of the Travelling Salesman Problem, CSE-96-3, Technical report, Department of Computer Science, University of California, Davis, 1996.
7. S. Hannenhalli, W. Fellows, H. Lewis, S. Skiena, P. Pevzner, Positional sequencing by hybridization, Comput. Appl. BioSci. 12 (1996) 19-24.
8. R. Kosaraju, J. Park, C. Stein, Long tours and short superstrings, Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 166-177.
9. P. Pevzner, 1-tuple DNA sequencing: computer analysis, J. Biomol. Struct. Dyn. 7 (1989) 63-73.
10. P.A. Pevzner, DNA physical mapping and alternating eulerian cycles in colored graphs, Algorithmica 12 (1994) 77-105.
11. S. Stein, The mathematician as explorer, Scientific American (May 1961) 149-163.