Mercurial > repos > iuc > mothur_pre_cluster
comparison pre.cluster.xml @ 0:4b5b8a603f52 draft
planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/mothur commit 180a403421967d36f995941b1a4561349d75cfc5
| author | iuc |
|---|---|
| date | Fri, 24 Jun 2016 16:45:27 -0400 |
| parents | |
| children | e277ab688993 |
comparison
equal
deleted
inserted
replaced
| -1:000000000000 | 0:4b5b8a603f52 |
|---|---|
| 1 <tool profile="16.07" id="mothur_pre_cluster" name="Pre.cluster" version="@WRAPPER_VERSION@.0"> | |
| 2 <description>Remove sequences due to pyrosequencing errors</description> | |
| 3 <macros> | |
| 4 <import>macros.xml</import> | |
| 5 </macros> | |
| 6 <expand macro="requirements"/> | |
| 7 <expand macro="version_command"/> | |
| 8 <command detect_errors="aggressive"><![CDATA[ | |
| 9 ## create symlinks to input datasets | |
| 10 ln -s "$fasta" fasta.dat && | |
| 11 ln -s "$name" name.dat && | |
| 12 ln -s "$group" group.dat && | |
| 13 | |
| 14 echo 'pre.cluster( | |
| 15 fasta=fasta.dat, | |
| 16 #if $name.is_of_type("mothur.names"): | |
| 17 name=name.dat, | |
| 18 #elif $name.is_of_type("mothur.count_table"): | |
| 19 count=name.dat, | |
| 20 #end if | |
| 21 #if $group: | |
| 22 group=group.dat, | |
| 23 #end if | |
| 24 diffs=$diffs, | |
| 25 topdown=$topdown, | |
| 26 processors='\${GALAXY_SLOTS:-8}' | |
| 27 )' | |
| 28 | sed 's/ //g' ## mothur trips over whitespace | |
| 29 | mothur | |
| 30 ]]></command> | |
| 31 <inputs> | |
| 32 <param name="fasta" type="data" format="fasta" label="fasta - Sequence Fasta"/> | |
| 33 <param name="name" type="data" format="mothur.names,mothur.count_table" optional="true" label="name file or count table- Sequences Name reference"/> | |
| 34 <param name="group" type="data" format="mothur.groups" optional="true" label="group - Sequences Name reference"/> | |
| 35 <param name="diffs" type="integer" value="1" min="0" label="diffs - Number of mismatched bases to allow between sequences in a group (default 1)"/> | |
| 36 <param name="topdown" type="boolean" truevalue="true" falsevalue="false" checked="false" label="allows you to specify whether to cluster from largest abundance to smallest or vice versa. Default =T, which is largest to smallest"/> | |
| 37 </inputs> | |
| 38 <outputs> | |
| 39 <expand macro="logfile-output"/> | |
| 40 <data name="fasta_out" format_source="fasta" from_work_dir="fasta*.precluster.dat" label="${tool.name} on ${on_string}: precluster.fasta"/> | |
| 41 <data name="names_out" format="mothur.names" from_work_dir="fasta*.precluster.names" label="${tool.name} on ${on_string}: precluster.names"/> | |
| 42 <data name="map_out" format="tabular" from_work_dir="fasta*.precluster.map" label="${tool.name} on ${on_string}: precluster.map"/> | |
| 43 </outputs> | |
| 44 <tests> | |
| 45 <test><!-- test with fasta and names file --> | |
| 46 <param name="fasta" value="amazon.fasta_head" ftype="fasta"/> | |
| 47 <param name="name" value="amazon.head.names" ftype="mothur.names"/> | |
| 48 <output name="fasta_out" md5="d5d37ace0f2a5c020edd0aa9eb7aca9b" ftype="fasta"/> | |
| 49 <output name="names_out" md5="51090fe5e111920ec1003c2073532d96" ftype="mothur.names"/> | |
| 50 <output name="map_out" md5="c2ca7b0d45aa3881c7bd5cb8a44c853b" ftype="tabular"/> | |
| 51 <expand macro="logfile-test"/> | |
| 52 </test> | |
| 53 </tests> | |
| 54 <help> | |
| 55 <![CDATA[ | |
| 56 | |
| 57 @MOTHUR_OVERVIEW@ | |
| 58 | |
| 59 **Command Documenation** | |
| 60 | |
| 61 The pre.cluster_ command implements a pseudo-single linkage algorithm with the goal of removing sequences that are likely due to pyrosequencing errors. The basic idea is that abundant sequences are more likely to generate erroneous sequences than rare sequences. With that in mind, the algorithm proceeds by ranking sequences in order of their abundance. Then we walk through the list of sequences looking for rarer sequences that are within some threshold of the original sequence. Those that are within the threshold are merged with the larger sequence. The original Huse method performs this task on a distance matrix, whereas we do it based on the original sequences. The advantage of our approach is that the algorithm works on aligned sequences instead of a distance matrix. This is advantageous because by pre-clustering you remove a large number of sequences making the distance calculation much faster. | |
| 62 | |
| 63 .. _pre.cluster: http://www.mothur.org/wiki/Pre.cluster | |
| 64 | |
| 65 v1.24.0: Updated to mothur 1.33, added count and topdown parameter | |
| 66 ]]> | |
| 67 </help> | |
| 68 <expand macro="citations"/> | |
| 69 </tool> |