An efficient algorithm for DNA fragment assembly in MapReduce

► We develop a sequence assembly parallel algorithm, which avoids de Bruijin graph division, using the MapReduce framework. ► The method overcomes memory limitations in large sequence assembly by distributing de Bruijn graph. ► The method implies MapReduce is an ideal solution for sequence assembly algorithm.