Population Computation and Majority Inference in Test Tube

Authors:
Yasubumi Sakakibara
Affiliations:
-
Venue:
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Year:
2001

Citing 3
Cited 2

The weighted majority algorithm

Information and Computation
Learning from a Population of Hypotheses

Machine Learning - Special issue on COLT '93
Solving Computational Learning Problems of Boolean Formulae on DNA Computers

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing

Molecular computing paradigm – toward freedom from Turing's charm

Natural Computing: an international journal
An interface for a computing model using methylation to allow precise population control by quantitative monitoring

DNA13'07 Proceedings of the 13th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

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.