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

  • Xiangou Zhu
  • Chuan Sun
  • Wenbing Liu
  • Wenguo Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4115)


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.


Linear Code Random Algorithm Counting Problem Fundamental Space Combinatorial Constraint 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.: Molecular Computation of Solution to Combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 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. 3.
    Baum, E.B.: DNA Sequences Useful for Computation. In: Proc. of 2nd DIMACS Workshop on DNA Based Computers (1996)Google Scholar
  4. 4.
    Feldkamp, et al.: A DNA Sequence Compile. In: Proc. of 6th DIMACS Workshop on DNA Based Computers (2000)Google Scholar
  5. 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. 6.
    Frutos, B.G., et al.: Demonstration of a Word Design Strategy for DNA Computing on Surface. Nucleic Acids Research 25, 4748–4757 (1997)CrossRefGoogle Scholar
  7. 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. 8.
    Arita, M., et al.: DNA Sequence Design Using Template. New Generation Comput. 20(3), 263–277 (2002)MATHCrossRefGoogle Scholar
  9. 9.
    Wenbin, L., et al.: DNA Sequence Design Based on Template Strategy. J. Chem. Inf. Comput. Sci. 43, 2014–2018 (2003)Google Scholar
  10. 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)CrossRefGoogle Scholar
  11. 11.
    Deaton, R., et al.: Genetic Search of Reliable Encodings for DNA-Based Computation. In: 1st Genetic Programming Conference (1996)Google Scholar
  12. 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. 13.
    Marathe, B., et al.: On Combinatorial DNA Word Design. J. Comput. Biol. 8, 201–220 (2001)CrossRefGoogle Scholar
  14. 14.
    MacWilliams, F.J., et al.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)MATHGoogle Scholar
  15. 15.
    SantaLucia, J., et al.: Improved Nearest-Neighbor Parameters for Predicting DNA Duplex Stability. Biochemistry 35, 3555–3562 (1996)CrossRefGoogle Scholar
  16. 16.
    Zhu, X., wenbing, L., Chuan, S.: Research on the DNA Words and Algorithm. Acta Electronica Sinica (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiangou Zhu
    • 1
  • Chuan Sun
    • 2
  • Wenbing Liu
    • 1
  • Wenguo Wu
    • 1
  1. 1.College of Computer Science and EngineeringWenzhou UniversityWenzhouChina
  2. 2.Dept. of Mechanic and electronic EngineeringHuangShi Institute of TechnologyHuangshiChina

Personalised recommendations