知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.02 seconds)

    Programmable iterated elongation: a method for manufacturing synthetic genes and combinatorial dna and protein libraries
    2.
    发明申请
    Programmable iterated elongation: a method for manufacturing synthetic genes and combinatorial dna and protein libraries 有权
    可编程迭代伸长：一种制造合成基因和组合dna和蛋白质文库的方法

    公开(公告)号：US20100240538A1

    公开(公告)日：2010-09-23

    申请号：US12308557

    申请日：2007-06-19

    Applicant: Ehud Y. Shapiro

    Inventor： Ehud Y. Shapiro

    IPC: C40B30/00 ,  C12P19/34 ,  C40B50/00 ,  C40B60/14 ,  G06F19/00

    CPC classification number: C12N15/1089 ,  C12N15/1031 ,  C12N15/66 ,  C12Q1/686 ,  C40B50/02 ,  G06F19/22

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

    Abstract translation: 用于制造合成基因和组合DNA和蛋白质文库的方法，这里称为Div和Conquer-DNA合成（D＆C-DNA合成）方法。 该方法可以以系统和自动的方式用于合成任何长的DNA分子，更一般地，任何组合分子文库具有作为一组规则的串的数学性质。 D＆C-DNA合成方法是一种算法设计范例，通过递归地将问题分解成两个或更多个相同类型的子问题。 长DNA序列的划分是在电脑中完成的。 序列的组装在体外进行。 D＆C-DNA合成方法协议由一棵树组成，其中每个节点表示中间序列。 内部节点是在其子节点的伸长反应中产生的，叶片直接合成。 在每次延伸之后，只有一条DNA链在树中传递到下一个级别，直到接收到最终产物。 可选地，优选地，执行错误校正以校正在合成过程中可能发生的任何错误。

    Method and apparatus for comparing strings using hash values
    3.
    发明授权
    Method and apparatus for comparing strings using hash values 失效
    使用散列值比较字符串的方法和装置

    公开(公告)号：US4899128A

    公开(公告)日：1990-02-06

    申请号：US807552

    申请日：1985-12-11

    Applicant: Ehud Y. Shapiro

    Inventor： Ehud Y. Shapiro

    IPC: G06F7/02 ,  G06F9/44 ,  G06F17/30

    CPC classification number: G06F7/02 ,  G06F17/30949 ,  G06F9/4438

    Abstract: 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.

    Abstract translation: 为了便于比较逻辑编程中的字符串，每个字符串中添加一个散列码，其值取决于字符串的内容。 通常，这个哈希码是字符串的头部的一部分，以及一个字符串标识号，一个指定字符串长度的数字，以及一个指定字符串是运行时字符串还是编译时间字符串的位。

    Programmable iterated elongation: a method for manufacturing synthetic genes and combinatorial DNA and protein libraries
    4.
    发明授权
    Programmable iterated elongation: a method for manufacturing synthetic genes and combinatorial DNA and protein libraries 有权
    可编程迭代伸长：制造合成基因和组合DNA和蛋白质文库的方法

    公开(公告)号：US08962532B2

    公开(公告)日：2015-02-24

    申请号：US12308557

    申请日：2007-06-19

    Applicant: Ehud Y. Shapiro ,  Gregory Linshiz ,  Tuval Ben-Yehezkel ,  Shai Kaplan ,  Rivka Adar ,  Ilan Gronau ,  Sivan Tuvi

    Inventor： Ehud Y. Shapiro ,  Gregory Linshiz ,  Tuval Ben-Yehezkel ,  Shai Kaplan ,  Rivka Adar ,  Ilan Gronau ,  Sivan Tuvi

    IPC: G06F19/20 ,  C12Q1/68 ,  C12N15/10 ,  C12N15/66 ,  C40B50/02 ,  G06F19/22

    CPC classification number: C12N15/1089 ,  C12N15/1031 ,  C12N15/66 ,  C12Q1/686 ,  C40B50/02 ,  G06F19/22

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

    Abstract translation: 用于制造合成基因和组合DNA和蛋白质文库的方法，这里称为Div和Conquer-DNA合成（D＆C-DNA合成）方法。 该方法可以以系统和自动的方式用于合成任何长的DNA分子，更一般地，任何组合分子文库具有作为一组规则的串的数学性质。 D＆C-DNA合成方法是一种算法设计范例，通过递归地将问题分解成两个或更多个相同类型的子问题。 长DNA序列的划分是在电脑中完成的。 序列的组装在体外进行。 D＆C-DNA合成方法协议由一棵树组成，其中每个节点表示中间序列。 内部节点是在其子节点的伸长反应中产生的，叶片直接合成。 在每次延伸之后，只有一条DNA链在树中传递到下一个级别，直到接收到最终产物。 可选地，优选地，执行错误校正以校正在合成过程中可能发生的任何错误。

    Method for concurrent logic program
    9.
    发明授权
    Method for concurrent logic program 失效
    并行逻辑程序的方法

    公开(公告)号：US4775934A

    公开(公告)日：1988-10-04

    申请号：US875117

    申请日：1986-06-17

    Applicant: Avshalom Houri ,  Ehud Y. Shapiro

    Inventor： Avshalom Houri ,  Ehud Y. Shapiro

    IPC: G06F9/44 ,  G06F9/06

    CPC classification number: G06F9/4438 ,  G06F8/45

    Abstract: 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.

    Abstract translation: 由于该变量未被证实，因此对于一个或多个进程已暂停的每个变量都维护一个暂停列表。 每个变量的暂停列表是暂停记录的循环列表，列表中的每个记录间接地与暂停的一个进程相关联，因为该变量未被标准化。 每个记录包括指向存储器地址或寄存器（称为“吊架”）的第一指针，在该存储器地址或寄存器中存储用于暂停处理的进程记录的地址，以及指向暂停中的下一记录的存储器地址的第二指针 列表。 以来。 相同的过程可以暂停在不同的变量上，可能发生的是，多个挂起列表中的记录指向相同的挂接器，存储该进程的进程记录的地址。 如果变量随后被实例化，与该变量相关联的暂停列表中的每个记录都用于标识该变量已被挂起的一个进程。 因此，每个这样的过程然后可以在进程队列中排队。 同时，由于通过暂停列表中的记录识别每个进程，所以存储在挂接器中的进程记录的地址被重新设置为零。 因此，如果稍后一个变量被实例化，并且该变量的暂停列表还包含指向相同的衣架的记录，则将发现挂接器指向其重置值而不是进程记录的地址 。 因此，该进程将不再被识别，并且不会再在进程队列中排队。

Patent Agency Ranking