利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

216 条记录 (耗时 0.025 秒)

    METHODS AND SYSTEMS FOR NON-DESTRUCTIVELY STORING, ACCESSING, AND EDITING INFORMATION USING NUCLEIC ACIDS
    23.
    发明申请
    METHODS AND SYSTEMS FOR NON-DESTRUCTIVELY STORING, ACCESSING, AND EDITING INFORMATION USING NUCLEIC ACIDS 有权

    公开(公告)号：US20220028497A1

    公开(公告)日：2022-01-27

    申请号：US17291517

    申请日：2019-08-30

    申请人： North Carolina State University

    发明人： Albert Jun Qi Keung ,  James M. Tuck, III ,  Kevin Volkel ,  Kyle Tomek ,  Kevin Lin

    IPC分类号： G16B50/30 ,  G16B25/10 ,  G16B25/20

    摘要： Processes and systems for non-destructively storing, accessing, and editing information using nucleic acids are disclosed. Representative processes include a process for extracting a data file from a database, wherein the data file comprises information encoded into one or more polynucleotide strands and wherein the database comprises a plurality of polynucleotide strands; a process for expanding a number of unique data files in a database that can be addressed with a predetermined number of oligonucleotide primers, wherein the unique data files each comprise information encoded into one or more polynucleotide strands and wherein the database comprises a plurality of polynucleotide strands; a process for differentially reading information encoded into one or more polynucleotide strands; a process for manipulating files while in storage; and a process for extracting a data file from a database, wherein the data file comprises information encoded into a polynucleotide strand. Systems for carrying out the processes are also disclosed.

    DETERMINING CELL, TISSUE, OR LESION REPRESENTATIONS IN CELL-FREE DNA
    28.
    发明申请
    DETERMINING CELL, TISSUE, OR LESION REPRESENTATIONS IN CELL-FREE DNA 有权

    公开(公告)号：US20210005282A1

    公开(公告)日：2021-01-07

    申请号：US16459948

    申请日：2019-07-02

    申请人： International Business Machines Corporation

    发明人： Kahn Rhrissorrakrai ,  FILIPPO UTRO ,  Chaya Levovitz ,  Laxmi Parida

    IPC分类号： G16B25/10 ,  G16B20/00 ,  G16B30/00 ,  G16B25/20 ,  C12Q1/6869

    摘要： A computer-implemented method includes to determine a cell, tissue or a lesion representation in cell-free DNA comprises inputting, to a processor, cell-free DNA (cfDNA) genomic profiles from one or more fluid biopsy samples from a patient and one or more genomic profiles from one or more cells, tissues or lesions from the patient; constructing, by the processor, a plurality of synthetic fluid hypotheses (SFs); comparing, by the processor, each of the plurality of SFs to the cfDNA genomic profiles to determine goodness of fit, of each of the plurality of SFs; selecting, by the processor, a subset of the plurality of SFs, wherein each SF of the subset of SFs has a minimum distance in goodness of fit compared to the cfDNA genomic profile; and outputting, by the processor, based on the subset of SFs, a cell, tissue or a lesion representation in the cfDNA of the patient.

    Re-writable DNA-Based Digital Storage with Random Access
    30.
    发明申请
    Re-writable DNA-Based Digital Storage with Random Access 审中-公开

    公开(公告)号：US20200035331A1

    公开(公告)日：2020-01-30

    申请号：US16653564

    申请日：2019-10-15

    申请人： THE BOARD OF TRUSTEES OF THE UNIVERSITY OF ILLINOIS

    发明人： Olgica Milenkovic ,  S.M. Hossein Tabatabaei Yazdi ,  Yongbo Yuan ,  Jian Ma ,  Huimin Zhao

    IPC分类号： G16B50/00 ,  G16B25/20 ,  B01J19/00

    摘要： The disclosure relates to a re-writable DNA-based digital storage system with a random access feature. An example embodiment includes reading a physical nucleotide sequence of 2n+L bases to form a digital representation of the physical nucleotide sequence; dividing the digital representation of the physical nucleotide sequence into an address representation of n bases, followed by a data representation of L bases, followed by a further address representation of n bases; decoding the data representation into an integer value less than 3L that is a sum of a first addend and a second addend, wherein the data representation includes a first subsequence of bases encoding the first addend followed by a second subsequence of bases encoding the second addend; and storing, in a computer memory, the integer value.