Cloud based short read mapping service

Proceedings - 2012 IEEE International Conference on Cluster Computing, CLUSTER 2012

Volumn , Issue , 2012, Pages 601-604

  Dai, Dong ^a   Li, Xi ^a   Wang, Chao ^a   Zhou, Xuehai ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Hadoop; map reduce; Service; short reads mapping

Indexed keywords

COMPUTER ARCHITECTURE; CONFORMAL MAPPING; DNA SEQUENCES; GENE ENCODING; ITERATIVE METHODS; MULTIPROCESSING SYSTEMS; WEB SERVICES;

HADOOP; ITERATIVE MAPREDUCE; MAP-REDUCE; MAP-REDUCE PROGRAMMING; PROPOSED ARCHITECTURES; SCIENTIFIC RESEARCHES; SERVICE; SHORT-READS MAPPINGS;

CLUSTER COMPUTING;

EID: 84870700065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTER.2012.60     Document Type: Conference Paper

References (13)

1. B. Langmead, C. Trapnell, M. Pop,S. L.Salzberg, Ultrafast and memory-efficient alignment of short DNA sequences to the human genome[J]. Genome Biology, 2009. 10(3): p. R25.
2. H. Li,R. Durbin, Fast and accurate short read alingment with Burrows-Wheeler transform[J]. Bioinformatics, 2009. 25(14): p. 1754-1760.
3. N. Homer, B. Merriman,S. F. Nelson, BFAST: An Alignment Tool for Large Scale Genome Resequencing[J]. PLoS ONE, 2009. 4(11): p. e7767.
4. M. C. Schatz, CloudBurst: highly sensitive read mapping with MapReduce[J]. Bioinformatics, 2009. 25(11): p. 1363-1369
5. M. Burrows,D. J. Wheeler, A block-sorting lossless data compression algorithm. 1994, Digital Equipment Corporation, : Palo Alto, CA. p. 124.
6. P. Ferragina,G. Manzini. Opportunistic data structures with applications. in Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 2000: IEEE Computer Society.390
7. Baeza-yates, R.A., et al. Fast and practical approximate string matching, In Combinatorial Pattern Matching, Third Annual Symposium, 185-192
8. T. F. Smith,M. S. Waterman, Identification of Common Molecular Subsequences[J]. Journal of Molecular Biology, 1981. 147(1): p. 195-197.
9. Jeffrey, D. et al. MapReduce: Simplified data processing on large clusters. Communication of ACM, 51, 107-113
10. Fay Chang, Jeffrey Dean, Sanjay Ghemawat, et al. Bigtable: A Distributed Storage system for Structured Data, OSDI, 2006
11. Landau, G.M., et al. Introducing efficient parallelism into approximate string matching and a new serial algorithm. Prceedings of the eighteenth annual ACM symposium on Theory of computing. ACM, Berkeley, California, US.
12. A. Mahram,M. C. Herbordt. FMSA: FPGA-Accelerated ClustalW-Based Multiple Sequence Alignment through Pipelined Prefiltering. in 2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines. 2012.177-183
13. L. Tan,T. Sherwood. A High Throughput String Matching Architecture for Intrusion Detection and Prevention. in Proceedings of the 32nd annual international symposium on Computer Architecture. 2005: IEEE Computer Society.112-122