Skip to main content
SpringerLink
Log in

Research on the Counting Problem Based on Linear Constructions for DNA Coding

  • Conference paper
Computational Intelligence and Bioinformatics (ICIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4115))

Included in the following conference series:

Abstract

This article advances linear coding construction method for DNA codes based on three-letter alphabets. Further more it also advances the new conception of Constrain Strength and algorithm of Construction and Search. We use the former to evaluate the coding amount of combinatorial constraints and use the latter to validate the evaluated results. Experiments show that experiment result accords with the theoretically evaluated value very well.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.: Molecular Computation of Solution to Combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. Garzon, M., et al.: A New Metric for DNA Computing. In: Proc. of the 2nd Annual Genetic Programming Conference, pp. 472–487 (1997)

    Google Scholar 

  3. Baum, E.B.: DNA Sequences Useful for Computation. In: Proc. of 2nd DIMACS Workshop on DNA Based Computers (1996)

    Google Scholar 

  4. Feldkamp, et al.: A DNA Sequence Compile. In: Proc. of 6th DIMACS Workshop on DNA Based Computers (2000)

    Google Scholar 

  5. Suyama, B., et al.: DNA Chips- Intergrated Chemical Circuits for DNA Diagnosis and DNA computers. In: Proc. 3rd International Micromachine Symp., pp. 7–12 (1997)

    Google Scholar 

  6. Frutos, B.G., et al.: Demonstration of a Word Design Strategy for DNA Computing on Surface. Nucleic Acids Research 25, 4748–4757 (1997)

    Article  Google Scholar 

  7. Arita, M., et al.: The Power of Sequence Desire in DNA Computing. In: 4th International Conference on Computational Intelligence and Multimedia Applications (2001)

    Google Scholar 

  8. Arita, M., et al.: DNA Sequence Design Using Template. New Generation Comput. 20(3), 263–277 (2002)

    Article  MATH  Google Scholar 

  9. Wenbin, L., et al.: DNA Sequence Design Based on Template Strategy. J. Chem. Inf. Comput. Sci. 43, 2014–2018 (2003)

    Google Scholar 

  10. Braich, R.S., et al.: Solution of a Satisfiability Problem on a Gel-Based DNA Computer. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 27–42. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Deaton, R., et al.: Genetic Search of Reliable Encodings for DNA-Based Computation. In: 1st Genetic Programming Conference (1996)

    Google Scholar 

  12. Deaton, R., et al.: Good encodings for DNA-based Solutions to Combinatorial Problems. In: Proc. of 2nd DIMACS Workshop on DNA Based Computers (1996)

    Google Scholar 

  13. Marathe, B., et al.: On Combinatorial DNA Word Design. J. Comput. Biol. 8, 201–220 (2001)

    Article  Google Scholar 

  14. MacWilliams, F.J., et al.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  15. SantaLucia, J., et al.: Improved Nearest-Neighbor Parameters for Predicting DNA Duplex Stability. Biochemistry 35, 3555–3562 (1996)

    Article  Google Scholar 

  16. Zhu, X., wenbing, L., Chuan, S.: Research on the DNA Words and Algorithm. Acta Electronica Sinica (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, Wenzhou University, Wenzhou, Zhejiang, 325027, China

    Xiangou Zhu, Wenbing Liu & Wenguo Wu

  2. Dept. of Mechanic and electronic Engineering, HuangShi Institute of Technology, Huangshi, Hubei, 435003, China

    Chuan Sun

Authors
  1. Xiangou Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chuan Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenbing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenguo Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui, China

    De-Shuang Huang

  2. Queen’s University, Belfast, UK

    Kang Li  & George William Irwin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, X., Sun, C., Liu, W., Wu, W. (2006). Research on the Counting Problem Based on Linear Constructions for DNA Coding. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_32

Download citation

  • DOI: https://doi.org/10.1007/11816102_32

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation