Abstract: In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of nonsilicon based computings. In this paper, we consider three procedures for computing the maximum of ò
ProceduresforComputingtheMaximumwithDNAStrands
SatoshiKamio,AkikoTakehara,AkihiroFujiwara
DepartmentofComputerScienceandElectronics
KyushuInstituteofTechnology
680-4Kawazu,Iizuka,Fukuoka820-8502,JAPAN
E-mail:satoshi@zodiac30.cse.kyutech.ac.jp,fujiwara@cse.kyutech.ac.jp
Abstract:Inrecentworksforhighperformancecom-puting,computationwithDNAmolecules,thatis,DNAcomputing,hasconsiderableattentionasoneofnon-siliconbasedcomputings.Inthispaper,weconsiderthreeproceduresforcomputingthemaximumofbi-narynumbersmaximumDNAofthestrands.ofbits,binaryThewhichnumbers rstprocedurearerepresentedwith
incomputesstepsthe
dureskindsalsocomputeofDNAstrands.themaximumThesecondinandthirdandproce-using
stepsusingandrespectively.
kindsofDNAstrands,Keywords:DNAcomputing,primitiveoperations,themaximum
1Introduction
Inrecentworksforhighperformancecomputing,computationwithDNAmolecules,thatis,DNAcomputing,hasconsiderableattentionasoneofnon-siliconbasedcomputing.TheDNAhastwoimportantfeatures,whichareWatson-Crickcom-plementarityandmassiveparallelism.Usingthefeatures,wecansolveanNP-completeproblem,whichusuallyneedsexponentialtimeonasiliconbasedcomputer,inapolynomialnumberofstepswithDNAmolecules.Asthe rstworkforDNAcomputing,AdlemanpresentedanideaofsolvingtheHamiltonianpathproblemofsizein
stepsusingDNAmolecules.TheseareanumberofotherHowever,-completeworkswithproceduresproblems[2,DNAmoleculesfor3,primitive11,for13,combinatorial
20].
operations,suchaslogicorarithmeticoperations,areneededtoapplyDNAcomputingonawiderangeofprob-lems.AnumberofprocedureshavebeenproposedfortheprimitiveoperationswithDNAmolecules[5,7,8,9,10,15].Guarnierietal.[8]hasproposedthe rstprocedureforadditionusingDNAmolecules.
Theprocedureworksin
stepsusingdif-ferentDNAstrandsforanadditionoftwo-bitbi-narynumbers.Hugetal.[10]hasproposedapro-cedureforlogicoperationsandadditiononDNA
chip.bitbinarydifferentTheprocedurenumbers.DNAstrandsworksinstepsusing
Recently,foranFujiwaraoperationetal.[7]of-haveproposedaddressableproceduresfortheprim-itiveoperations.They rstshowedaDNArep-resentationofbinarynumbersof
bits.Next,theyproposedaprocedurewhichcomputesdiffer-entkindsoflogicoperationssimultaneouslyforanypairofbinarynumbersofbits.Theprocedure
worksin
stepsusingkindsofDNAstrands.Theyalsoproposedaprocedureforaddi-tionsofpairsoftwobinarynumbers.Theproce-dureworksin
stepsusingdifferentkindsofDNAstrandsforadditionsof
pairsoftwobinarynumbers.
Inthispaper,weconsiderthreeproceduresforcomputingthemaximumusingDNAstrands.Weassumethataninputoftheoperationisasetofbi-narynumbersputestheDNAofmaximumstrands.bits,whichoftheThearerepresentedwith
binary rstnumbersprocedureincom-stepsusingkindsofDNAstrands.Thepro-cedureconsistsofarepetitionofcheckingonbitpositions.Thesecondprocedurecomputesthe
maximumin
stepsusingkindsofDNAstrands.Thealgorithmconsistsofarepeti-tionofparallelcomparisonsoftwonumbers.Thetechniqueisknownasabalancedbinarytree[4],whichisusedonparallelalgorithms.Thethirdpro-cedurecomputesing
mainlyconsistskindstheof
ofmaximumDNAstrands.in
stepsus-isinspiredfromaparallelparallelalgorithmcomparisons,Theprocedureforcomputingandthemaximuminaconstanttime[18].
2Preliminaries
2.1Computationalputing
modelforDNAcom-AnumberoftheoreticalorpracticalcomputationalmodelshavebeenproposedforDNAcomputing[2,
暂无评价 24页 免费 Procedures for computing... 暂无评价 7页 免费喜欢此... Adleman solved the Hamiltonian path problem (HPP) with DNA strands ...
Rauhe, Cryptography with DNA binary strands隐藏>>...Keywords: DNA computing; Cryptography; Steganography...H(d, L)? be the maximum number of misprimings...
molecular procedures used for computation, classes of problems that can be solved by DNA computing, and the feasibility and advantages of a DNA computer....
DNA molecules required for computing restricts the ... maximum-minimum operator and inversion operator, ...is mapped into the length of double DNA strands...
the code names above, L and H refer to light and heavy DNA strands, ...Experimental Procedures DNA resuspended in 75 to 150 ?l (dependent upon the...
The Wet and Wild Future of Computers- DNA Strands Mav Replace Chips and...Previous experiments with DNA computing had allowed the DNA to float freely ...
Beta promotes denaturation of complementary strands,...conjugation, no need for transformation procedures ...Efficiency of ssOR is maximum with oligos ~ 120...
Keywords: DNA Computing; Taboo Search Algorithm; ... a genetic algorithm for generating DNA strands. ...[15], and maximum independent set[16][17][18...
Here, building on the richness of DNA computing...Coloured lines represent DNA strands at the domain...the maximum completion level (Supplementary Fig. 3...
in the procedures for computing the quantum Fourier transform and its inverse...the Watson-Crick complementarity of the building blocks forming DNA strands, ...
热门文档