Article ID Journal Published Year Pages File Type
10761302 Biochemical and Biophysical Research Communications 2012 4 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Life Sciences Biochemistry, Genetics and Molecular Biology Biochemistry
Preview
An efficient algorithm for DNA fragment assembly in MapReduce
Authors
, , ,