Comparison of DNA Patterns with Graf Simulation

The aim of this study is to calculate the similarity ratio of the sequences in different DNA
samples. In order to increase the performance and shorten the transaction volume of the DNA
data, DNA sequences were compressed and DNA motifs were obtained. For this, the LZ
Compression algorithm was used. While each of the obtained motifs was only a graph node,
the order of these motifs was transformed into graphs expressing the edge of the nodes. The
obtained graph from each DNA was used to find the similarity in DNA. According to the
algorithms calculating the similarity ratio on the graphs, we compared both Neighbor
Matching and Cosinus Similarity methods and then we showed that Cosinus Similarity is more
efficient than Neighbor Matching.

 

 

Go here

 

Büyük Veri, Paralel İşleme ve Akademisyenlik [Link]

Veri Analitiği & Büyük Veri [Link]

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.