论文信息 - K-mer clustering algorithm using a MapReduce approach

K-mer clustering algorithm using a MapReduce approach

With recent advances in high throughput sequencing platforms, it is possible to sequence RNA obtained from biological samples more cost-effectively and comprehensively. Due to the ubiquity of the technology, massive volumes of RNA sequence data are now being generated, and as a result the need for more efficient analysis software has become an urgent challenge.

[1] Alessandro Curioni,et al. Rebasing I/O for Scientific Computing: Leveraging Storage Class Memory in an IBM BlueGene/Q Supercomputer , 2014, ISC.

[2] Martyn D. Winn,et al. Parallelization of the Trinity Pipeline for De Novo Transcriptome Assembly , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[3] Steven J. Plimpton,et al. MapReduce in MPI for Large-scale graph algorithms , 2011, Parallel Comput..

[4] Carl Kingsford,et al. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers , 2011, Bioinform..

[5] N. Friedman,et al. Trinity: reconstructing a full-length transcriptome without a genome from RNA-Seq data , 2011, Nature Biotechnology.