Skip to main content
Springer Nature Link
Log in

Flexible Word Design and Graph Labeling

  • Conference paper
Algorithms and Computation (ISAAC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4288))

Included in the following conference series:

  • 1193 Accesses

Abstract

Motivated by emerging applications for DNA code word design, we consider a generalization of the code word design problem in which an input graph is given which must be labeled with equal length binary strings of minimal length such that the Hamming distance is small between words of adjacent nodes and large between words of non-adjacent nodes. For general graphs we provide algorithms that bound the word length with respect to either the maximum degree of any vertex or the number of edges in either the input graph or its complement. We further provide multiple types of recursive, deterministic algorithms for trees and forests, and provide an improvement for forests that makes use of randomization.

Supported in part by NSF Grant EIA-0112934.

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.

Similar content being viewed by others

References

  1. Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.-Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM Journal on Computing 34, 1493–1515 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aggarwal, G., Goldwasser, M.H., Kao, M.-Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 880–889 (2004)

    Google Scholar 

  4. Ben-Dor, A., Karp, R., Schwikowski, B., Yakhini, Z.: Universal DNA Tag Systems: A Combinatorial Design Scheme. In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology, pp. 65–75 (2000)

    Google Scholar 

  5. Brenneman, A., Condon, A.E.: Strand Design for Bio-Molecular Computation. Theoretical Computer Science 287(1), 39–58 (2001)

    Article  MathSciNet  Google Scholar 

  6. Brenner, S.: Methods for sorting polynucleotides using oligonucleotide tags, U.S. Patent Number 5,604,097 (February 1997)

    Google Scholar 

  7. Brenner, S., Lerner, R.A.: Encoded combinatorial chemistry. In: Proceedings of the National Academy of Sciences of the U.S.A., vol. 89, June 1992, pp. 5381–5383 (1992)

    Google Scholar 

  8. Breuer, M.: Coding vertexes of a graph. IEEE transactions on Information Theory 8, 148–153 (1966)

    Article  MathSciNet  Google Scholar 

  9. Breuer, M., Folkman, J.: An unexpected result on coding vertices of a graph. Journal of Mathematical Analysis and Applications 20, 583–600 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  10. Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A., Franceschetti, D.R., Stevens, J.S.E.: Genetic search of reliable encodings for DNA-based computation. In: Proceedings of the 2nd International Meeting on DNA Based Computers (1996)

    Google Scholar 

  11. Frutos, A.G., Liu, Q., Thiel, A.J., Sanner, A.M.W., Condon, A.E., Smith, L.M., Corn, R.M.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Research 25(23), 4748–4757 (1997)

    Article  Google Scholar 

  12. Gaborit, P., King, O.D.: Linear constructions for DNA codes. Theoretical Computer Science 334, 99–113 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Garzon, M., Deaton, R., Neathery, P., Franceschetti, D.R., Murphy, R.C.: A new metric for DNA computing. In: Proceedings of the 2nd Genetic Programming Conference, pp. 472–478. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  14. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Technical Report RR-1261-01, Laboratoire Bordelais de Recherce en Informatique (2001)

    Google Scholar 

  15. Kao, M.Y., Sanghi, M., Schweller, R.: Randomized fast design of short DNA words. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1275–1286. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. King, O.D.: Bounds for DNA Codes with Constant GC-content. Electronic Journal of Combinatorics 10(1), #R33, 13 (2003)

    Google Scholar 

  17. Marathe, A., Condon, A., Corn, R.M.: On Combinatorial DNA Word Design. Journal of Computational Biology 8(3), 201–219 (2001)

    Article  Google Scholar 

  18. Shoemaker, D.D., Lashkari, D.A., Morris, D., Mittman, M., Davis, R.W.: Quantitative phenotypic analysis of yeast deletion mutants using a highly parallel molecular bar-coding strategy. Nature Genetics 14(4), 450–456 (1996)

    Article  Google Scholar 

  19. Tsaftaris, S.A.: DNA Computing from a Signal Processing Viewpoint. IEEE Signal Processing Magazine 21, 100–106 (2004)

    Article  Google Scholar 

  20. Tsaftaris, S.A.: How can DNA-Computing be Applied in Digital Signal Processing? IEEE Signal Processing Magazine 21, 57–61 (2004)

    Article  Google Scholar 

  21. Tulpan, D.C., Hoos, H.H.: Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol. 2671, pp. 418–433. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. van Lint, J.: Introduction to Coding Theory, 3rd edn. Springer, Heidelberg (1998)

    Google Scholar 

  23. Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao, Manan Sanghi & Robert Schweller

Authors
  1. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manan Sanghi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Schweller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Japan

    Tetsuo Asano

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kao, MY., Sanghi, M., Schweller, R. (2006). Flexible Word Design and Graph Labeling. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_7

Download citation

  • DOI: https://doi.org/10.1007/11940128_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49694-6

  • Online ISBN: 978-3-540-49696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics