Hybrid Parallel Programming for Massive Graph Analysis
Hybrid Parallel Programming for Massive Graph Analysis
Hybrid Parallel Programming for Massive Graph Analysis
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Steps in the de Bruijn graph‐based<br />
assembly y scheme<br />
1 Preprocessing<br />
FASTQ input data<br />
Sequences after<br />
error resolution<br />
2 Kmer spectrum<br />
Determine<br />
appropriate pp p<br />
value of k to use<br />
6<br />
5<br />
4<br />
Compute and<br />
memory-intensive<br />
y<br />
3<br />
Scaffolding<br />
Error resolution + further<br />
graph compaction<br />
Vertex/edge compaction<br />
(lossless trans<strong>for</strong>mations)<br />
Preliminary de Bruijn graph<br />
construction
Change language