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