Name
Abstract | ||
|---|---|---|
The recent next-generation sequencing machines generate sequences at an unprecedented rate, and a sequence is not short any more called read. The reference sequences which are aligned reads against are also increasingly large. Efficiently mapping large number of long sequences with big reference sequences poses a new challenge to sequence alignment. Sequence alignment algorithms become to match on two big data. To address the above problem, we propose a new parallel sequence alignment algorithm called Bwasw-Cloud, optimized for aligning long reads against a large sequence data (e.g. the human genome). It is modeled after the widely used BWA-SW algorithm and uses the open-source Hadoop implementation of MapReduce. The results show that Bwasw-Cloud can effectively and quickly match two big data in common cluster. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICADIWT.2014.6814662 | ICADIWT |
Keywords | Field | DocType |
big data,parallel algorithms,parallel programming,public domain software,bwa-sw algorithm,bwasw-cloud,large sequence data,next-generation sequencing machines,open-source hadoop implementation,parallel sequence alignment algorithm,reference sequences,algorithm design and analysis,bioinformatics,genomics,data handling,clustering algorithms,information management | Sequence alignment,Data mining,Alignment-free sequence analysis,Algorithm design,Computer science,Algorithm,Genomics,Cluster analysis,Big data,Group method of data handling,Cloud computing | Conference |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingming Sun | 1 | 32 | 4.87 |
| Xuehai Zhou | 2 | 551 | 77.54 |
| feng yang | 3 | 1 | 0.36 |
| Kun Lu | 4 | 21 | 3.75 |
| Dai, Dong | 5 | 88 | 16.49 |