A method for processing genetic data, which comprise a series of sequence elements each representing a biomolecule, comprises the steps of forming sequence fragments (S2), wherein each sequence fragment comprises a section of the series of sequence elements having a fragment length of at least two sequence elements, applying a coding function to each of the sequence fragments in order to generate a multiplicity of encrypted fragment data items (S3) winch are each assigned to one of the sequence fragments, and storing the encrypted fragment data (S4), wherein the sequence fragments are formed in such a manner that the sections of the series of sequence elements overlap and each sequence element is included in at least two sequence fragments. A description is also given of a data processing device for processing genetic data and a method for querying a database containing encrypted fragment data which were generated and stored using the method for processing genetic data.

A method for processing genetic data, which comprise a series of sequence elements each representing a biomolecule, comprises the steps of forming sequence fragments (S2), wherein each sequence fragment comprises a section of the series of sequence elements having a fragment length of at least two sequence elements, applying a coding function to each of the sequence fragments in order to generate a multiplicity of encrypted fragment data items (S3) winch are each assigned to one of the sequence fragments, and storing the encrypted fragment data (S4), wherein the sequence fragments are formed in such a manner that the sections of the series of sequence elements overlap and each sequence element is included in at least two sequence fragments. A description is also given of a data processing device for processing genetic data and a method for querying a database containing encrypted fragment data which were generated and stored using the method for processing genetic data.

A method for storage of an item of information (210) is disclosed. The method comprises encoding bytes (720) in the item of information (210), and representing using a schema the encoded bytes by a DNA nucleotide to produce a DNA sequence (230). The DNA sequence (230) is broken into a plurality of overlapping DNA segments (240) and indexing information (250) added to the plurality of DNA segments. Finally, the plurality of DNA segments (240) is synthesized (790) and stored (795).

A method for storage of an item of information (210) is disclosed. The method comprises encoding bytes (720) in the item of information (210), and representing using a schema the encoded bytes by a DNA nucleotide to produce a DNA sequence (230). The DNA sequence (230) is broken into a plurality of overlapping DNA segments (240) and indexing information (250) added to the plurality of DNA segments. Finally, the plurality of DNA segments (240) is synthesized (790) and stored (795).

Provided herein are compositions, devices, systems and methods for the generation and use of secured biomolecule-based information for storage. Further described herein are compositions, devices, systems and methods for bioencryption or biodecryption of information. Conversion of a digital sequence to a nucleic based sequence includes a step of selection of one or more bioencryption methods.

Provided herein are compositions, devices, systems and methods for the generation and use of secured biomolecule-based information for storage. Further described herein are compositions, devices, systems and methods for bioencryption or biodecryption of information. Conversion of a digital sequence to a nucleic based sequence includes a step of selection of one or more bioencryption methods.

A computational model may be used to predict targets of a candidate, or predict candidates that interact with a target. A plurality of pairs may be established, each including a candidate and a respective one of a plurality of controls, each of the plurality of controls known to bind with a target. For each pair, values of at least two datatypes of the candidate may be compared to values of the at least two datatypes of the respective one of the plurality of controls in the pair to generate a similarity score for each of the at least two datatypes of each pair. Similarity scores may be converted to likelihood values indicating likelihood that the candidate and the controls have a shared target based on the respective one of the at least two datatypes. Tests may be performed to validate predictions regarding interactivity of candidates and targets.

The disclosure includes: acquiring first data; grouping the first data to obtain K packet sub-data; inputting a preset primer into a random generator to obtain 4T random number sequences, 4.sup.T>K; determining the packet sub-data corresponding to the ith random number sequence, and performing exclusive or (XOR) operation on the determined packet sub-data to obtain data information DATAi, and obtaining a DNA molecular chain according to the data information DATAi, the preset primer and the generation times capacity of the random generator; performing DNA sequence synthesis on the plurality of DNA molecular chains to obtain target storage data. In the disclosure, in the process of coding the first data to obtain a DNA molecular chain, a random generator is added to greatly simplify the coding process and implement efficient and accurate coding on the first data. The disclosure may be widely applied to a field of data storage technologies.

one embodiment of a memory stores information, including address bits, on DNA strands and provides access using a pipeline of tubes, where each tube selectively transfers half of the strands to the next tube based on probing of associated address bits. Transfers are controlled by logic relating to the state of the tubes: The pipeline may be initialized to start at a high-order target address, providing random access without enzymes, synthesizing probe molecules or PCR at access time. Thereafter, a processing unit gets fast access to sequentially addressed strands each cycle, for applications like executing machine language instructions or reading blocks of data from a file. Another embodiment with a compare unit allows low-order random access. Provided that addresses are encoded using single-stranded regions of DNA where probe molecules may hybridize, other information may use any DNA encoding. Electronic/electrochemical (electrowetting, nanopore, etc.) embodiments as well as biochemical embodiments are possible.

one embodiment of a memory stores information, including address bits, on DNA strands and provides access using a pipeline of tubes, where each tube selectively transfers half of the strands to the next tube based on probing of associated address bits. Transfers are controlled by logic relating to the state of the tubes: The pipeline may be initialized to start at a high-order target address, providing random access without enzymes, synthesizing probe molecules or PCR at access time. Thereafter, a processing unit gets fast access to sequentially addressed strands each cycle, for applications like executing machine language instructions or reading blocks of data from a file. Another embodiment with a compare unit allows low-order random access. Provided that addresses are encoded using single-stranded regions of DNA where probe molecules may hybridize, other information may use any DNA encoding. Electronic/electrochemical (electrowetting, nanopore, etc.) embodiments as well as biochemical embodiments are possible.