Skip to main content

Population Computation and Majority Inference in Test Tube

  • Conference paper
  • First Online:
Book cover DNA Computing (DNA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2340))

Included in the following conference series:

Abstract

We consider a probabilistic interpretation of the test tube which contains a large amount of DNA strands, and propose a population computation using a number of DNA strands in the test tube and a probabilistic logical inference based on the probabilistic interpretation. Second, in order for the DNA-based learning algorithm [4] to be robust for errors in the data, we implement the weighted majority algorithm [3] on DNA computers, called DNA-based majority algorithm via amplification (DNAMA), which take a strategy of “amplifying” the consistent (correct) DNA strands while the usual weighted majority algorithm decreases the weights of inconsistent ones. We show a theoretical analysis for the mistake bound of the DNA-based majority algorithm via amplification, and imply that the amplification to “double the volumes” of the correct DNA strands in the test tube works well.

This work is supported in part by “Research for the Future” Program No. JSPS-RFTF 96I00101 from the Japan Society for the Promotion of Science.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama. Towards parallel evaluation and learning of Boolean μ-formulas with molecules. In Proc. of Third Annual Meeting on DNA Based Computers, 105–114, 1997.

    Google Scholar 

  2. M. Kearns, H. Sebastian Seung. Learning from a population of hypotheses. Machine Learning, 18, 255–276, 1995.

    MATH  Google Scholar 

  3. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108, 212–261, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. Y. Sakakibara. Solving computational learning problems of Boolean formulae on DNA computers, Proc. 6th International Meeting on DNA Based Computers, 193–204, 2000.

    Google Scholar 

  5. Y. Sakakibara and A. Suyama. Intelligent DNA chips: Logical operation of gene expression profiles on DNA computers, Genome Informatics 2000 (Proceedings of 11th Workshop on Genome Informatics), Universal Academy Press, 33–42, 2000.

    Google Scholar 

  6. Y. Yamamoto, S. Komiya, Y. Sakakibara, and Y. Husimi. Application of 3SR reaction to DNA computer, Seibutu-Buturi, 40(S198), 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakakibara, Y. (2002). Population Computation and Majority Inference in Test Tube. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48017-X_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43775-8

  • Online ISBN: 978-3-540-48017-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics