|
1 | 1 | # abismal - another bisulfite mapping algorithm |
2 | 2 |
|
3 | 3 | ## Synopsis |
| 4 | + |
4 | 5 | ```console |
5 | | -$ dnmtools abismal [OPTIONS] input.fq [input-r2.fq] |
| 6 | +dnmtools abismal [OPTIONS] input.fq [input-r2.fq] |
6 | 7 | ``` |
7 | 8 |
|
8 | 9 | # Description |
@@ -53,10 +54,13 @@ potential mapping locations for reads that begin with their sequence. |
53 | 54 | To produce this index run the following command: |
54 | 55 |
|
55 | 56 | ```console |
56 | | -$ abismalidx <genome folder or file> <index file> |
| 57 | +$ dnmtools abismalidx genome.fa genome.idx |
57 | 58 | ``` |
58 | 59 |
|
59 | | -For the human genome, whose size is 3 GB, the resulting index is |
| 60 | +Where `genome.fa` is the name of your reference genome, and `genome.idx` is |
| 61 | +what you decided to name your abismal index file (you can name it anything). |
| 62 | + |
| 63 | +For the human genome hg38 reference, with size 3 GB, the resulting index is |
60 | 64 | approximately 2.5 GB. |
61 | 65 |
|
62 | 66 | ### Decompressing and isolating paired-end reads |
@@ -211,10 +215,10 @@ $ mkdir reads_split |
211 | 215 | $ for i in reads/*.txt; do split -a 3 -d -l 12000000 ${i} reads_split/$(basename $i); done |
212 | 216 | ``` |
213 | 217 |
|
214 | | -Notice that the number of lines per split file is 12M, since we want |
215 | | -3M reads, and there are 4 lines per read. If you split the reads like |
216 | | -this, you will need to "unsplit" them after the mapping is done. This |
217 | | -can be done using the `samtools merge` command. |
| 218 | +Notice that the number of lines per split file is 12M, since we want 3M reads, |
| 219 | +and there are 4 lines per read. If you split the reads like this, you will |
| 220 | +need to "unsplit" them after the mapping is done. This can be done using the |
| 221 | +`samtools merge` command. |
218 | 222 |
|
219 | 223 | Abismal also exists as a standalon program, and more details on |
220 | 224 | abismal are available in its [documentation |
|
0 commit comments