title: An efficient algorithm for DNA fragment assembly in MapReduce.
abstract: Fragment assembly is one of the most important problems of sequence assembly. Algorithms for DNA fragment assembly using de Bruijn graph have been widely used. These algorithms require a large amount of memory and running time to build the de Bruijn graph. Another drawback of the conventional de Bruijn approach is the loss of information. To overcome these shortcomings, this paper proposes a parallel strategy to construct de Bruijin graph. Its main characteristic is to avoid the division of de Bruijin graph. A novel fragment assembly algorithm based on our parallel strategy is implemented in the MapReduce framework. The experimental results show that the parallel strategy can effectively improve the computational efficiency and remove the memory limitations of the assembly algorithm based on Euler superpath. This paper provides a useful attempt to the assembly of large-scale genome sequence using Cloud Computing.
authors.affiliation: School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China. xubaomin@gmail.com
authors.forename: Baomin
authors.initials: B
authors.lastname: Xu
authors.forename: Jin
authors.initials: J
authors.lastname: Gao
authors.forename: Chunyan
authors.initials: C
authors.lastname: Li
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D004247:DNA / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software
chemical_list: D004247:DNA