Constructing orthogonal de Bruijn sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6844 LNCS, Issue , 2011, Pages 595-606

  Lin, Yaw Ling ^a   Ward, Charles ^b   Jain, Bharat ^b   Skiena, Steven ^b  

^a PROVIDENCE UNIVERSITY   (Taiwan)

^b Stony Brook University   (United States)

Author keywords

de Bruijn graphs; de Bruijn sequences; DNA synthesis; Eulerian cycles; orthogonal sequences

Indexed keywords

DE BRUIJN GRAPHS; DEBRUIJN SEQUENCES; DNA SYNTHESIS; EULERIAN CYCLES; ORTHOGONAL SEQUENCES; DNA SYNTHESISS;

ALGORITHMS; DATA STRUCTURES;

DATA STRUCTURES; DNA SEQUENCES;

EID: 80052130066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_50     Document Type: Conference Paper

References (23)

1. Bermond, J.-C.: Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math. 3, 21-28 (1978); Présentéau Cambridge Combinatorial Conf., Advances in Graph Theory, Trinity College, Cambridge, England (1977)
2. Bermond, J.-C., Darrot, E., Delmas, O., Perennes, S.: Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics 84(1), 21-42 (1998)
3. Bond, J., Iványi, A.: Modelling of interconnection networks using de bruijn graphs. In: Iványi, A. (ed.) Third Conference of Program Designer, Budapest (1987)
4. Bugl, H., Danner, J.P., Molinari, R.J., Mulligan, J.T., Park, H.-O., Reichert, B., Roth, D.A., Wagner, R., Budowle, B., Scripp, R.M., Smith, J.A.L., Steele, S.J., Church, G., Endy, D.: DNA synthesis and biological security. Nature Biotechnology 25, 627-629 (2007)
5. Coleman, J.R., Papamichial, D., Futcher, B., Skiena, S., Mueller, S., Wimmer, E.: Virus attenuation by genome-scale changes in codon-pair bias. Science 320, 1784-1787 (2008)
6. Czar, M.J., Anderson, J.C., Bader, J.S., Peccoud, J.: Gene synthesis demystified. Trends in Biotechnology 27(2), 63-72 (2009)
7. de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758-764 (1946)
8. Gibson, D., et al.: Creation of a bacterial cell controlled by a chemically synthesized genome. Science (2010), doi:10.1125./science.1190719
9. Fleischner, H., Jackson, B.: Compatible euler tours in eulerian digraphs. In: Cycles and Rays, Proceeding Colloquium Montreal, 1987. ATO ASI Ser. C, pp. 95-100. Kluwer Academic Publishers, Dordrecht (1990)
10. Golomb, S.W.: Shift Register Sequences. Holden-Day (1967)
11. Good, I.J.: Normal recurring decimals. J. London Math. Soc. 21, 167-172 (1946)
12. Kása, Z.: On arc-disjoint hamiltonian cycles in de Bruijn graphs. CoRR abs/1003.1520 (2010)
13. Kautz, W.H.: Bounds on directed (d,k) graphs. In: Theory of Cellular Logic Networks and Machines, AFCKL-68-0668 Final Rep., vol. 24, pp. 20-28 (1968)
14. Knuth, D.E.: Oriented subtrees of an arc digraph. Journal of Combinatorial Theory 3, 309-314 (1967)
15. Montes, P., Memelli, H., Ward, C., Kim, J., Mitchell, J., Skiena, S.: Optimizing restriction site placement for synthetic genomes. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 323-337. Springer, Heidelberg (2010)
16. Mueller, S., Coleman, R., Papamichail, D., Ward, C., Nimnual, A., Futcher, B., Skiena, S., Wimmer, E.: Live attenuated influenza vaccines by computer-aided rational design. Nature Biotechnology 28 (2010)
17. Ronse, C.: Feedback Shift Registers. Springer, Berlin (1984)
18. Rosenfeld, V.R.: Enumerating Kautz sequences. Kragujevac Journal of Mathematics 24, 19-41 (2002)
19. Rowley, R., Bose, B.: Edge-disjoint Hamiltonian cycles in de Bruijn networks. In: Distributed Memory Computing Conference, pp. 707-709 (1991)
20. Rowley, R., Bose, B.: On the number of arc-disjoint Hamiltonian circuits in the de Bruijn graph. Parallel Processing Letters 3(4), 375-380 (1993)
21. Tutte,W.T.: The dissection of equilateral triangles into equilateral triangles. Mathematical Proceedings of the Cambridge Philosophical Society 44, 463-482 (1948)
22. Van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin: Wisen Natuurkundig Tijdschrift 28, 203-217 (1951)
23. West, D.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)