Euler circuits and DNA sequencing by hybridization

Discrete Applied Mathematics

Volumn 104, Issue 1-3, 2000, Pages 63-96

  Arratia, Richard ^a   Bollobás, Béla ^b   Coppersmith, Don ^c   Sorkin, Gregory B ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of Memphis   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

BEST theorem; Catalan number; Circle graph; Combinatorial enumeration; DNA sequencing; Euler circuit; Euler path; Hybridization; Interlace graph; Matrix tree theorem; Pairing

Indexed keywords

EID: 0347369498     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00190-6     Document Type: Article

References (31)

1. R. Arratia, B. Bollobás, G.B. Sorkin, The interlace polynomial: a new graph polynomial, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 2000.
2. Arratia R., Goldstein L., Gordon L. Two moments suffice for Poisson approximations: the Chen-Stein method. Ann. Probab. 17:1989;9-25.
3. Arratia R., Martin D., Reinert G., Waterman M.S. Poisson process approximation for sequence repeats, and sequencing by hybridization. J. Comput. Biol. 3:1996;425-463.
4. Arratia R., Reinert G. Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization. Hirshberg D., Myers G. Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching. Springer Lecture Notes in Computer Science. Vol. 1075:1996;209-219 Springer.
5. Barbour A.D., Holst L., Janson S. Poisson Approximation. Oxford studies in probability. Vol. 2:1992;Clarendon Press, Oxford.
6. Bogart K.P., Doyle P. Non-sexist solution of the menage problem. Amer. Math. Mon. 93(7):1986;514-518.
7. Bollobás B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin. 1:1980;311-316.
8. Bollobás B. Random Graphs. 1985;Academic Press, London.
9. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184, Springer, New York, 1998.
10. de Bruijn N.G., van Aardenne-Ehrenfest T. Circuits and trees in oriented graphs. Simon Stevin. 28:1951;203-217.
11. Dehn M. Über kombinatorische Topologie. Acta Math. 67:1936;123-168.
12. de Fraysseix H. A characterization of circle graphs. European J. Combin. 5:1984;223-238.
13. Dyer M., Frieze A., Suen S. The probability of unique solutions of sequencing by hybridization. J. Comput. Biol. 1:1994;105-110.
14. Even S., Itai A. Queues, stacks and graphs. Kohavi Z., Paz A. Theory of Machines and Computations. 1971;71-86 Academic Press, New York.
15. Gabor C.P., Supowit K.J., Hsu W.-L. Recognizing circle graphs in polynomial time. J. ACM. 36:1989;435-473.
16. C.F. Gauss, Werke, Vol. 8, Teubner, Stuttgart, 1900, pp. 272, 282-286.
17. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
18. Gusfield D., Karp R., Wang L., Stelling P. Graph traversals, genes and matroids: an efficient case of the travelling salesman problem. Discrete Appl. Math. 88:1998;167-180.
19. E. Hubbell, Multiplex sequencing by hybridization, J. Comput. Biol. (1999) to appear.
20. Kandel D., Matias Y., Unger R., Winkler P. Shuffling biological sequences. Discrete Appl. Math. 71:1996;171-185.
21. Kirchoff G. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72:1847;497-508.
22. Pevzner P. DNA physical mapping and alternating Eulerian circuits in colored graphs. Algorithmica. 13:1995;77-105.
23. Read R.C., Rosenstiehl P. On the Gauss crossing problem. Colloq. Math. Soc. János Bolyai. 18:1976;843-876.
24. Sloane N.J.A., Plouffe S. The Encyclopedia of Integer Sequences. 1995;Academic Press, New York.
25. Smith C.A.B., Tutte W.T. On unicursal paths in a network of degree 4. Amer. Math. Mon. 48:1941;233-237.
26. Spinrad J. Recognition of circle graphs. J. Algorithms. 16:1994;264-282.
27. Sz.-Nagy J.V. Über ein topologisches Problem von Gauss. Math. Zeitschrift. 26:1927;579-592.
28. Tutte W.T. The dissection of equilateral triangles into equilateral triangles. Proc. Cambridge Philos. Soc. 44:1948;463-482.
29. Ukkonen E. Approximate string-matching with q-grams and maximal matches. Theoret. Comput. Sci. 92:1992;191-211.
30. Waterman M.S. Introduction to Computational Biology: Maps, Sequences and Genomes. 1995;Chapman & Hall, London.
31. Wilf H.S. Generatingfunctionology. 2nd Edition:1990;Academic Press, San Diego, CA.