Mercurial > repos > iuc > flash
comparison flash.xml @ 0:a8e42976aa6b draft
planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/flash commit 48012d1879395ecf1b4e6cd962f325c372164a33
| author | iuc |
|---|---|
| date | Tue, 26 Sep 2017 16:41:51 -0400 |
| parents | |
| children | 7f7be04e2172 |
comparison
equal
deleted
inserted
replaced
| -1:000000000000 | 0:a8e42976aa6b |
|---|---|
| 1 <?xml version="1.0"?> | |
| 2 <tool id="flash" name="FLASH" version="1.2.11"> | |
| 3 <description>adjust length of short reads</description> | |
| 4 <requirements> | |
| 5 <requirement type="package" version="1.2.11">flash</requirement> | |
| 6 </requirements> | |
| 7 <version_command>flash --version | head -n 1</version_command> | |
| 8 <command detect_errors="aggressive"> | |
| 9 <![CDATA[ | |
| 10 flash --threads=\${GALAXY_SLOTS:-1} | |
| 11 -m $min_overlap | |
| 12 -M $max_overlap | |
| 13 -x $max_mismatch_density | |
| 14 $allow_outies | |
| 15 '$forward' '$reverse' | |
| 16 ]]> | |
| 17 </command> | |
| 18 <inputs> | |
| 19 <param format="fastq" name="forward" type="data" label="Forward reads" /> | |
| 20 <param format="fastq" name="reverse" type="data" label="Reverse reads" /> | |
| 21 <param name="min_overlap" argument="--min-overlap" type="integer" optional="true" value="10" label="Minimum overlap" help="The minimum required overlap length between two reads to provide a confident overlap." /> | |
| 22 <param name="max_overlap" argument="--max-overlap" type="integer" optional="true" value="65" label="Maximum overlap" help="Maximum overlap length expected in approximately 90% of read pairs. Overlaps longer than the maximum overlap parameter are still considered as good overlaps, but the mismatch density is calculated over the first max_overlap bases in the overlapped region rather than the entire overlap." /> | |
| 23 <param name="max_mismatch_density" argument="--max-mismatch-density" type="float" optional="true" value="0.25" label="Maximum mismatch density" help="Maximum allowed ratio between the number of mismatched base pairs and the overlap length. Two reads will not be combined with a given overlap if that overlap results in a mismatched base density higher than this value." /> | |
| 24 <param name="allow_outies" argument="--allow-outies" type="boolean" truevalue="--allow-outies" falsevalue="" checked="false" label="Combine read pairs in both orientations" help="FLASH uses the same parameters when trying each orientation. If a read pair can be combined in either orientation, the better-fitting one will be chosen using the same scoring algorithm that FLASH normally uses." /> | |
| 25 </inputs> | |
| 26 <outputs> | |
| 27 <data format="fastq" name="merged_reads" from_work_dir="out.extendedFrags.fastq" label="${tool.name} on ${on_string}: Merged reads" /> | |
| 28 <data format="fastq" name="unmerged_reads_f" from_work_dir="out.notCombined_1.fastq" label="${tool.name} on ${on_string}: Unmerged forward reads" /> | |
| 29 <data format="fastq" name="unmerged_reads_r" from_work_dir="out.notCombined_2.fastq" label="${tool.name} on ${on_string}: Unmerged reverse reads" /> | |
| 30 <data format="tabular" name="hist" from_work_dir="out.hist" label="${tool.name} on ${on_string}: Unmerged reads tabular histogram" /> | |
| 31 <data format="txt" name="histogram" from_work_dir="out.histogram" label="${tool.name} on ${on_string}: Unmerged reads histogram" /> | |
| 32 <data format="tabular" name="hist_in" from_work_dir="out.hist.innie" label="${tool.name} on ${on_string}: Unmerged reads tabular histogram (in)" > | |
| 33 <filter>allow_outies</filter> | |
| 34 </data> | |
| 35 <data format="tabular" name="hist_out" from_work_dir="out.hist.outie" label="${tool.name} on ${on_string}: Unmerged reads tabular histogram (out)" > | |
| 36 <filter>allow_outies</filter> | |
| 37 </data> | |
| 38 <data format="txt" name="histogram_in" from_work_dir="out.histogram.innie" label="${tool.name} on ${on_string}: Unmerged reads histogram (in)" > | |
| 39 <filter>allow_outies</filter> | |
| 40 </data> | |
| 41 <data format="txt" name="histogram_out" from_work_dir="out.histogram.outie" label="${tool.name} on ${on_string}: Unmerged reads histogram (out)" > | |
| 42 <filter>allow_outies</filter> | |
| 43 </data> | |
| 44 </outputs> | |
| 45 <tests> | |
| 46 <test> | |
| 47 <param name="forward" value="flash_forward_in1.fastq" /> | |
| 48 <param name="reverse" value="flash_reverse_in1.fastq" /> | |
| 49 <output name="merged_reads" file="flash_merged_out1.fastq" /> | |
| 50 <output name="unmerged_reads_f" file="flash_unmerged_f_out1.fastq" /> | |
| 51 <output name="unmerged_reads_r" file="flash_unmerged_r_out1.fastq" /> | |
| 52 <output name="hist" file="flash_hist_out1.tabular" /> | |
| 53 <output name="histogram" file="flash_hist_out1.txt" /> | |
| 54 </test> | |
| 55 <test> | |
| 56 <param name="forward" value="flash_forward_in2.fastq" /> | |
| 57 <param name="reverse" value="flash_reverse_in2.fastq" /> | |
| 58 <param name="allow_outies" value="true" /> | |
| 59 <output name="merged_reads" file="flash_merged_out2.fastq" /> | |
| 60 <output name="unmerged_reads_f" file="flash_unmerged_f_out2.fastq" /> | |
| 61 <output name="unmerged_reads_r" file="flash_unmerged_r_out2.fastq" /> | |
| 62 <output name="hist" file="flash_hist_out2.tabular" /> | |
| 63 <output name="histogram" file="flash_hist_out2.txt" /> | |
| 64 <output name="hist_in" file="flash_hist_in_out2.tabular" /> | |
| 65 <output name="histogram_in" file="flash_hist_in_out2.txt" /> | |
| 66 <output name="hist_out" file="flash_hist_out_out2.tabular" /> | |
| 67 <output name="histogram_out" file="flash_hist_out_out2.txt" /> | |
| 68 </test> | |
| 69 </tests> | |
| 70 <help> | |
| 71 <![CDATA[ | |
| 72 FLASH (Fast Length Adjustment of SHort reads) is an accurate and fast tool | |
| 73 to merge paired-end reads that were generated from DNA fragments whose | |
| 74 lengths are shorter than twice the length of reads. Merged read pairs result | |
| 75 in unpaired longer reads, which are generally more desired in genome | |
| 76 assembly and genome analysis processes. | |
| 77 | |
| 78 Briefly, the FLASH algorithm considers all possible overlaps at or above a | |
| 79 minimum length between the reads in a pair and chooses the overlap that | |
| 80 results in the lowest mismatch density (proportion of mismatched bases in | |
| 81 the overlapped region). Ties between multiple overlaps are broken by | |
| 82 considering quality scores at mismatch sites. When building the merged | |
| 83 sequence, FLASH computes a consensus sequence in the overlapped region. | |
| 84 ]]> | |
| 85 </help> | |
| 86 <citations> | |
| 87 <citation type="doi">10.1093/bioinformatics/btr507</citation> | |
| 88 </citations> | |
| 89 </tool> |
