Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Population Computation and Majority Inference in Test Tube
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2340/2002 |
| Book | DNA Computing |
| DOI | 10.1007/3-540-48017-X |
| Copyright | 2002 |
| ISBN | 978-3-540-43775-8 |
| DOI | 10.1007/3-540-48017-X_8 |
| Pages | 82-91 |
| Subject Collection | Computer Science |
| SpringerLink Date | Tuesday, January 01, 2002 |
| |
|
Population Computation and Majority Inference in Test Tube
Yasubumi Sakakibara6 
| (6) |
Department of Information Sciences, Tokyo Denki University, Hiki-gun, Saitama 350-0394, Japan |
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.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|