Yeda Research and Develpment & Co. Ltd

Ubique Ltd.

Ehud Y Shapiro

Shai Kaplan

Gregory Linshiz

Tuval Ben-Yehezkel

Rivka Adar

Avshalom Houri

Tamar Paz-Elizur

Uri Shabi

Ilan Gronau

Sivan Tuvi

Yaakov Benenson

Dan Frumkin

Adam Wasserstrom

Uriel Feige

Yosef Mass

Ariel Sella

A system and method for planning, manipulating, processing and editing DNA molecules utilizing a core operation on a given input DNA molecule to produce a targeted DNA molecule.

System and method for editing and manipulating DNA

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. Optionally and preferably, error correction is performed to correct any errors which may have occurred during the synthetic process.

Programmable iterated elongation: a method for manufacturing synthetic genes and combinatorial DNA and protein libraries

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.

Programmable and autonomous computing machine made of biomolecules

A method of generating a cell lineage tree of a plurality of cells of an individual is provided. The method comprising: (a) determining at least one genotypic marker for each cell of the plurality of cells; and (b) computationally clustering data representing the at least one genotypic marker to thereby generate the cell lineage tree of the plurality of cells of the individual.

Methods and systems for generating cell lineage tree of multiple cell samples

A data retrieval system includes a data server which retrieves a data object from a data repository and a system for associating a virtual place with a retrieved data object. The virtual place provides co-presence to users which access the retrieved data object. A method for upgrading a data retrieval system comprised of a data server capable of retrieving data objects from a data repository and a plurality of data-retrieval clients is aLso described. The method includes the steps of adding a co-presence server comprising at least one virtual place associated with one of said data objects and upgrading at least two of said data-retrieval clients with the following abilities: a) the ability to open a separate communication channel with said co-presence server; b) the ability to map retrieved data objects to said virtual places; c) the ability to display co-presence information; d) the ability to enable users to communicate; and e) the ability to notify said co-presence server when said data-retrieval client is terminated.

Co-presence data retrieval system

A flat concurrent Prolog (Fcp) computer comprises a memory in which all the data is stored, three sets of registers, several queues or lists and a computer program for controlling the computer. The memory is a single data area called the 'heap' which also includes two small data areas called the 'trail' and the suspension table as well as the queues. The queues include the resolvent which is also called the active queue or the process queue, the activation queue, the process free list and the suspension free list. The registers include a set of general registers, a set of procedure try registers and a set of clause try registers. The general registers include a heap backtrack register, a queue front register, a queue back register, a process free list register, and a suspension free list register. The procedure try registers include a current process register, a time slice register that identifies the number of process iterations that can be done, a program counter, a failure label register that contains the address of the first instruction in the next clause to be tried, and a suspension table pointer. The clause try registers include a heap pointer register, an activation pointer register, a trail pointer register, an argument pointer register, a structure pointer register that points at an argument of a compound structure, a mode register that can specify either read or write mode, and a plurality of temporary registers for holding intermediate values during a clause try.

Method and apparatus for implementing a concurrent logic program

To facilitate the comparison of strings in logic programming, a hash code is added to each string having a value that depends on the contents of the string. Typically, this hash code is made part of the header for the string along with a string identification number, a number specifying the length of the string and a bit specifying whether the string is a run time string or a compile time string.

Method and apparatus for comparing strings using hash values

A suspension list is maintained for each variable on which one or more processes has been suspended because the variable is uninstantiated. The suspension list for each variable is a circular list of suspension records, each record in the list being associated indirectly with one process that is suspended because that variable is uninstantiated. Each record comprises a first pointer to a memory address or register (called a 'hanger') at which is stored the address of the process record for the suspended process and a second pointer that points to the memory address of the next record in the suspension list. Since. the same process can be suspended on different variables, it can happen that records in more than one suspension list point to the same hanger at which is stored the address of the process record for that process. If a variable is subsequently instantiated, each record in the suspension list associated with that variable is used to identify one of the processes that has been suspended on that variable. Accordingly each such process can then be enqueued in the process queue. At the same time, as each process is identified by the record in the suspension list, the address of the process record that is stored in the hanger is reset, illustratively, to zero. As a result, if at a later time another variable is instantiated and the suspension list for that variable also contains a record that points to the same hanger, the hanger will be found to point to its reset value rather than the address of the process record. Consequently, the process will not be identified a second time and will not be enqueued again in the process queue.

Growing community of inventors

Nataf, Israel

Ehud Y Shapiro