SHARE
TWEET

Untitled

xfeng Oct 21st, 2019 76 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. `/lab/usrname/project/SR_fastqs/NA12878_SRR622457_2.fastq.gz': discarded 444689470 reads shorter than 96 bases
  2. `/lab/usrname/project/SR_fastqs/NA12878_SRR622457_2.fastq.gz': discarded 610202 reads containing non-ACGT characters
  3. `/lab/usrname/project/SR_fastqs/NA12878_SRR622457_1.fastq.gz': discarded 270194048 reads shorter than 96 bases
  4. `/lab/usrname/project/SR_fastqs/NA12878_SRR622457_1.fastq.gz': discarded 1700565 reads containing non-ACGT characters
  5. [node04:60522] PMIX ERROR: NO-PERMISSIONS in file dstore_base.c at line 234
  6. The minimum coverage of single-end contigs is 2.
  7. The minimum coverage of merged contigs is 2.
  8. Building the suffix array...
  9. Building the Burrows-Wheeler transform...
  10. Building the character occurrence table...
  11. Mateless            0
  12. Unaligned   206633603  14.4%
  13. Singleton   381996162  26.6%
  14. FR           89058965  6.2%
  15. RF              26481  0.00184%
  16. FF              51083  0.00356%
  17. Different   759057479  52.8%
  18. Total      1436823773
  19. Running with max stack size of 65536 KB: SimpleGraph -s1000 -n10 -j8 -k96 -o NA12878_SRR622457_1.fastq.gz-4.path1 NA12878_SRR622457_1.fastq.gz-4.dot NA12878_SRR622457_1.fastq.gz-3.dist
  20. Reading `NA12878_SRR622457_1.fastq.gz-3.fa'...
  21. Writing `NA12878_SRR622457_1.fastq.gz-3.fa.fai'...
  22. Reading `NA12878_SRR622457_1.fastq.gz-4.fa'...
  23. Writing `NA12878_SRR622457_1.fastq.gz-4.fa.fai'...
  24. n   n:1000  L50 min N75 N50 N25 E-size  max sum name
  25. 8118673 5164    1780    1000    1312    1626    2334    2223    22866   8738955 NA12878_SRR622457_1.fastq.gz-4.path2
  26. Running with max stack size of 65536 KB: PathConsensus --dot -k96 -p0.9 -o NA12878_SRR622457_1.fastq.gz-5.path -s NA12878_SRR622457_1.fastq.gz-5.fa -g NA12878_SRR622457_1.fastq.gz-5.dot - NA12878_SRR622457_1.fastq.gz-4.dot NA12878_SRR622457_1.fastq.gz-4.path3
  27. Ambiguous paths: 0
  28. Merged:          0
  29. No paths:        0
  30. Too many paths:  0
  31. Too complex:     0
  32. Dissimilar:      0
  33. The minimum coverage of single-end contigs is 0.309091.
  34. The minimum coverage of merged contigs is 2.37113.
  35. Consider increasing the coverage threshold parameter, c, to 2.37113.
  36. Building the suffix array...
  37. Building the Burrows-Wheeler transform...
  38. Building the character occurrence table...
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!
 
Top