Mercurial > repos > iuc > seqwish

comparison seqwish.xml @ 0:4b1f8668bdff draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
"planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/seqwish/ commit eff85ef0f4297e12deda88b534627b231e218bde"
author iuc
date Wed, 08 Apr 2020 15:23:15 +0000
parents
children 5177ee2f6559
comparison
equal deleted inserted replaced
-1:000000000000 0:4b1f8668bdff
1 <tool id="seqwish" name="seqwish" version="@TOOL_VERSION@" >
2 <description>Alignment to variation graph inducer</description>
3 <macros>
4 <token name="@TOOL_VERSION@">0.4</token>
5 </macros>
6 <requirements>
7 <requirement type="package" version="@TOOL_VERSION@">seqwish</requirement>
8 </requirements>
9 <command detect_errors="exit_code"><![CDATA[
10 seqwish
11 -p '$paf_alns'
12 -s ${ ' '.join(["'%s'" % x for x in $seqs]) }
13 --gfa='$out_gfa'
14 #if $m:
15 -m '$m'
16 #end if
17 --threads=\${GALAXY_SLOTS:-1}
18 #if str($r):
19 -r $r
20 #end if
21 #if str($k):
22 -k $k
23 #end if
24 #if str($B):
25 -B $B
26 #end if
27 ]]></command>
28 <inputs>
29 <param argument="--paf-alns" type="data" format="paf" label="Induce the graph from these PAF formatted alignments" />
30 <param argument="--seqs" type="data" format="fasta,fasta.gz,fastq,fastq.gz" multiple="true" label="The sequences used to generate the alignments" />
31 <param argument="-m" type="data" optional="true" format="txt,tabular" label="Subset the input alignments"
32 help="" />
33 <param argument="-r" type="integer" min="1" optional="true" label="Limit copies of a given input base"
34 help="Limit transitive closure to include no more than N copies of a given input base" />
35 <param argument="-k" type="integer" min="1" optional="true" label="Filter exact matches below this length"
36 help="This can smooth the graph locally and prevent the formation of complex local graph topologies from forming due to differential alignments." />
37 <param argument="-B" type="integer" min="1" optional="true" label="Number of bp to use for transitive closure batch"
38 help="" />
39 </inputs>
40
41 <outputs>
42 <data name="out_gfa" format="gfa1" label="${tool.name} on ${on_string}" />
43 </outputs>
44
45 <tests>
46 <test>
47 <param name="seqs" value="A-3105.fa.gz" />
48 <param name="paf_alns" value="A-3105.paf.gz" />
49 <output name="out_gfa" md5="176f9b4be76a2e69550da9b9c39ac5eb" />
50 </test>
51 <test>
52 <param name="seqs" value="A-3105.fa.gz" />
53 <param name="paf_alns" value="A-3105.paf.gz" />
54 <param name="r" value="3000" />
55 <param name="k" value="1" />
56 <param name="B" value="1000000" />
57 <output name="out_gfa" md5="176f9b4be76a2e69550da9b9c39ac5eb" />
58 </test>
59 </tests>
60 <help><![CDATA[
61 These **seq**uences **wish** they were squished into a graph.
62
63 seqwish implements a lossless conversion from pairwise alignments between sequences to a variation graph encoding the sequences
64 and their alignments. As input we typically take all-versus-all alignments, but the exact structure of the alignment set may
65 be defined in an application specific way. This algorithm uses a series of disk-backed sorts and passes over the alignment
66 and sequence inputs to allow the graph to be constructed from very large inputs that are commonly encountered when working with
67 large numbers of noisy input sequences. Memory usage during construction and traversal is limited by the use of sorted
68 disk-backed arrays and succinct rank/select dictionaries to record a queryable version of the graph.
69 ]]></help>
70 <citations>
71 </citations>
72 </tool>