Molecular encoding and computing methods and systems therefor
OwnerTahereh Karimiinventor
Life of this patent
Estimating the term…
Abstract
The present disclosure relates to methods of data encryption and data storage using molecular systems. The present disclosure also relates to molecular systems and methods for solving a polynomial time problem. Benefits of the methods and systems disclosed herein can include providing for the secure storage and retrieval of large amounts of encrypted data in a stable molecular system having random-access capability. Benefits of the methods and systems disclosed herein can include providing molecular computing systems that can solve complex polynomial time problems.
Claims20
A method of recording and reading a binary code comprising:
- providing a binary code;
- creating a recording key by assigning at least two amino acids a binary code identity;
- recording the binary code into at least one coded polypeptide by adding the at least two amino acids in sequence to form a coded peptide sequence according to the recording key, wherein the coded peptide sequence corresponds to the binary code;
- determining the coded peptide sequence by mass spectroscopy;
- and
- reading the coded peptide sequence into the binary code by identifying the at least two amino acids according to their binary code identity.
A method of recording and reading a binary code comprising:
- providing a binary code;
- creating a recording key by assigning at least two amino acids or at least two nucleic acid residues a binary code identity;
- recording the binary code into at least one coded polypeptide or at least one polynucleotide by adding the at least two amino acids or the at least two nucleic acid residues in sequence to form a coded peptide sequence or a coded nucleotide sequence according to the recording key, wherein the coded peptide sequence or the coded nucleotide sequence corresponds to the binary code;
- determining the coded peptide sequence or the coded nucleotide sequence by mass spectroscopy;
- and
- reading the coded peptide sequence or the coded nucleotide sequence into the binary code by identifying the at least two amino acids according to their binary code identity.
A system for solving a polynomial time problem comprising:
- a polynomial time problem and a map, wherein the map includes N number of map locations with a distance between their map locations;
- and
- a closed loop molecular structure having a number N of nodes located along the closed loop molecular structure,
- wherein each of the N nodes corresponds to a different map location,
- wherein each of the N nodes is connected to a different node by an oligomer containing chain,
- wherein each of the nodes is connected to N−1 different single stranded oligonucleotide identification sequences,
- wherein each single stranded oligonucleotide identification sequence contains an identification portion, wherein the identification portion contains a sequence which corresponds to an identity of the node to which it is attached, and
- an interaction portion, which is complementary to one single stranded oligonucleotide identification sequence on another node,
- wherein each pair of single stranded oligonucleotide identification sequences that is capable of hybridizing with its complementary single stranded oligonucleotide identification sequence, to form a double stranded oligonucleotide identification sequence between a pair of nodes, has a length corresponding to the distance between the map location of the pair of nodes.
Dependencies are inferred from the claim text.