New Horizon College of Engineering, Bangalore, aiswaryaprasad13@gmail.com
Online published on 9 March, 2017.
Metagenomic projects collect DNA from uncharacterized environments that may contain thousands of species per sample. Because the output from metagenomic sequencing is a large set of reads of unknown origin, clustering reads together that were sequenced from the same species is a crucial analysis step. This paper compares the the use of lacunarity analysis of the Chaos Game Representation of metagenomic sequences of various lengths. It demonstrates the efficiency of lacunarity analysis for shorter nucleotide sequences.
Metagenomes, Chaos Game Representation, Lacunarity, Gliding Box Algorithm