OnlineWoerterBuecher.de
Internes

Lexikon


DNA computing


The use of DNA molecules to encode computational problems. Standard operations of molecular biology can then be used to solve some NP-hard {search problems} in parallel using a very large number of molecules. The exponential scaling of NP-hard problems still remains, so this method will require a huge amount of DNA to solve large problems. [L. M. Adleman, "Molecular Computation of Solutions to Combinatorial Problems", Science 266:1021-1024, 1994]. (1997-02-11)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ architecture ] [ arg ] [ at ] [ b ] [ be ] [ bi ] [ C ] [ ca ] [ ch ] [ ci ] [ co ] [ code ] [ com ] [ cu ] [ D ] [ de ] [ du ] [ ec ] [ ed ] [ encode ] [ er ] [ era ] [ es ] [ et ] [ exponent ] [ exponential ] [ fi ] [ file ] [ ge ] [ gy ] [ h ] [ hit ] [ hr ] [ hu ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ Lex ] [ li ] [ lu ] [ lv ] [ M ] [ ma ] [ man ] [ method ] [ mo ] [ mod ] [ module ] [ mount ] [ mp ] [ ms ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ NP ] [ NP-hard ] [ ns ] [ nu ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ sc ] [ se ] [ search problem ] [ si ] [ so ] [ st ] [ T ] [ th ] [ to ] [ ug ] [ um ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3173 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1949 Seconds, with 17 Database-Queries
Zurück zur Startseite