|
0
|
1 <?xml version="1.0"?>
|
|
|
2 <tool_dependency>
|
|
|
3 <package name="scythe" version="0.991">
|
|
|
4 <install version="1.0">
|
|
|
5 <actions>
|
|
|
6 <action type="shell_command">git clone git://github.com/vsbuffalo/scythe.git</action>
|
|
|
7 <action type="shell_command">git reset --hard 9b965ee399a18caf1f96e433f78d405620e3a1df</action>
|
|
|
8 <action type="shell_command">make</action>
|
|
|
9 <action type="move_file">
|
|
|
10 <source>scythe</source>
|
|
|
11 <destination>$INSTALL_DIR</destination>
|
|
|
12 </action>
|
|
|
13 <action type="set_environment">
|
|
|
14 <environment_variable name="PATH" action="prepend_to">$INSTALL_DIR</environment_variable>
|
|
|
15 </action>
|
|
|
16 </actions>
|
|
|
17 </install>
|
|
|
18 <readme>
|
|
|
19 Scythe - A Bayesian adapter trimmer
|
|
|
20 Scythe and all supporting documentation Copyright (c) Vince Buffalo, 2011-2012
|
|
|
21 https://github.com/vsbuffalo/scythe
|
|
|
22
|
|
|
23 Scythe uses a Naive Bayesian approach to classify contaminant substrings in sequence reads. It considers quality information, which can make it robust in picking out 3'-end adapters, which often include poor quality bases.
|
|
|
24
|
|
|
25 Most next generation sequencing reads have deteriorating quality towards the 3'-end. It's common for a quality-based trimmer to be employed before mapping, assemblies, and analysis to remove these poor quality bases. However, quality-based trimming could remove bases that are helpful in identifying (and removing) 3'-end adapter contaminants. Thus, it is recommended you run Scythe before quality-based trimming, as part of a read quality control pipeline.
|
|
|
26
|
|
|
27 The Bayesian approach Scythe uses compares two likelihood models: the probability of seeing the matches in a sequence given contamination, and not given contamination. Given that the read is contaminated, the probability of seeing a certain number of matches and mismatches is a function of the quality of the sequence. Given the read is not contaminated (and is thus assumed to be random sequence), the probability of seeing a certain number of matches and mismatches is chance. The posterior is calculated across both these likelihood models, and the class (contaminated or not contaminated) with the maximum posterior probability is the class selected.
|
|
|
28
|
|
|
29 </readme>
|
|
|
30 </package>
|
|
|
31 </tool_dependency>
|
|
|
32
|
