`/lab/usrname/project/SR_fastqs/NA12878_SRR622457_2.fastq.gz': discarded 444689470 reads shorter than 96 bases
`/lab/usrname/project/SR_fastqs/NA12878_SRR622457_2.fastq.gz': discarded 610202 reads containing non-ACGT characters
`/lab/usrname/project/SR_fastqs/NA12878_SRR622457_1.fastq.gz': discarded 270194048 reads shorter than 96 bases
`/lab/usrname/project/SR_fastqs/NA12878_SRR622457_1.fastq.gz': discarded 1700565 reads containing non-ACGT characters
[node04:60522] PMIX ERROR: NO-PERMISSIONS in file dstore_base.c at line 234
The minimum coverage of single-end contigs is 2.
The minimum coverage of merged contigs is 2.
Building the suffix array...
Building the Burrows-Wheeler transform...
Building the character occurrence table...
Mateless            0
Unaligned   206633603  14.4%
Singleton   381996162  26.6%
FR           89058965  6.2%
RF              26481  0.00184%
FF              51083  0.00356%
Different   759057479  52.8%
Total      1436823773
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
Reading `NA12878_SRR622457_1.fastq.gz-3.fa'...
Writing `NA12878_SRR622457_1.fastq.gz-3.fa.fai'...
Reading `NA12878_SRR622457_1.fastq.gz-4.fa'...
Writing `NA12878_SRR622457_1.fastq.gz-4.fa.fai'...
n	n:1000	L50	min	N75	N50	N25	E-size	max	sum	name
8118673	5164	1780	1000	1312	1626	2334	2223	22866	8738955	NA12878_SRR622457_1.fastq.gz-4.path2
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
Ambiguous paths: 0
Merged:          0
No paths:        0
Too many paths:  0
Too complex:     0
Dissimilar:      0
The minimum coverage of single-end contigs is 0.309091.
The minimum coverage of merged contigs is 2.37113.
Consider increasing the coverage threshold parameter, c, to 2.37113.
Building the suffix array...
Building the Burrows-Wheeler transform...
Building the character occurrence table...