mutation predictions | marginal predictions | summary statistics | genome diff | command line log
|
breseq version 0.33.1 revision 8505477f25b3
mutation predictions | marginal predictions | summary statistics | genome diff | command line log |
| read file | reads | bases | passed filters | average | longest | mapped | |
|---|---|---|---|---|---|---|---|
| errors | Plate-3-BOP27-ACNB-END-3_S52_L001_R1_001.good.fq | 566,635 | 77,428,834 | 100.0% | 136.6 bases | 149 bases | 97.5% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L001_R2_001.good.fq | 566,635 | 77,070,035 | 100.0% | 136.0 bases | 149 bases | 98.3% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L002_R1_001.good.fq | 522,040 | 71,383,856 | 100.0% | 136.7 bases | 149 bases | 97.6% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L002_R2_001.good.fq | 522,040 | 71,073,243 | 100.0% | 136.1 bases | 149 bases | 98.1% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L003_R1_001.good.fq | 552,622 | 75,446,568 | 100.0% | 136.5 bases | 149 bases | 97.4% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L003_R2_001.good.fq | 552,622 | 75,098,560 | 100.0% | 135.9 bases | 149 bases | 98.1% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L004_R1_001.good.fq | 567,910 | 77,537,274 | 100.0% | 136.5 bases | 149 bases | 97.7% |
| errors | Plate-3-BOP27-ACNB-END-3_S52_L004_R2_001.good.fq | 567,910 | 77,214,968 | 100.0% | 136.0 bases | 149 bases | 98.1% |
| total | 4,418,414 | 602,253,338 | 100.0% | 136.3 bases | 149 bases | 97.9% |
| seq id | length | fit mean | fit dispersion | % mapped reads | description | ||
|---|---|---|---|---|---|---|---|
| coverage | distribution | NC_000913 | 4,641,652 | 125.7 | 4.7 | 100.0% | Escherichia coli str. K-12 substr. MG1655, complete genome. |
| total | 4,641,652 | 100.0% |
fit dispersion is the ratio of the variance to the mean for the negative binomial fit. It is =1 for Poisson and >1 for over-dispersed data.
| option | limit | actual |
|---|---|---|
| Number of alignment pairs examined for constructing junction candidates | ≤ 100000 | 17696 |
| Coverage evenness (position-hash) score of junction candidates | ≥ 2 | ≥ 3 |
| Test this many junction candidates (n). May be smaller if not enough passed the coverage evenness threshold | 100 ≤ n ≤ 5000 | 73 |
| Total length of all junction candidates (factor times the reference genome length) | ≤ 0.1 | 0.005 |
| reference sequence | pr(no read start) |
|---|---|
| NC_000913 | 0.67259 |
pr(no read start) is the probability that there will not be an aligned read whose first base matches a given position on a given strand.
| option | value |
|---|---|
| Coverage evenness (position-hash) score of predicted junctions must be | ≥ 3 |
| Skew score of predicted junction (−log10 probability of unusual coverage evenness) must be | ≤ 0 |
| Number of bases that at least one read must overlap each uniquely aligned side of a predicted junction | ≥ 6 |
| option | value |
|---|---|
| Mode | Full Polymorphism |
| Ploidy | 1 (haploid) |
| Consensus mutation E-value cutoff | 10 |
| Consensus frequency cutoff | 0.75 |
| Consensus minimum variant coverage each strand | OFF |
| Consensus minimum total coverage each strand | OFF |
| Consensus minimum variant coverage | OFF |
| Consensus minimum total coverage | OFF |
| Polymorphism E-value cutoff | 2 |
| Polymorphism frequency cutoff | 0.05 |
| Polymorphism minimum variant coverage each strand | 2 |
| Polymorphism minimum total coverage each strand | OFF |
| Polymorphism minimum variant coverage | OFF |
| Polymorphism minimum total coverage | OFF |
| Polymorphism bias cutoff | OFF |
| Predict indel polymorphisms | YES |
| Skip indel polymorphisms in homopolymers runs of | ≥3 bases |
| Skip base substitutions when they create a homopolymer flanked on each side by | ≥5 bases |
| program | version |
|---|---|
| bowtie2 | 2.2.6 |
| R | 3.4.4 |
| step | start | end | elapsed |
|---|---|---|---|
| Read and reference sequence file input | 20:52:34 10 Sep 2020 | 20:53:40 10 Sep 2020 | 1 minute 6 seconds |
| Read alignment to reference genome | 20:53:40 10 Sep 2020 | 21:01:51 10 Sep 2020 | 8 minutes 11 seconds |
| Preprocessing alignments for candidate junction identification | 21:01:51 10 Sep 2020 | 21:02:58 10 Sep 2020 | 1 minute 7 seconds |
| Preliminary analysis of coverage distribution | 21:02:58 10 Sep 2020 | 21:05:24 10 Sep 2020 | 2 minutes 26 seconds |
| Identifying junction candidates | 21:05:24 10 Sep 2020 | 21:05:47 10 Sep 2020 | 23 seconds |
| Re-alignment to junction candidates | 21:05:47 10 Sep 2020 | 21:08:18 10 Sep 2020 | 2 minutes 31 seconds |
| Resolving best read alignments | 21:08:18 10 Sep 2020 | 21:10:03 10 Sep 2020 | 1 minute 45 seconds |
| Creating BAM files | 21:10:03 10 Sep 2020 | 21:12:17 10 Sep 2020 | 2 minutes 14 seconds |
| Tabulating error counts | 21:12:17 10 Sep 2020 | 21:13:03 10 Sep 2020 | 46 seconds |
| Re-calibrating base error rates | 21:13:03 10 Sep 2020 | 21:13:06 10 Sep 2020 | 3 seconds |
| Examining read alignment evidence | 21:13:06 10 Sep 2020 | 21:51:32 10 Sep 2020 | 38 minutes 26 seconds |
| Polymorphism statistics | 21:51:32 10 Sep 2020 | 21:51:33 10 Sep 2020 | 1 second |
| Output | 21:51:33 10 Sep 2020 | 21:51:55 10 Sep 2020 | 22 seconds |
| Total | 59 minutes 21 seconds | ||
