Mercurial > repos > drosofff > msp_oases

comparison oases_optimiser.xml @ 0:eedbe32980bb draft

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
planemo upload for repository https://bitbucket.org/drosofff/gedtools/
author drosofff
date Sun, 21 Jun 2015 14:38:06 -0400
parents
children 070f9de358fc
comparison
equal deleted inserted replaced
-1:000000000000 0:eedbe32980bb
1 <tool id="oasesoptimiserv" name="Oases_optimiser" version="1.1.0">
2 <description>Auto optimise de novo RNA-seq Oases/Velvet assembly</description>
3 <requirements>
4 <requirement type="package" version="1.2.10_9adf09f7ded7fedaf6b0e5e4edf9f46602e263d3">velvet</requirement>
5 <requirement type="set_environment">PATH</requirement>
6 <requirement type="package" version="0.2.08_7a32460a60929b510037952ae815bb6e29b68123">oases</requirement>
7 </requirements>
8 <command interpreter="python">
9 oases_optimiser.py '$start_hash_length' '$end_hash_length'
10 '#for $i in $inputs
11 ${i.input}
12 #end for
13 '
14 '$transcripts'
15 </command>
16
17 <inputs>
18 <param label="Start Hash Length" name="start_hash_length" type="select" help="k-mer length in base pairs of the words being hashed. Shorter hash lengths (i.e. less than 31) may cause out-of-memory problems.">
19 <option value="11" selected="yes">11</option>
20 <option value="13">13</option>
21 <option value="15">15</option>
22 <option value="17">17</option>
23 <option value="19">19</option>
24 <option value="21">21</option>
25 <option value="23">23</option>
26 <option value="25">25</option>
27
28 </param>
29 <param label="End Hash Length" name="end_hash_length" type="select" help="k-mer length in base pairs of the words being hashed.">
30 <option value="25">25</option>
31 <option value="27">27</option>
32 <option value="29">29</option>
33 <option value="31">31</option>
34 <option value="33">33</option>
35 <option value="35">35</option>
36 </param>
37
38
39
40 <repeat name="inputs" title="Input Files">
41 <param name="input" type="data" format="fasta" label="Dataset: short reads, fasta format"/>
42 </repeat>
43 </inputs>
44
45 <outputs>
46 <data format="fasta" name="transcripts" label="${tool.name} on ${on_string}: Denovo assembled transcripts"/>
47 </outputs>
48
49 <help>
50 **Oases Optimiser Overview**
51
52 Oases_ is a de novo transcriptome assembler specially designed to work with short reads. It is an extension of Velvet developed by Daniel Zerbino and Ewan Birney at the European Bioinformatics Institute (EMBL-EBI), near Cambridge, in the United Kingdom.
53
54 Provide all the information about insert lengths and their standard deviation as
55 possible (identical to Velvet). In the advanced oases options you should set the -ins_length flag when using paired-end reads (e.g. -ins_length 200 -ins_length_sd 100). If you do not do this, then paired-end information will not be used by Oases!
56
57 ----------------------------------------------------------------------------------
58
59 Oases produces a number of output files, which correspond to the different algorithms
60 being run succesively on the data. In the above example, you would find:
61
62 transcripts.fa
63 A FASTA file containing the transcripts imputed directly from trivial
64 clusters of contigs (loci with less than two transcripts and Confidence Values = 1)
65 and the highly expressed transcripts imputed by dynamic
66 programming (loci with more than 2 transcripts and Confidence Values less than 1).
67
68 splicing_events.txt
69 A hybrid file which describes the contigs contained in each locus in FASTA
70 format, interlaced with one line descriptions of splicing events using the
71 AStalavista nomenclature*.
72
73 Read the Oases `documentation`__ for details on using the Oases Assembler.
74
75 .. _Velvet: http://www.ebi.ac.uk/~zerbino/oases/
76
77 .. __: http://www.ebi.ac.uk/~zerbino/oases/Manual.txt
78
79 ------
80
81 **Other outputs (as per Velvet)**
82
83
84 **Contigs**
85
86 The *contigs.fa* file.
87 This fasta file contains the sequences of the contigs longer than 2k, where k is the word-length used in velveth. If you have specified a min contig lgth threshold, then the contigs shorter than that value are omitted.
88 Note that the length and coverage information provided in the header of each contig should therefore be understood in k-mers and in k-mer coverage (cf. 5.1) respectively.
89 The N's in the sequence correspond to gaps between scaffolded contigs. The number of N's corresponds to the estimated length of the gap. For reasons of compatibility with the archives, any gap shorter than 10bp is represented by a sequence of 10 N's.
90
91 **Stats**
92
93 The *stats.txt* file.
94 This file is a simple tabbed-delimited description of the nodes. The column names are pretty much self-explanatory. Note however that node lengths are given in k-mers. To obtain the length in nucleotides of each node you simply need to add k - 1, where k is the word-length used in velveth.
95 The in and out columns correspond to the number of arcs on the 5' and 3' ends of the contig respectively.
96 The coverages in columns short1 cov, short1 Ocov, short2 cov, and short2 Ocov are provided in k-mer coverage (5.1).
97 Also, the difference between # cov and # Ocov is the way these values are computed. In the first count, slightly divergent sequences are added to the coverage tally. However, in the second, stricter count, only the sequences which map perfectly onto the consensus sequence are taken into account.
98
99 **LastGraph**
100
101 The *LastGraph* file.
102 This file describes in its entirety the graph produced by Velvet.
103
104 **AMOS.afg**
105 The *velvet_asm.afg* file.
106 This file is mainly designed to be read by the open-source AMOS genome assembly package. Nonetheless, a number of programs are available to transform this kind of file into other assembly file formats (namely ACE, TIGR, Arachne and Celera). See http://amos.sourceforge.net/ for more information.
107 The file describes all the contigs contained in the contigs.fa file (cf 4.2.1).
108
109 **Advanced options**
110 -ins_length integer : expected distance between two paired-end reads in the first short-read dataset (default: no read pairing)
111 -ins_length2 integer : expected distance between two paired-end reads in the second short-read dataset (default: no read pairing)
112 -ins_length_long integer : expected distance between two long paired-end reads (default: no read pairing)
113 -ins_length*_sd integer : est. standard deviation of respective dataset (default: 10% of corresponding length)
114 -scaffolding yes|no : scaffolding of contigs used paired end information (default: on)
115 -max_branch_length integer : maximum length in base pair of bubble (default: 100)
116 -max_divergence floating-point : maximum divergence rate between two branches in a bubble (default: 0.2)
117 -max_gap_count integer : maximum number of gaps allowed in the alignment of the two branches of a bubble (default: 3)
118 -min_pair_count integer : minimum number of paired end connections to justify the scaffolding of two long contigs (default: 10)
119 -max_coverage floating point : removal of high coverage nodes AFTER tour bus (default: no removal)
120 -long_mult_cutoff int : minimum number of long reads required to merge contigs (default: 2)
121 -min_trans_length
122 simple threshold on output transcript length
123 -cov_cutoff
124 minimum number of times a k-mer has to be observed to be used in the
125 assembly (just like in Velvet) [default=3]
126 -min_pair_cov
127 minimum number of times two contigs must be connected by reads or read pairs to be clustered together [default=4]
128 -paired_cutoff
129 minimum ratio between the numbers of observed and expected connecting
130 read pairs between two contigs [default=0.1]
131
132
133
134 **Hash Length**
135
136 The hash length, also known as k-mer length, corresponds to the length, in base pairs, of the words being hashed.
137
138 The hash length is the length of the k-mers being entered in the hash table. Firstly, you must observe three technical constraints::
139
140 # it must be an odd number, to avoid palindromes. If you put in an even number, Velvet will just decrement it and proceed.
141 # it must be below or equal to MAXKMERHASH length (cf. 2.3.3, by default 31bp), because it is stored on 64 bits
142 # it must be strictly inferior to read length, otherwise you simply will not observe any overlaps between reads, for obvious reasons.
143
144 Now you still have quite a lot of possibilities. As is often the case, it's a trade- off between specificity and sensitivity. Longer kmers bring you more specificity (i.e. less spurious overlaps) but lowers coverage (cf. below). . . so there's a sweet spot to be found with time and experience.
145 We like to think in terms of "k-mer coverage", i.e. how many times has a k-mer been seen among the reads. The relation between k-mer coverage Ck and standard (nucleotide-wise) coverage C is Ck = C # (L - k + 1)/L where k is your hash length, and L you read length.
146 Experience shows that this kmer coverage should be above 10 to start getting decent results. If Ck is above 20, you might be "wasting" coverage. Experience also shows that empirical tests with different values for k are not that costly to run! VelvetOptimiser automates these tests for you.
147
148
149 **Velvetg options**
150
151
152
153 **Input Files**
154
155 This Velvet wrapper works only with fasta format, non-paired-end reads.
156
157 Supported file formats are::
158
159 fasta
160
161 Read categories are::
162
163 short (default)
164
165 </help>
166 </tool>