|
32
|
1 <tool id="usearch_fastq_mergepairs" name="usearch fastq_mergepairs" version="0.0.2">
|
|
2
|
2 <description>merging of paired reads</description>
|
|
|
3 <version_command>usearch -version</version_command>
|
|
12
|
4 <command interpreter='bash'>usearch_wrapper.sh
|
|
|
5 usearch
|
|
7
|
6 -fastq_mergepairs '$input_forward'
|
|
|
7 -reverse '$input_reverse'
|
|
17
|
8 #if $minovlen.value != 0
|
|
13
|
9 -fastq_minovlen $minovlen
|
|
7
|
10 #end if
|
|
22
|
11 #if $minmergelen.value != 0
|
|
|
12 -fastq_minmergelen $minmergelen
|
|
|
13 #end if
|
|
24
|
14 #if $maxmergelen.value != 0
|
|
|
15 -fastq_maxmergelen $maxmergelen
|
|
|
16 #end if
|
|
|
17 #if $maxdiffs.value != 0
|
|
|
18 -fastq_maxdiffs $maxdiffs
|
|
|
19 #end if
|
|
|
20 #if $truncqual.value != 0
|
|
|
21 -fastq_truncqual $truncqual
|
|
|
22 #end if
|
|
|
23 #if $minlen.value != 0
|
|
|
24 -fastq_minlen $minlen
|
|
|
25 #end if
|
|
25
|
26 $allowmergestagger
|
|
|
27 -fastq_ascii $ascii
|
|
|
28 -fastq_qmin $qmin
|
|
7
|
29 -fastq_qmax $qmax
|
|
25
|
30 -fastq_qmaxout $qmaxout
|
|
34
|
31 #if $out_format.value == "fastq"
|
|
26
|
32 -fastqout $output
|
|
|
33 #else
|
|
|
34 -fastaout $output
|
|
|
35 #end if
|
|
2
|
36 </command>
|
|
|
37 <inputs>
|
|
33
|
38 <param name="input_forward" type="data" format="fastq,fastqsanger,fastqcssanger" label="1. File with forward reads" />
|
|
|
39 <param name="input_reverse" type="data" format="fastq,fastqsanger,fastqcssanger" label="2. File with reverse reads" />
|
|
|
40 <param name="minovlen" type="integer" value="0" label="3. Minimum length of the overlap" help="'0' means no minimum." />
|
|
|
41 <param name="minmergelen" type="integer" value="0" label="4. Minimum length of the merged read" help="'0' means no minimum." />
|
|
|
42 <param name="maxmergelen" type="integer" value="0" label="5. Maximum length of the merged read" help="'0' means no maximum." />
|
|
|
43 <param name="maxdiffs" type="integer" value="0" label="6. Maximum number of mismatches allowed in the overlap region" help="'0' means any number of mismatches allowed." />
|
|
|
44 <param name="truncqual" type="integer" value="0" label="7. Truncate the forward and reverse reads at the first Q that is equal or less than this value, if present"
|
|
|
45 help="'0' means no quality truncation. This truncation is performed before aligning the pair. With Illumina paired reads, it is recommended to set this to 2 or higher, as low-quality tails will otherwise often cause alignment of the pair to fail." />
|
|
|
46 <param name="minlen" type="integer" value="0" label="8. Minimum length of the forward and reverse read, after truncating per option 7 if applicable" help="'0' means no minimum." />
|
|
27
|
47 <param name="allowmergestagger" type="boolean" truevalue="-fastq_allowmergestagger" falsevalue="" checked="false" label="9. Allow merge of a pair where the alignment is staggered" help="By default, pairs with staggered alignments are discarded." />
|
|
33
|
48 <param name="ascii" type="integer" value="33" label="10. ASCII_BASE constant" help="See http://drive5.com/usearch/manual/fastq_params.html" />
|
|
|
49 <param name="qmin" type="integer" value="0" label="11. Minimum Q score" />
|
|
|
50 <param name="qmax" type="integer" value="41" label="12. Maximum Q score for input files" />
|
|
|
51 <param name="qmaxout" type="integer" value="41" label="13. Maximum Q score for output files" />
|
|
|
52 <param name="out_format" type="select" label="Output format">
|
|
|
53 <option value="fastq">FASTQ</option>
|
|
|
54 <option value="fasta">FASTA</option>
|
|
|
55 </param>
|
|
17
|
56 </inputs>
|
|
2
|
57 <outputs>
|
|
33
|
58 <data format="fastq" name="output" label="Merge output">
|
|
|
59 <change_format>
|
|
|
60 <when input="out_format" value="fasta" format="fasta" />
|
|
|
61 </change_format>
|
|
|
62 </data>
|
|
2
|
63 </outputs>
|
|
|
64 <tests>
|
|
|
65 <test>
|
|
33
|
66 <param name="input_forward" value="fastq_mergepairs_input1.fq" ftype="fastq" />
|
|
|
67 <param name="input_reverse" value="fastq_mergepairs_input2.fq" ftype="fastq" />
|
|
5
|
68 <param name="qmax" value="65" />
|
|
33
|
69 <output name="output" file="fastq_mergepairs_output1.fastq" />
|
|
2
|
70 </test>
|
|
33
|
71 <test>
|
|
|
72 <param name="input_forward" value="fastq_mergepairs_input1.fq" ftype="fastq" />
|
|
|
73 <param name="input_reverse" value="fastq_mergepairs_input2.fq" ftype="fastq" />
|
|
|
74 <param name="minovlen" value="30" />
|
|
|
75 <param name="qmax" value="65" />
|
|
|
76 <param name="out_format" value="fasta" />
|
|
|
77 <output name="output" file="fastq_mergepairs_output2.fasta" />
|
|
|
78 </test>
|
|
|
79 </tests>
|
|
2
|
80 <help>
|
|
|
81 **What it Does**
|
|
|
82
|
|
|
83 Performs merging of paired reads.
|
|
|
84
|
|
31
|
85 Forward and reverse must be in 1:1 correspondence and must appear in the same
|
|
|
86 order in both files. The labels for the forward and reverse read in a given
|
|
|
87 pair must be identical except for a single position where a '1' appears in the
|
|
|
88 forward read label and a '2' appears in the reverse read label.
|
|
2
|
89
|
|
|
90 -----
|
|
|
91
|
|
|
92 **Input formats**
|
|
|
93
|
|
33
|
94 Forward reads::
|
|
2
|
95
|
|
|
96 @IRIS:7:1:29:952#0/1
|
|
|
97 TGAGAAGCAAGAAGAAGGTTGGTTAGTGTTTTGGAG
|
|
|
98 +IRIS:7:1:29:952#0/1
|
|
|
99 aaabaaaaaaaaaaa`aaY`aa^aaa^a_a_`aa``
|
|
|
100
|
|
33
|
101 Reverse reads::
|
|
2
|
102
|
|
|
103 @IRIS:7:1:29:952#0/2
|
|
|
104 GACTCCAAAACACTAACCAACCTTCTTCTTGCTTCT
|
|
|
105 +IRIS:7:1:29:952#0/2
|
|
|
106 aaaabaaaabaaaabbaaaa````__`__^__``__
|
|
|
107
|
|
|
108 -----
|
|
|
109
|
|
|
110 **Output**
|
|
|
111
|
|
|
112 A multiple-fastq file, for example::
|
|
|
113
|
|
|
114 @IRIS:7:1:29:952#0/1
|
|
|
115 TGAGAAGCAAGAAGAAGGTTGGTTAGTGTTTTGGAGTC
|
|
|
116 +
|
|
|
117 aaJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJaa
|
|
|
118
|
|
|
119 ------
|
|
|
120
|
|
|
121 **Manual**
|
|
|
122
|
|
33
|
123 * USEARCH fastq_mergepairs options: http://drive5.com/usearch/manual/fastq_mergepairs.html
|
|
30
|
124 * FASTQ format options: http://drive5.com/usearch/manual/fastq_params.html
|
|
2
|
125
|
|
|
126 **Citation**
|
|
|
127
|
|
|
128 Please cite one of these papers if you use USEARCH in published work.
|
|
|
129
|
|
|
130 Edgar,RC (2010) Search and clustering orders of magnitude faster than BLAST, Bioinformatics 26(19), 2460-2461.
|
|
|
131 doi: 10.1093/bioinformatics/btq461
|
|
|
132 </help>
|
|
|
133 </tool>
|
