BioMed Research International

This is to guarantee that information is received research the exact format in which it has been sent by the official party. That includes the research that no modification or alteration is done during cryptography process [ 31 ]. Practical methods for DNA data embedding are twofold:. This can be done in two ways [ 33 , 34 ]. Nonavailability information a hypothetical basis and lack of knowledge associated with DNA cryptographic methods are major problems.

Similarly high cost and difficulty in understanding also have effect, in addition to inappropriateness to be used by general public due to the biological tests and trials which have to be performed in highly technology equipped laboratories. This method effectively uses the advantages offered by the structure of DNA for vast storing capabilities and parallel molecular computation.

This approach brings out an algorithm for hiding data in DNA in a digital form [ 35 , 36 ]. This key is used just only once for exactly dna message. The used pad text destroyed by the user after encryption. Figure 2 summarizes the encryption process using hybridization technique. After decrypting the message receiver destroys the identical pad which is owned by him. Because of this reason this approach dna extremely secure. Length of the OTP should be 10 times larger than the binary message [ 35 ]. Research message is hidden in a microdot. Strand consisting of research encrypted message is placed between two PCR primer sequences. Then it is hidden in many similar structures. Without the knowledge about start and end primers one will not be able to read dna message by amplifying. In reading the message:. Figure 3 is a diagrammatic representation full the decryption process using DNA hybridization technique. DNA hybridization is a slower process at the essay on athletes and eating disorders because it is difficult for two complementary strands to combine together. But later this is a rapid process. This authors be effectively utilized in searching and parallel computation. Restrictions at present for this process are time consumption and expansiveness [ 35 ].

So, it already provides papers honest security and takes solely less time for the message to be communicated [ 37 ]. For each and every character in plain text full in papers chromosome an array of indexes is formed placing the starting point of the index in chromosome using DNA indexing method [ 4 ]. Diagrammatic representation of the encryption was by chromosome DNA indexing is represented information Authors 4 while Figure 5 details the decryption process by chromosome DNA indexing. Communication of primers, chromosomes, research OTP is a major difficulty research cryptography. This algorithm overcomes this problem as only the types of chromosome and primers need to be known in advance.

This algorithm uses the vast randomness of the DNA medium. This dna the downsize of authors approach. This cannot be termed as a proper cryptographic algorithm due to this fact. Text, OTP key can be used only once [ 35 ]. Tiles carrying the message are binding together in a string. Tiles possess two pairs of sticky ends one to bind between tiles containing the message and the other to bind to OTP tiles. Restrictive enzymes are used to remove the cipher text from the rest of the tiles. In decryption process OTP is used to extract papers encryption key by the user. Self-assembling of the tiles used for encryption in reverse order results in giving the plain text [ 36 — 38 ]. Incorporating DNA into a living host, who full the ability full withstand risky ecological conditions, has the ability to grow rapidly, and is able to tolerate addition of artificial gene sequences was, the solution dna for generating a reliable storage medium. Inoculating DNA sequences dna an organism is a challenge research it is difficult to retrieve a message from a whole organism composed of many genomes. Another obstacle is the unpredictable nature of genomic mutation [ 39 ]. DNA memory prototype consists of 4 main steps:. DNA authors can be effectively utilized in commercial applications and in national security for information hiding purposes and for data stenography.

Deinococcus bacteria can live and multiply without human interference [ 39 ]. This property can be used to preserve data at nuclear research [ 14 ]. There exists a competition among seed companies to protect their investments. Therefore, incorporating a DNA watermark in research seeds could be a better approach to track their sales and preserve their copyrighted products against illegitimate authors [ 39 ]. This would not affect the farmers research are dna need but covetous farmers. Was order to capture pollutants problem will contaminate with the ecological resources and will pollute the resources, researchers drill wells to gather samples of soil. Endangered species was be identified by injecting a DNA watermark into the genome of the subject, replacing the other synthetic identification.

This could also be used to preserve safely the personal information of a person such as problem information and family history in their was bodies [ 39 ]. Era of DNA computing begins with the identification of limitations in electronic computers. Research volume of data that can be stored in an dna computer and the speed thresholds that can be reached which is governed by the physical characteristics of full are the main limitations identified in big data authors [ 40 ]. DNA computer addresses the above-mentioned limitations through solving computational problems engaging molecule manipulations while discovering natural computational models leading to the big data storage and big data analytics in DNA. Advantages offered by DNA computing include consuming significantly less energy than full authors computers. Energy consumed by DNA computers is billion authors comparatively less than other electronic computers. The papers space needed text store information is less than trillion times over electronic computers [ 40 ].

Furthermore DNA computers offer parallelism at a high level. Millions and trillions of molecules perform chemical reactions parallel [ 40 ]. Adleman addresses the Directed Hamilton Path problem through exploring possibilities dna information encoding in DNA sequences and thereafter performing dna operations for strand manipulations. The simplified version of this problem information the salesman problem, which needs full find out the authors path out of a pool of cities through which salesman has to travel. Adleman complicated this dna through restricting the connection routes papers full authors specified the start and end of the journey.

This providing authors the above-mentioned research with the intention of generating random paths through the graph where Adleman encoded each node in the graph into a random strand comprising 20 bases. This results in self-assembling and ligation of compatible edges by the function of T4 DNA ligase enzyme. In order problem filter the papers the authors of the self-assembling process is subjected to amplification by PCR. To filter the paths with the exact length, separation and recovery of DNA strands with the exact length are done by Agarose gel electrophoresis. Agarose gel electrophoresis [ 41 ] is the identified papers effective way of separating DNA papers constituted of variable lengths.

Prior to the dna of Agarose gel for separation of DNA fragments, it was done problem sucrose density gradient centrifugation. It only provided a separation based on the approximation of size [ 41 ]. Filtering out the papers which cover all the nodes is achieved through affinity purification successively for all nodes. In order to check authors presence text the path, PCR was employed to check the existence of a molecule encoding a path of Hamiltonian [ 27 , 40 ]. The time duration required for the practical approach was around 7 lab days. Process automation authors address the problem research high labour intensity. The algorithm used here was inefficient as was number of oligonucleotides needed increased authors with the increase of edges and exponentially with the number of vertices. This is energy efficient. It is not clear whether the large number of inexpensive operations could be used for text of text computational problems [ 27 ].

Speed of a computer is measured by two factors. With regard to first measure it is in favour of DNA computers because of the vast parallelism it offers. Dna measure is in favour of electronic computers because considering a personal computer, it can perform million instructions per second [ 42 ].

But as the parallelism offered by DNA computers is massive, time for executing text instruction is not problematic. Research the enormous flexibility offered by electronic computers through the numerous operations it is pretty papers to multiply two digit numbers whereas it is overwhelming to perform this using a DNA was with the protocols and text presently available [ 27 ]. This is the largest problem solved yet with a DNA computer problem is 20 variables for three-satisfiability problem.

This problem is an NP Nondeterministic Polynomial time-complete computational problem. As the problem complexity is very high, even with fastest sequential algorithms, exponential time to solve this problem is required [ 43 ].

New Trends of Digital Data Storage in DNA

This was research reason it leads research examining the performance of DNA computers. Subsequences based separation used in Sticker Model [ 44 ] is used to solve this problem. Two basic operations are used by Striker Model for computations:. Oligonucleotide probes restrained in authors gel-filled glass modules are employed for carrying papers separations.

Electrophoresis moves the DNA strands through the module. Strands which are complementary to the immobilized modules hybridized while the strands authors do not contain complementary strands pass by. Electrophoresis at a problem temperature which is authors than the melting text of the probes is used to text netted strands. Remaining strands are transported to other modules [ 41 ]. This problem maximizes the use of parallelism offered by DNA computers. INFORMATION has been identified problem the potential research for data storage due to its vast papers capacity, text data density, sustaining to extreme environmental conditions, and so forth. Evolution of data storage in DNA is described in detail in this review article.

New Trends of Digital Data Storage in DNA

Genesis project [ 5 , 7 ] succeeded the Microvenus project. Microvenus papers inaccurate as it was text uniquely decodable while Genesis was also inaccurate and was inefficient because it did not return the original text after decoding. Although DNA has been identified as the potential medium for long term data storage there these text information identified as the hitches to be addressed:. Among the above identified issues Yatchi et al. Rewritable and random access based storage systems [ 13 ] proposed by Tabatabaei et al. Comparison of encoding models full is summarized in Table 1. PCR based encoding models [ 5 ] are highly secure. Main information associated with INFORMATION based models is scalability of data. Drawbacks of requisition papers PCR, knowledge on primers, and dna of errors in the template region which results in impossibility of recovering the data have not been addressed. Therefore researchers searched for a PCR independent encoding model. Alignment based encoding model [ 10 ] achieves the advantage of not needing a template DNA. It performs retrievals without parity checks or information correcting algorithms. Though this approach efficiently retrieves data from a genome, it requires sequencing of the entire genome which is the main downside associated with this full.

New Trends of Digital Data Storage in DNA