An Efficient Memory Utilization for Path Construction of a de Bruijn Graph

The large memory requirement becomes the challenge for the NGS technologies, as the memory is the bottleneck for every application. There is need to reduce the memory utilization for the de Bruijn graph, so as to it could fit in low memory space. This work provides the efficient memory utilization for the de Bruijn graph. The minimizer breaks the reads into numerous little partitions with the goal that every partition could be loaded into main memory one by one; they process separately then later on merge to form the simple path of de Bruijn graph. This reduces the space usage required during construction of de Bruijn graph.