WO1998047077A1 - Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen - Google Patents
Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen Download PDFInfo
- Publication number
- WO1998047077A1 WO1998047077A1 PCT/EP1998/002208 EP9802208W WO9847077A1 WO 1998047077 A1 WO1998047077 A1 WO 1998047077A1 EP 9802208 W EP9802208 W EP 9802208W WO 9847077 A1 WO9847077 A1 WO 9847077A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- dna
- sequence
- reduction
- computer
- molecule
- Prior art date
Links
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B82—NANOTECHNOLOGY
- B82Y—SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES
- B82Y10/00—Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/123—DNA computing
Definitions
- the invention relates to a freely programmable, universal parallel computer system for carrying out general calculations, a DNS or DNA computer being used in addition to an electronic computer.
- a biopolymer is a structure polymerizable from monomers by defined methods.
- the methods defined are, for example, enzymatic polymerization of nucleotides, peptides or sugar units.
- the biopolymer subsystem provided according to the invention can therefore in particular be a DNA, RNA or PNA subsystem. Processing in the biopolymer subsystem can take place at the peptide or nucleotide level.
- a freely programmable, universal parallel computer system for carrying out general calculations, which is provided with: an electronic front-end computer which allows the input of any programs which are therefore capable of specifying general calculations and which are implemented in terms of a reduction language and which is coded into a DNA sequence, a synthesis device which receives the encoded DNA sequence from the front-end computer and which synthesizes the DNA sequence into a corresponding DNA molecule with a specified nucleotide sequence, a promise 1 Not necessary to replicate the synthesized DNA molecule by means of an amplification reaction, a reaction device for simultaneously carrying out transformations of the DNA molecules by means of molecular biological techniques in accordance with the reduction rules of a reduction language, the resultant molecule being in the solution is identified, extracted and possibly reproduced, and - a sequencing device for determining the sequence of the result molecule, this sequence being passed on to the upstream computer and the upstream computer decoding the sequence and outputting the decoded sequence.
- the freely programmable, universal parallel computer system is a combination of an electronic front-end computer and a DNS subsystem.
- the electronic computer permits the input of any programs that are capable of specifying general calculations, and works on the basis of a functional programming language, that is, on the basis of a reduction language.
- a "reduction language” is understood to mean, in particular, a functional programming language, the semantics of which are defined by meaningful transformations of the programs. LISP, Miranda and ML are examples of such functional languages. In this context, reference is also made to the literature reference [35].
- An implementation of a reduction language in conventional hardware is described for example in DE-C-25 06 454 and DE-C-25 25 795.
- the program is thus implemented in terms of a reduction language, and the coding thereof is carried out in a DNA sequence. Since reduction languages are string-oriented, they can advantageously be converted into a DNA sequence.
- the encoded DNS sequence is now the input signal for the DNA subsystem, which consists of a synthesis device, a duplication device, a reaction device and a sequencing device.
- the encoded DNA sequence is synthesized into a corresponding DNA molecule and duplicated.
- the amplification reaction such as PCR or LCR, is used for the amplification.
- the copied DNA molecules are transformed by means of molecular biological techniques, such as in particular the insert, delete and substitute operations.
- the transformation again made use of a reduction language; the transformation therefore takes place in accordance with the reduction rules of this reduction language.
- the result molecule is in the solution consisting of the transformed DNA molecules.
- the fact that the result molecule is present can be recognized from the fact that the execution of further molecular biological processes does not bring about any changes in the molecules, that is to say the molecules can no longer be cloned.
- the reduction rules of the reduction language are thus carried out, as far as the DNA subsystem is concerned, by the biotechnological process in the reaction device.
- the advantage is that the transformation of the molecules can be carried out massively in parallel, since the transformations can be carried out simultaneously on a large number of DNA molecules.
- the result molecule or, in general terms, a molecule in the solution can also be identified, extracted and, if necessary, reproduced using molecular biological techniques. If it is found that reduction operations can still be applied to the result molecule, the result molecule can be fed to the reaction device again after synthesis and duplication in order to carry out further reduction steps.
- Each resultant molecule extracted from the reaction device is fed to a sequencing device which determines the sequence of the resultant molecule.
- This sequence is passed on to the upstream computer, which decodes the sequence and displays or outputs the result of the decoding.
- the ⁇ calculus is particularly suitable as a reduction language (see literature reference [2]). To particular This reduction language, but also in general to reduction languages, is explained further below under "The structure of a DNS computer”. The advantage of the ⁇ calculus is its extraordinary suitability for parallel processing. In principle, however, the invention can be used for all reduction languages.
- the freely programmable, universal computer system according to the invention for carrying out general calculations is characterized in particular in that the calculations are carried out by molecular-biological transformation of DNA molecules, in that the calculations are carried out using combinator expressions of a reduction language (e.g.
- the ⁇ calculus specified, coded by appropriate nucleotide sequences and realized by a DNA molecule determined in such a way that the calculations are carried out by special transformations of the DNA molecules by means of molecular biological techniques in accordance with the reduction rules of the underlying calculus, that the order of the elementary operations (reductions) is not, or is determined only by the causal data dependencies of the program, whereby the Church-Rosser property guarantees that the end result is clear, regardless of the specific order of execution, that the organization of the calculations du
- the causal data dependencies are regulated, - that the independent execution of basic operations on several DNA molecules or several sections of the same DNA molecule can be carried out without explicit time synchronization, that the properties described above allow the efficient use of the large number of DNA molecules in one
- the computer system consists of a conventional electronic front-end computer, a "gene machine”, a DNS computer as described above and a sequencing device, the front-end computer providing a programming environment which allows the input of any and thus
- a realization of the DNA computer system as described above provides in particular that the reduction language expressions are converted into closed ⁇ expressions, so-called super combiners, - that specific incarnations of these super combiner expressions are generated by a special PCR / LCR procedure, so that the variables of the individual super combinator incarnations are clearly numbered and thus clearly identifiable, - that super combinator reductions are carried out by molecular biological techniques on the incarnations thus generated, as long as reductions are still possible, the program application also being clearly marked so that after interaction with the super combiners and the result of the specified transformation, the result can be clearly identified and extracted.
- biopolymers in particular DNA molecules
- DNA deoxyribonucleic acid
- DNA deoxyribonucleic acid
- DNA molecules has recently been proposed for solving combinatorial problems, including so-called NP-severe problems (DNA computing [1,3,20] and WO-A-97/07440).
- NP-severe problems DNA computing [1,3,20] and WO-A-97/07440.
- the enormous number of molecules is used to simultaneously try out all the coding of possible solutions using a few biotechnological operations.
- the approach has the potential to push the boundaries of conventional computers by several orders of magnitude in this regard.
- this approach is too simple to carry out general, arbitrary calculations and, in addition, the potential of the large number of DNA molecules in relatively small volumes is increased by the exponential growth of the operations required in such a simple one
- FIG. 1 shows a schematic illustration as a block diagram of a functional DNS computer
- Fig. 2 is a graphical representation of the basic operations used in the DNA subsystem of the DNA calculator (molecular biological techniques).
- the DNS technology is used for universal calculations based on the ⁇ calculus. This fully exploits the strengths of DNS technology, namely a high degree of parallelism without the need for communication.
- the functional calculation model can be implemented for the first time by an implementation corresponding to the model and can be provided with appropriate processor numbers.
- the invention is therefore a hybrid system consisting of upstream electronics and DNS technology, which represents a universal functional computer. Many years of experience exist both in the area of the conceptual foundations of the ⁇ calculus and the reduction systems and in relation to the implementation of such systems using special hardware - so-called reduction machines - [6,7,16] and as an emulator / simulator on conventional ones Computers [17,34,35].
- a programming system for program specification using mathematical function equations [22,23,24,32,33,35] is also available. Since the program execution is based on the meaning-preserving transformation of expressions, every intermediate step of calculations can be completely translated back into an expression of the programming language and thus analyzed by the user.
- the DNS computer is constructed as in Fig. 1.
- a pre- or host computer (left) of conventional technology specifies and organizes the functional calculation. If necessary, he carries out analyzes regarding the required resources in terms of DNS volume and time.
- the DNA component (right) consists of an apparatus that synthesizes DNA segments as specified, a reaction apparatus and an apparatus that analyzes (reads out) the reaction result. The latter device has a connection back to the host computer. The following things are particularly advantageous for the DNS computer:
- the functional program can be specified in a high functional programming language [31,25,27].
- the existing development system can be used as a programming system and interface to the DNS computer system. Programs can be developed, tested through step-by-step execution, and interactively validated on small problem instances [22, 23, 27, 35], before finally being passed on to the DNS subsystem for complex production runs.
- the interfaces of the host system to standard operating systems enable the use of the DNS component as a "computer server" for conventional program systems.
- the upstream computer first compiles the functional program.
- transliteration means the calculation of the appropriate coding of program parts in DNS strings and the generation of the instructions for the DNA synthesis apparatus.
- the DNS
- Synthesis equipment generates the strings according to the specifications of the host computer.
- the boundary conditions for the reaction could also be calculated by the host computer.
- Control information can also be generated here as part of the compilation in the host computer.
- the output information is returned to the front-end computer and decoded (de-translation).
- IT and molecular biological aspects are closely interlinked.
- DNS coding for functional programs is required and must be adapted to the compilation [35].
- models should be developed which allow the molecular biological reactions in the DNA to be analyzed, because the quality of DNA coding can only be estimated on the basis of knowledge of what actually happens in the DNA solution.
- FIG. 2 A realization of this basic operation by means of DNS operations is shown graphically in FIG. 2:
- a normal form of a program expression (encoded as a DNS string) is a meaning-equivalent expression (also a DNS string) that no longer contains an applicable reduction.
- a functional program specification is reduced to its importance (the program result).
- This program result must be identified, selected for return to the host and translated back.
- the mechanisms for the clear back-translation (transliteration) [24,35] of reduction language expressions in abstract machine code for conventional computing architectures have been developed and tested in the above-mentioned reduction machine projects.
- a targeted duplication of the argument, the finding of variables in the body of the function by matching and the orderly replacement of the variables by the argument expression must be implemented.
- ⁇ calculus using DNA and in particular the use of the specific properties of the ⁇ calculus for a massively parallel, asynchronously working and decentrally organized computing system through a combined electronic / biological machinery and basic biotechnological operations to implement the massively parallel steps.
- the proposed biological subsystem of storing the information (program and data) as strings in DNA molecules and their concurrent processing by operations on a myriad of independent sequences / molecules contained in a buffer solution in a reactor prohibits the assumption of a central control body or detailed control of the individual calculation steps.
- a calculation concept of self-organization in take such arrangements into account and implement the desired calculations using appropriate organizational concepts.
- the exact design of the component is therefore of minor importance for the implementation of the DNA calculator according to the invention and is strongly dependent on the further progress of the biotechnological processes and their error rate.
- the proposed computer can be adapted directly to changing technologies and new methods by adapting the implementation of the programming language expressions in DNA strings (i.e. specifically the code generation component of the compiler) for the synthesis device accordingly.
- the proposed concept is therefore also universal in the respect that new basic technologies can easily be used for new generations of the proposed hybrid computer.
- f (n) if ( ⁇ l) then 1 else f ( ⁇ -1) + f (n-2)
- f in is the ⁇ th number of the sequence.
- the two-digit constructor REC binds the following variable recursively, SUB not recursively in the function body.
- the applicator AP specifies the application of the function mentioned to the following arguments.
- the single-digit constructors VAR and INT indicate the type of the following construct.
- Table 1 lists the DNA coding of the two-digit constructors used here:
- AAA.AAA REC ⁇ variable> ⁇ expr>
- AAA.AGG AP ⁇ expr> ⁇ expr>
- Table 1 DNA coding of two-digit constructors
- Table 2 The codes of the single-digit constructors used here are given in Table 2:
- Variable names ⁇ string> and function identifiers ⁇ func-id> can be numbered and coded like numbers ⁇ number> and characters ⁇ string>.
- Individual digits of the dual system are encoded by three nucleotides (as codon), '0' as -'CCC and '1' as 'TTT', of course a " nucleotide would suffice, but the redundancy is increased by using more nucleotides Depending on the susceptibility to errors of the biotechnological operations, the redundancy can be improved by using longer codings (extended codons or using more codons per digit) or by a larger Hammig spacing of the coding or adapted to the special circumstances of the biotechnological operations used.
- start and end markers In order to allow compact encoding of any number of characters and numbers, they are encoded by a binary representation with a start (CAC) and an end marker (ACA).
- CAC start
- ACA end marker
- the technology of the start and end markers can also be used for the constructors, on the one hand to obtain a more compact coding or on the other hand to enable the installation of restriction interfaces to split the expressions into their syntax components.
- the following table 3 shows the codes used here.
- the result can be extracted from the buffer solution using the MAIN label (ACGTACGT) so that the result of the calculation is a number (GGG.AAG) in binary coding (10101011000010).
- the translation of the binary coding results in the number 10946 as a result of the overall calculation.
- the compiler has identified two expressions f (n-1) and f (n-2) that can be executed independently of one another and has abstracted them using a special ⁇ abstraction ( ⁇ * or SUB *) and marked them for distribution.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Theoretical Computer Science (AREA)
- Biophysics (AREA)
- Health & Medical Sciences (AREA)
- Mathematical Physics (AREA)
- Nanotechnology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Chemical & Material Sciences (AREA)
- Evolutionary Biology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Crystallography & Structural Chemistry (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Genetics & Genomics (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE59802537T DE59802537D1 (de) | 1997-04-15 | 1998-04-15 | Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen |
EP98920526A EP0976060B1 (de) | 1997-04-15 | 1998-04-15 | Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19715629.0 | 1997-04-15 | ||
DE19715629 | 1997-04-15 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1998047077A1 true WO1998047077A1 (de) | 1998-10-22 |
Family
ID=7826527
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP1998/002208 WO1998047077A1 (de) | 1997-04-15 | 1998-04-15 | Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen |
Country Status (3)
Country | Link |
---|---|
EP (1) | EP0976060B1 (de) |
DE (1) | DE59802537D1 (de) |
WO (1) | WO1998047077A1 (de) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2000059917A2 (de) * | 1999-03-31 | 2000-10-12 | Hilmar Rauhe | Informationstragende und informationsverarbeitende polymere |
WO2003056036A2 (en) * | 2001-12-21 | 2003-07-10 | The Wellcome Trust | Genes |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0726530A1 (de) * | 1995-02-07 | 1996-08-14 | Nec Corporation | DNS-basierter enthaltadressierbarer Speicher |
US5555434A (en) * | 1990-08-02 | 1996-09-10 | Carlstedt Elektronik Ab | Computing device employing a reduction processor and implementing a declarative language |
-
1998
- 1998-04-15 EP EP98920526A patent/EP0976060B1/de not_active Expired - Lifetime
- 1998-04-15 DE DE59802537T patent/DE59802537D1/de not_active Expired - Lifetime
- 1998-04-15 WO PCT/EP1998/002208 patent/WO1998047077A1/de active IP Right Grant
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5555434A (en) * | 1990-08-02 | 1996-09-10 | Carlstedt Elektronik Ab | Computing device employing a reduction processor and implementing a declarative language |
EP0726530A1 (de) * | 1995-02-07 | 1996-08-14 | Nec Corporation | DNS-basierter enthaltadressierbarer Speicher |
Non-Patent Citations (3)
Title |
---|
BACH E ET AL: "DNA MODELS AND ALGORITHMS FOR NP-COMPLETE PROBLEMS", PROCEEDINGS OF THE 11TH. ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PHILADELPHIA, MAY 24 - 27, 1996, no. CONF. 11, 24 May 1996 (1996-05-24), HOMER S;JIN-YI CAI (EDS ), pages 290 - 300, XP000607961 * |
CSUHAJ-VARJU E ET AL: "DNA computing based on splicing: universality results", PACIFIC SYMPOSIUM ON BIOCOMPUTING '96, PROCEEDINGS OF BIOCOMPUTING '96, HI, USA, 3-6 JAN. 1996, ISBN 981-02-2578-4, 1995, Singapore, World Scientific, Singapore, pages 179 - 190, XP002077367 * |
PAUN G ET AL: "From DNA recombination to DNA computing via formal languages", BIOINFORMATICS. GERMAN CONFERENCE ON BIOINFORMATICS, GCB'96. SELECTED PAPERS, LEIPZIG, GERMANY, 30 SEPT.-2 OCT. 1996, 1997, Berlin, Germany, Springer-Verlag, Germany, pages 210 - 220, XP002077366 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2000059917A2 (de) * | 1999-03-31 | 2000-10-12 | Hilmar Rauhe | Informationstragende und informationsverarbeitende polymere |
WO2000059917A3 (de) * | 1999-03-31 | 2001-02-01 | Hilmar Rauhe | Informationstragende und informationsverarbeitende polymere |
WO2003056036A2 (en) * | 2001-12-21 | 2003-07-10 | The Wellcome Trust | Genes |
WO2003056036A3 (en) * | 2001-12-21 | 2003-12-31 | Wellcome Trust | Genes |
US7947819B2 (en) | 2001-12-21 | 2011-05-24 | The Wellcome Trust | B-raf polynucleotides |
US8580497B2 (en) | 2001-12-21 | 2013-11-12 | The Wellcome Trust | Methods for detection of the oncogenic T1796A B-Raf mutation |
Also Published As
Publication number | Publication date |
---|---|
EP0976060B1 (de) | 2001-12-19 |
DE59802537D1 (de) | 2002-01-31 |
EP0976060A1 (de) | 2000-02-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE69730276T2 (de) | Vorrichtung und Verfahren zur Erleichterung der Vermeidung von exzeptionellen bestimmten Zuständen während des Ablaufs eines Programmes | |
DE19735350B4 (de) | Vektorprozessor zum Ausführen paralleler Operationen und Verfahren hierfür | |
DE19735348B4 (de) | Vektorprozessor zur Einzelbefehl-Mehrdaten-Verarbeitung unter Verwendung von mehreren Bänken von Vektorregistern und zugehöriges Verfahren zum Betreiben desselben | |
DE69833008T2 (de) | Prozessor mit instruktionskodierung mittels eines schablonenfeldes | |
DE69724322T2 (de) | Verfahren und Anordnung zum frühzeitigen Einfügen von Assemblercode zwecks Optimierung | |
DE2748991A1 (de) | Einrichtung zur umsetzung von datenformaten | |
DE102008005515A1 (de) | Virtuelle Architektur und virtueller Befehlssatz für die Berechnung paralleler Befehlsfolgen | |
DE2505843A1 (de) | Datenverarbeitungsanlage mit datenstromgesteuerter simultanverarbeitung | |
DE102005021749A1 (de) | Verfahren und Vorrichtung zur programmgesteuerten Informationsverarbeitung | |
Lemoine et al. | Goulphar: rapid access and expertise for standard two-color microarray normalization methods | |
EP0825540B1 (de) | Prozessor mit Pipelining-Aufbau | |
DE4430195A1 (de) | Computersystem und Verfahren zur Auswertung von Vorhersagen und Booleschen Ausdrücken | |
EP0976060B1 (de) | Frei programmierbares, universelles parallel-rechnersystem zur durchführung von allgemeinen berechnungen | |
DE19735349B4 (de) | Vektorprozessor und Verfahren zu dessen Betrieb | |
DE2312193A1 (de) | Uebersetzer und quellencode-erzeuger fuer eine problemorientierte sprache fuer rechenanlagen | |
Thisted | Computing environments for data analysis | |
Unruh | Quantum programming languages | |
Médigue et al. | Cooperative Computer System For Genome Sequence Analysis. | |
Peter et al. | ON THE APPLICATION OF MULTISET TO DETERMINISTIC COOPERATIVE SPECIALIZATION P SYSTEM UNDER CATALYSIS | |
EP2217999A2 (de) | Compiler für rekonfigurierbare architekturen mit besonderem zwischenformat | |
Sosík et al. | Tissue P systems with cell separation: upper bound by PSPACE | |
Hatteberg | Defining an Object-Oriented Architecture for Operations on Genomic Data | |
Walter | The Importance of the Programming Language ALGOL for Automation in Astronomical Research | |
DE102019126715A1 (de) | Systeme und Verfahren zur energieeffizienten Datenverarbeitung | |
Raja et al. | Combinatory formulations of concurrent languages |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): DE JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1998920526 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09403231 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 1998920526 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: JP Ref document number: 1998543503 Format of ref document f/p: F |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWG | Wipo information: grant in national office |
Ref document number: 1998920526 Country of ref document: EP |