[M::bwa_idx_load_from_disk] read 0 ALT contigs [M::process] read 99010 sequences (10000010 bp)... [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5077, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 338, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (60, 620) [M::mem_pestat] mean and std.dev: (340.38, 79.89) [M::mem_pestat] low and high boundaries for proper pairs: (1, 732) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.989 CPU sec, 23.974 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4989, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 341, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 617) [M::mem_pestat] mean and std.dev: (340.43, 79.05) [M::mem_pestat] low and high boundaries for proper pairs: (1, 728) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.758 CPU sec, 23.653 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5109, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (65, 620) [M::mem_pestat] mean and std.dev: (342.88, 80.12) [M::mem_pestat] low and high boundaries for proper pairs: (1, 731) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.401 CPU sec, 23.268 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5007, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 621) [M::mem_pestat] mean and std.dev: (341.58, 80.05) [M::mem_pestat] low and high boundaries for proper pairs: (1, 733) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.485 CPU sec, 23.370 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5016, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (60, 620) [M::mem_pestat] mean and std.dev: (341.15, 81.38) [M::mem_pestat] low and high boundaries for proper pairs: (1, 732) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.201 CPU sec, 24.072 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4974, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.43, 79.86) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.944 CPU sec, 23.835 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5051, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (283, 341, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (59, 619) [M::mem_pestat] mean and std.dev: (340.26, 79.37) [M::mem_pestat] low and high boundaries for proper pairs: (1, 731) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.243 CPU sec, 24.084 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5038, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (283, 341, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (53, 628) [M::mem_pestat] mean and std.dev: (342.08, 80.57) [M::mem_pestat] low and high boundaries for proper pairs: (1, 743) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.629 CPU sec, 23.514 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4996, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (70, 615) [M::mem_pestat] mean and std.dev: (342.19, 78.35) [M::mem_pestat] low and high boundaries for proper pairs: (1, 724) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.343 CPU sec, 23.205 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5127, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 341, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (71, 611) [M::mem_pestat] mean and std.dev: (341.32, 78.21) [M::mem_pestat] low and high boundaries for proper pairs: (1, 719) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.327 CPU sec, 26.213 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4981, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 344, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 622) [M::mem_pestat] mean and std.dev: (343.06, 79.20) [M::mem_pestat] low and high boundaries for proper pairs: (1, 734) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.412 CPU sec, 23.275 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4968, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (290, 345, 399) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (72, 617) [M::mem_pestat] mean and std.dev: (344.92, 79.95) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.874 CPU sec, 23.760 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5089, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 621) [M::mem_pestat] mean and std.dev: (341.93, 79.88) [M::mem_pestat] low and high boundaries for proper pairs: (1, 733) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 25.851 CPU sec, 25.674 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5012, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (59, 624) [M::mem_pestat] mean and std.dev: (342.88, 77.88) [M::mem_pestat] low and high boundaries for proper pairs: (1, 737) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.037 CPU sec, 25.922 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4982, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 340, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (63, 618) [M::mem_pestat] mean and std.dev: (340.80, 79.20) [M::mem_pestat] low and high boundaries for proper pairs: (1, 729) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.723 CPU sec, 24.593 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5049, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (65, 620) [M::mem_pestat] mean and std.dev: (343.16, 79.59) [M::mem_pestat] low and high boundaries for proper pairs: (1, 731) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.931 CPU sec, 23.816 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4993, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (341.72, 79.29) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.108 CPU sec, 23.939 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4983, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (71, 611) [M::mem_pestat] mean and std.dev: (342.15, 79.14) [M::mem_pestat] low and high boundaries for proper pairs: (1, 719) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.482 CPU sec, 23.365 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5000, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 340, 394) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (67, 612) [M::mem_pestat] mean and std.dev: (341.08, 78.12) [M::mem_pestat] low and high boundaries for proper pairs: (1, 721) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.504 CPU sec, 23.365 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5131, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (74, 609) [M::mem_pestat] mean and std.dev: (341.39, 78.61) [M::mem_pestat] low and high boundaries for proper pairs: (1, 716) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.923 CPU sec, 23.808 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5088, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 341, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.38, 78.80) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.065 CPU sec, 23.888 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4971, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 339, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (59, 624) [M::mem_pestat] mean and std.dev: (340.91, 79.22) [M::mem_pestat] low and high boundaries for proper pairs: (1, 737) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.880 CPU sec, 23.759 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4966, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 341, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (69, 614) [M::mem_pestat] mean and std.dev: (342.53, 80.09) [M::mem_pestat] low and high boundaries for proper pairs: (1, 723) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.534 CPU sec, 23.384 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5078, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (69, 614) [M::mem_pestat] mean and std.dev: (341.76, 78.94) [M::mem_pestat] low and high boundaries for proper pairs: (1, 723) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.484 CPU sec, 23.367 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5010, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (56, 626) [M::mem_pestat] mean and std.dev: (343.07, 80.70) [M::mem_pestat] low and high boundaries for proper pairs: (1, 740) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.411 CPU sec, 26.263 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4895, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 341, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 621) [M::mem_pestat] mean and std.dev: (341.82, 79.94) [M::mem_pestat] low and high boundaries for proper pairs: (1, 733) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.024 CPU sec, 23.909 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4951, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 339, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 617) [M::mem_pestat] mean and std.dev: (340.35, 79.18) [M::mem_pestat] low and high boundaries for proper pairs: (1, 728) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.105 CPU sec, 23.911 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5111, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (74, 609) [M::mem_pestat] mean and std.dev: (341.06, 78.95) [M::mem_pestat] low and high boundaries for proper pairs: (1, 716) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.003 CPU sec, 25.899 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5019, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (341.77, 79.41) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.482 CPU sec, 23.329 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5035, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (289, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (73, 613) [M::mem_pestat] mean and std.dev: (342.60, 77.91) [M::mem_pestat] low and high boundaries for proper pairs: (1, 721) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.918 CPU sec, 23.768 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5000, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (67, 617) [M::mem_pestat] mean and std.dev: (342.54, 79.49) [M::mem_pestat] low and high boundaries for proper pairs: (1, 727) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.772 CPU sec, 24.646 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5092, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (65, 620) [M::mem_pestat] mean and std.dev: (343.17, 78.71) [M::mem_pestat] low and high boundaries for proper pairs: (1, 731) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.966 CPU sec, 23.855 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5071, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 341, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 617) [M::mem_pestat] mean and std.dev: (340.99, 78.21) [M::mem_pestat] low and high boundaries for proper pairs: (1, 728) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.998 CPU sec, 23.849 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5014, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (70, 615) [M::mem_pestat] mean and std.dev: (342.83, 78.12) [M::mem_pestat] low and high boundaries for proper pairs: (1, 724) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.348 CPU sec, 23.233 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5018, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (69, 614) [M::mem_pestat] mean and std.dev: (342.19, 78.32) [M::mem_pestat] low and high boundaries for proper pairs: (1, 723) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.750 CPU sec, 23.614 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5043, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 340, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (60, 620) [M::mem_pestat] mean and std.dev: (340.72, 80.13) [M::mem_pestat] low and high boundaries for proper pairs: (1, 732) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.176 CPU sec, 24.006 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5041, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 344, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (69, 614) [M::mem_pestat] mean and std.dev: (343.14, 78.57) [M::mem_pestat] low and high boundaries for proper pairs: (1, 723) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.539 CPU sec, 24.411 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4994, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (65, 615) [M::mem_pestat] mean and std.dev: (340.53, 78.97) [M::mem_pestat] low and high boundaries for proper pairs: (1, 725) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.130 CPU sec, 26.010 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5160, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 341, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (342.16, 78.74) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 27.055 CPU sec, 26.938 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5002, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 344, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (59, 624) [M::mem_pestat] mean and std.dev: (342.49, 80.28) [M::mem_pestat] low and high boundaries for proper pairs: (1, 737) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.975 CPU sec, 23.856 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5042, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 340, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (340.79, 79.62) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.510 CPU sec, 23.344 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5038, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (289, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (73, 613) [M::mem_pestat] mean and std.dev: (342.71, 78.25) [M::mem_pestat] low and high boundaries for proper pairs: (1, 721) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.678 CPU sec, 23.567 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4970, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (67, 617) [M::mem_pestat] mean and std.dev: (342.44, 78.38) [M::mem_pestat] low and high boundaries for proper pairs: (1, 727) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.610 CPU sec, 23.473 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5087, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (290, 347, 400) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (70, 620) [M::mem_pestat] mean and std.dev: (345.58, 80.04) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.653 CPU sec, 23.530 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4981, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 621) [M::mem_pestat] mean and std.dev: (342.02, 81.06) [M::mem_pestat] low and high boundaries for proper pairs: (1, 733) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.563 CPU sec, 23.428 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5063, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.87, 79.11) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.661 CPU sec, 23.550 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5038, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 341, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (68, 618) [M::mem_pestat] mean and std.dev: (343.22, 78.91) [M::mem_pestat] low and high boundaries for proper pairs: (1, 728) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.285 CPU sec, 23.148 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4971, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 341, 399) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 621) [M::mem_pestat] mean and std.dev: (343.30, 79.19) [M::mem_pestat] low and high boundaries for proper pairs: (1, 732) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.677 CPU sec, 23.555 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5023, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (65, 615) [M::mem_pestat] mean and std.dev: (340.14, 78.62) [M::mem_pestat] low and high boundaries for proper pairs: (1, 725) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.536 CPU sec, 23.401 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5025, 5, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.66, 78.54) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.461 CPU sec, 23.341 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4944, 5, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 617) [M::mem_pestat] mean and std.dev: (340.94, 79.99) [M::mem_pestat] low and high boundaries for proper pairs: (1, 728) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.753 CPU sec, 23.584 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4957, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.29, 78.87) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.537 CPU sec, 23.423 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5054, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 339, 394) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 614) [M::mem_pestat] mean and std.dev: (340.16, 78.95) [M::mem_pestat] low and high boundaries for proper pairs: (1, 724) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.311 CPU sec, 23.166 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5078, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.80, 79.82) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 25.771 CPU sec, 25.657 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5040, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (71, 611) [M::mem_pestat] mean and std.dev: (340.73, 77.90) [M::mem_pestat] low and high boundaries for proper pairs: (1, 719) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.502 CPU sec, 24.368 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5032, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.07, 80.48) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.506 CPU sec, 23.370 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5004, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (68, 613) [M::mem_pestat] mean and std.dev: (341.83, 79.66) [M::mem_pestat] low and high boundaries for proper pairs: (1, 722) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 28.061 CPU sec, 27.944 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5150, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (70, 615) [M::mem_pestat] mean and std.dev: (343.33, 78.50) [M::mem_pestat] low and high boundaries for proper pairs: (1, 724) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.676 CPU sec, 24.561 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4994, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (69, 614) [M::mem_pestat] mean and std.dev: (341.60, 78.38) [M::mem_pestat] low and high boundaries for proper pairs: (1, 723) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.564 CPU sec, 23.425 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4927, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (284, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (58, 623) [M::mem_pestat] mean and std.dev: (341.65, 80.64) [M::mem_pestat] low and high boundaries for proper pairs: (1, 736) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.690 CPU sec, 23.577 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5033, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (290, 343, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (78, 608) [M::mem_pestat] mean and std.dev: (343.86, 77.42) [M::mem_pestat] low and high boundaries for proper pairs: (1, 714) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.548 CPU sec, 23.416 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4958, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 341, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.89, 78.66) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.620 CPU sec, 23.499 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4988, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (290, 344, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (80, 605) [M::mem_pestat] mean and std.dev: (342.70, 77.12) [M::mem_pestat] low and high boundaries for proper pairs: (1, 710) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.431 CPU sec, 23.299 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5065, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 340, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (341.76, 79.30) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.475 CPU sec, 23.361 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5078, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 343, 400) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 626) [M::mem_pestat] mean and std.dev: (344.10, 81.01) [M::mem_pestat] low and high boundaries for proper pairs: (1, 739) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.353 CPU sec, 23.218 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4975, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.51, 80.32) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 25.991 CPU sec, 25.861 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5069, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 341, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (63, 618) [M::mem_pestat] mean and std.dev: (341.47, 79.89) [M::mem_pestat] low and high boundaries for proper pairs: (1, 729) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 27.210 CPU sec, 27.097 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5071, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 340, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (68, 613) [M::mem_pestat] mean and std.dev: (341.24, 78.73) [M::mem_pestat] low and high boundaries for proper pairs: (1, 722) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 26.194 CPU sec, 26.084 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5119, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.62, 78.09) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.668 CPU sec, 23.506 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5059, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 398) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (62, 622) [M::mem_pestat] mean and std.dev: (342.41, 78.20) [M::mem_pestat] low and high boundaries for proper pairs: (1, 734) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.516 CPU sec, 23.391 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4964, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (72, 612) [M::mem_pestat] mean and std.dev: (342.47, 79.13) [M::mem_pestat] low and high boundaries for proper pairs: (1, 720) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.584 CPU sec, 23.455 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5004, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.29, 79.73) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.573 CPU sec, 23.453 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4978, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (67, 617) [M::mem_pestat] mean and std.dev: (342.71, 78.68) [M::mem_pestat] low and high boundaries for proper pairs: (1, 727) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.186 CPU sec, 23.046 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5113, 1, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (288, 343, 400) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 624) [M::mem_pestat] mean and std.dev: (343.48, 79.52) [M::mem_pestat] low and high boundaries for proper pairs: (1, 736) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.625 CPU sec, 23.496 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4961, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (63, 618) [M::mem_pestat] mean and std.dev: (341.27, 79.63) [M::mem_pestat] low and high boundaries for proper pairs: (1, 729) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.707 CPU sec, 23.572 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5091, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (285, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (61, 621) [M::mem_pestat] mean and std.dev: (342.08, 79.64) [M::mem_pestat] low and high boundaries for proper pairs: (1, 733) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.382 CPU sec, 23.263 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5023, 3, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 344, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (342.27, 78.54) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.753 CPU sec, 23.608 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4993, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 344, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (67, 617) [M::mem_pestat] mean and std.dev: (342.91, 77.48) [M::mem_pestat] low and high boundaries for proper pairs: (1, 727) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.047 CPU sec, 23.933 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 4985, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 342, 395) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (71, 611) [M::mem_pestat] mean and std.dev: (342.23, 78.20) [M::mem_pestat] low and high boundaries for proper pairs: (1, 719) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.481 CPU sec, 24.322 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5065, 2, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (287, 339, 394) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (73, 608) [M::mem_pestat] mean and std.dev: (340.69, 78.30) [M::mem_pestat] low and high boundaries for proper pairs: (1, 715) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 24.180 CPU sec, 24.058 real sec [M::process] read 99010 sequences (10000010 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5101, 4, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 396) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (66, 616) [M::mem_pestat] mean and std.dev: (341.96, 77.68) [M::mem_pestat] low and high boundaries for proper pairs: (1, 726) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.410 CPU sec, 23.250 real sec [M::process] read 39128 sequences (3951928 bp)... [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 5045, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (286, 342, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (64, 619) [M::mem_pestat] mean and std.dev: (342.37, 79.68) [M::mem_pestat] low and high boundaries for proper pairs: (1, 730) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 99010 reads in 23.403 CPU sec, 23.314 real sec [M::mem_pestat] # candidate unique pairs for (FF, FR, RF, RR): (0, 1930, 0, 0) [M::mem_pestat] skip orientation FF as there are not enough pairs [M::mem_pestat] analyzing insert size distribution for orientation FR... [M::mem_pestat] (25, 50, 75) percentile: (289, 343, 397) [M::mem_pestat] low and high boundaries for computing mean and std.dev: (73, 613) [M::mem_pestat] mean and std.dev: (343.52, 78.11) [M::mem_pestat] low and high boundaries for proper pairs: (1, 721) [M::mem_pestat] skip orientation RF as there are not enough pairs [M::mem_pestat] skip orientation RR as there are not enough pairs [M::mem_process_seqs] Processed 39128 reads in 11.585 CPU sec, 11.491 real sec [main] Version: 0.7.17-r1188 [main] CMD: bwa mem -t 1 /annotations/NCLScan/AllRef.fa /projects/dev-circrna/analysis/simulation/data/finalized_simulations/mixed/1000/thousand_mixed_1.fastq /projects/dev-circrna/analysis/simulation/data/finalized_simulations/mixed/1000/thousand_mixed_2.fastq [main] Real time: 1987.943 sec; CPU: 1994.380 sec # novoalign (AVX2) (V4.00.01 - Build Oct 21 2019 @ 09:49:34) - A short read aligner with qualities. # (C) 2008-2016 Novocraft Technologies Sdn Bhd. # License file: /software/SRC/novocraft/novoalign.lic # Licensed to Hach Lab for Computational Cancer Genomics @University of British Columbia # novoalign -r A 1 -n 30 -d /annotations/NCLScan/AllRef.ndx -f /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.bwa.unmapped_1.fastq /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.bwa.unmapped_2.fastq -o SAM # Default Options: -g 40 -x 2 --matchReward 4 --softclip 40,25 -H 5 -t 0,3.0 --hlimit 8 -v 150 # System 64 CPU Threads, 755G Bytes RAM # Starting at Tue Mar 10 13:36:05 2020 # Interpreting input files as Sanger FASTQ. # Index Build Version: 4.0 # Hash length: 14 # Step size: 2 # Paired Reads: 25103 # Proper Pairs: 1873 ( 7.5%) # Read Sequences: 50206 # Unique Alignment: 3851 ( 7.7%) # Multi Mapped: 44187 (88.0%) # No Mapping Found: 2168 ( 4.3%) # Timers # Elapsed Time: 23.900 (secs.) # CPU Time: 3.46 (min.) # Fragment Length Distribution # From To Count # 30 44 1 # 45 59 2 # 60 74 0 # 75 89 0 # 90 104 0 # 105 119 0 # 120 134 1 # 135 149 1 # 150 164 2 # 165 179 0 # 180 194 0 # 195 209 1 # 210 224 1 # 225 239 18 # 240 254 4 # 255 269 3 # 270 284 2 # 285 299 5 # 300 314 10 # 315 329 14 # 330 344 8 # 345 359 18 # 360 374 16 # 375 389 6 # 390 404 4 # 405 419 5 # 420 434 2 # 435 449 5 # 450 464 3 # 465 479 5 # 480 494 1 # 495 509 1 # 510 524 2 # 525 539 1 # 540 554 2 # 555 569 0 # 570 584 0 # 585 599 1 # 600 614 0 # 615 629 0 # 630 644 2 # 645 659 1 # 660 674 1 # 675 689 1 # 690 704 2 # 705 719 1 # 720 734 4 # 735 749 10 # 750 764 13 # 765 779 14 # 780 794 10 # 795 809 15 # 810 824 10 # 825 839 9 # 840 854 3 # 855 869 12 # 870 884 17 # 885 899 11 # 900 914 11 # 915 929 12 # 930 944 7 # 945 959 6 # 960 974 11 # 975 989 4 # 990 1004 1 # 1005 1019 4 # 1020 1034 10 # 1035 1049 14 # 1050 1064 9 # 1065 1079 6 # 1080 1094 6 # 1095 1109 14 # 1110 1124 20 # 1125 1139 9 # Mean 721, Std Dev 302.3 # Done at Tue Mar 10 13:36:38 2020 PslChimeraFilter v0.4 JunctionSite2BED v0.3 Reading annotations on 1. Reading annotations on 2. Reading annotations on 3. Reading annotations on 4. Reading annotations on 5. Reading annotations on 6. Reading annotations on 7. Reading annotations on X. Reading annotations on 8. Reading annotations on 9. Reading annotations on 11. Reading annotations on 10. Reading annotations on 12. Reading annotations on 13. Reading annotations on 14. Reading annotations on 15. Reading annotations on 16. Reading annotations on 17. Reading annotations on 18. Reading annotations on 20. Reading annotations on 19. Reading annotations on Y. Reading annotations on 22. Reading annotations on 21. Reading annotations on MT. Read 58243 genes, 200243 transcripts and 1199596 exons from the gtf file. # novoindex (4.0) - Universal k-mer index constructor. # (C) 2008 - 2011 NovoCraft Technologies Sdn Bhd # novoindex /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS.ndx /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS.fa # Building with 9-mer and step of 1 bp. # novoindex construction dT = 0.2s # Index memory size 0.009Gbyte. # Done. # novoalign (AVX2) (V4.00.01 - Build Oct 21 2019 @ 09:49:34) - A short read aligner with qualities. # (C) 2008-2016 Novocraft Technologies Sdn Bhd. # License file: /software/SRC/novocraft/novoalign.lic # Licensed to Hach Lab for Computational Cancer Genomics @University of British Columbia # novoalign -r A 1 -g 99 -x 99 -d /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS.ndx -f /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.unmapped_1.fastq -o SAM # Default Options: --matchReward 4 --softclip 40,25 -H 5 -t 0,3.0 --hlimit 8 -v 150 # System 64 CPU Threads, 755G Bytes RAM # Starting at Tue Mar 10 13:39:48 2020 # Interpreting input files as Sanger FASTQ. # Index Build Version: 4.0 # Hash length: 9 # Step size: 1 # Read Sequences: 21320 # Unique Alignment: 3368 (15.8%) # Multi Mapped: 1345 ( 6.3%) # No Mapping Found: 16607 (77.9%) # Timers # Elapsed Time: 0.310 (secs.) # CPU Time: 8.37 (secs.) # Done at Tue Mar 10 13:39:48 2020 # novoalign (AVX2) (V4.00.01 - Build Oct 21 2019 @ 09:49:34) - A short read aligner with qualities. # (C) 2008-2016 Novocraft Technologies Sdn Bhd. # License file: /software/SRC/novocraft/novoalign.lic # Licensed to Hach Lab for Computational Cancer Genomics @University of British Columbia # novoalign -r A 1 -g 99 -x 99 -d /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS.ndx -f /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.unmapped_2.fastq -o SAM # Default Options: --matchReward 4 --softclip 40,25 -H 5 -t 0,3.0 --hlimit 8 -v 150 # System 64 CPU Threads, 755G Bytes RAM # Starting at Tue Mar 10 13:39:48 2020 # Interpreting input files as Sanger FASTQ. # Index Build Version: 4.0 # Hash length: 9 # Step size: 1 # Read Sequences: 21320 # Unique Alignment: 3407 (16.0%) # Multi Mapped: 1297 ( 6.1%) # No Mapping Found: 16616 (77.9%) # Timers # Elapsed Time: 0.308 (secs.) # CPU Time: 8.34 (secs.) # Done at Tue Mar 10 13:39:48 2020 PslChimeraFilter v0.4 JunctionSite2BED v0.3 Reading annotations on 1. Reading annotations on 2. Reading annotations on 3. Reading annotations on 4. Reading annotations on 5. Reading annotations on 6. Reading annotations on 7. Reading annotations on X. Reading annotations on 8. Reading annotations on 9. Reading annotations on 11. Reading annotations on 10. Reading annotations on 12. Reading annotations on 13. Reading annotations on 14. Reading annotations on 15. Reading annotations on 16. Reading annotations on 17. Reading annotations on 18. Reading annotations on 20. Reading annotations on 19. Reading annotations on Y. Reading annotations on 22. Reading annotations on 21. Reading annotations on MT. Read 58243 genes, 200243 transcripts and 1199596 exons from the gtf file. # novoindex (4.0) - Universal k-mer index constructor. # (C) 2008 - 2011 NovoCraft Technologies Sdn Bhd # novoindex /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS2.ndx /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS2.fa # Building with 10-mer and step of 1 bp. # novoindex construction dT = 0.1s # Index memory size 0.030Gbyte. # Done. # novoalign (AVX2) (V4.00.01 - Build Oct 21 2019 @ 09:49:34) - A short read aligner with qualities. # (C) 2008-2016 Novocraft Technologies Sdn Bhd. # License file: /software/SRC/novocraft/novoalign.lic # Licensed to Hach Lab for Computational Cancer Genomics @University of British Columbia # novoalign -r A 1 -t 0,1 -d /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.JS2.ndx -f /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.unmapped_1.fastq /projects/dev-circrna/results/finalized_simulations/NCLscan/mixed/1000/out.main.unmapped_2.fastq --3Prime -o SAM # Default Options: -g 40 -x 2 --matchReward 4 --softclip 40,25 -H 5 --hlimit 8 -v 150 # System 64 CPU Threads, 755G Bytes RAM # Starting at Tue Mar 10 13:42:25 2020 # Interpreting input files as Sanger FASTQ. # Index Build Version: 4.0 # Hash length: 10 # Step size: 1 # Paired Reads: 21320 # Proper Pairs: 8932 (41.9%) # Read Sequences: 42640 # Unique Alignment: 9740 (22.8%) # Multi Mapped: 19432 (45.6%) # No Mapping Found: 13468 (31.6%) # Timers # Elapsed Time: 1.293 (secs.) # CPU Time: 20.88 (secs.) # Fragment Length Distribution # From To Count # 105 119 1 # 120 134 14 # 135 149 7 # 150 164 11 # 165 179 7 # 180 194 9 # 195 209 23 # 210 224 20 # 225 239 13 # 240 254 12 # 255 269 13 # 270 284 28 # 285 299 21 # 300 314 18 # 315 329 16 # 330 344 32 # 345 359 1551 # 360 374 21 # 375 389 38 # 390 404 19 # 405 419 47 # 420 434 46 # 435 449 30 # 450 464 32 # 465 479 36 # 480 494 21 # 495 509 105 # 510 524 44 # 525 539 51 # 540 554 40 # 555 569 36 # 570 584 31 # 585 599 34 # 600 614 56 # 615 629 50 # 630 644 19 # 645 659 32 # 660 674 25 # 675 689 27 # 690 704 39 # 705 719 13 # 720 734 21 # 735 749 13 # 750 764 32 # 765 779 49 # 780 794 15 # 795 809 29 # 810 824 18 # 825 839 16 # 840 854 14 # 855 869 10 # 870 884 9 # 885 899 13 # 900 914 8 # 915 929 5 # 930 944 5 # 945 959 3 # 960 974 5 # 975 989 0 # 990 1004 2 # Mean 440, Std Dev 159.4 # Done at Tue Mar 10 13:42:26 2020 Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Not paired-end! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Not paired-end! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Not paired-end! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Format Error! Not paired-end!