Probabilistic logical inference using quantities of DNA strands

Research output: Contribution to conferencePaper

Abstract

We overview a series of our research on DNA-based supervised learning of Boolean formulae and its application to gene expression analyses. In our previous work, we have presented methods for encoding and evaluating Boolean formulae on DNA strands and supervised learning of Boolean formulae on DNA computers which is known as NP-hard problem in computational learning theory [Kearns and Vazirani 94]. We have also applied those methods to executing logical operations of gene expression profiles in test tube [Sakakibara and Suyama 00]. These proposed methods are discrete (qualitative) algorithms and do not deal with quantitative analysis and are not robust for noise and errors. Recently, we have proposed several methods to execute quantitative inferences using large quantities of DNA strands in test tube and extend the previous algorithms to robust ones for noise and errors in the data. These methods include probabilistic inference and randomized prediction, and weighted majority prediction and learning by am plification in the test tube based on the weighted majority algorithm [Littlestone and Warmuth 94].

Original languageEnglish
Pages797-804
Number of pages8
Publication statusPublished - 2001 Jan 1
Externally publishedYes
EventCongress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
Duration: 2001 May 272001 May 30

Other

OtherCongress on Evolutionary Computation 2001
CountryKorea, Republic of
CitySeoul
Period01/5/2701/5/30

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Probabilistic logical inference using quantities of DNA strands'. Together they form a unique fingerprint.

  • Cite this

    Sakakibara, Y. (2001). Probabilistic logical inference using quantities of DNA strands. 797-804. Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.