Abstract: A method for manufacturing synthetic genes and combinatorial DNA and protein libraries, termed here Divide and Conquer-DNA synthesis (D&C-DNA synthesis) method. The method can be used in a systematic and automated way to synthesize any long DNA molecule and, more generally, any combinatorial molecular library having the mathematical property of being a regular set of strings. The D&C-DNA synthesis method is an algorithm design paradigm that works by recursively breaking down a problem into two or more sub-problems of the same type. The division of long DNA sequences is done in silico. The assembly of the sequence is done in vitro. The D&C-DNA synthesis method protocol consists of a tree, in which each node represents an intermediate sequence. The internal nodes are created in elongation reactions from their daughter nodes, and the leaves are synthesized directly. After each elongation only one DNA strand passes to the next level in the tree until receiving the final product.

Abstract: A method for manufacturing synthetic genes and combinatorial DNA and protein libraries, termed here Divide and Conquer-DNA synthesis (D&C-DNA synthesis) method. The method can be used in a systematic and automated way to synthesize any long DNA molecule and, more generally, any combinatorial molecular library having the mathematical property of being a regular set of strings. The D&C-DNA synthesis method is an algorithm design paradigm that works by recursively breaking down a problem into two or more sub-problems of the same type. The division of long DNA sequences is done in silico. The assembly of the sequence is done in vitro. The D&C-DNA synthesis method protocol consists of a tree, in which each node represents an intermediate sequence. The internal nodes are created in elongation reactions from their daughter nodes, and the leaves are synthesized directly. After each elongation only one DNA strand passes to the next level in the tree until receiving the final product.

Abstract: A system and method for programming DNAzymes to be utilized as programmable drugs, which are active only in the presence of specific input combinations and/or certain conditions.

Abstract: A device, system and method for molecular computing which not only includes a suitable, renewable power source, but actually is able to receive power through the performance of the computations themselves. The molecular computing machine of the present invention actually employs the free-energy difference between its input and output to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecule as the sole source of energy. This molecular finite automaton preferably transforms an input DNA molecule into an output DNA molecule by digesting the input as it computes.

Abstract: An autonomous molecular computer that, when coupled to a molecular model of a disease, is capable of disease diagnosis. The computer preferably performs such diagnosis by detecting one or more disease markers. For example, optionally and preferably the molecular computer checks for the presence of over-expressed, under-expressed and mutated genes, applies programmed medical knowledge to this information to reach a diagnostic decision.

Abstract: The present invention provides active fibroblast growth factor variants demonstrating enhanced receptor subtype specificity. The preferred novel variants retain binding to FGF Receptor Type 3 (FGFR3) triggering intracellular downstream mechanisms leading to activation of a biological response. Methods of utilizing preferred FGF mutants in preparation of medicaments for the treatment of malignancies and skeletal disorders including osteoporosis and enhancing fracture healing and wound healing processes are provided.

Abstract: A device, system and method for molecular computing which not only includes a suitable, renewable power source, but actually is able to receive power through the performance of the computations themselves. The molecular computing machine of the present invention actually employs the free-energy difference between its input and output to accomplish a computation, preferably by using its input DNA molecule as a partial source of energy, or alternatively by using the input DNA molecule as the sole source of energy. This molecular finite automaton preferably transforms an input DNA molecule into an output DNA molecule by digesting the input as it computes.

Abstract: The present invention provides active fibroblast growth factor variants demonstrating enhanced receptor subtype specificity. The preferred novel variants retain binding to FGF Receptor Type 3 (FGFR3) triggering intracellular downstream mechanisms leading to activation of a biological response. Methods of utilizing preferred FGF mutants in preparation of medicaments for the treatment of malignancies and skeletal disorders including osteoporosis and enhancing fracture healing and wound healing processes are provided.