|
0
|
1 <tool id="dante" name="Domain based ANnotation of Transposable Elements - DANTE" version="1.0.0">
|
|
|
2 <description> Tool for annotation of transposable elements based on the similarity to conserved protein domains database. </description>
|
|
|
3 <requirements>
|
|
|
4 <requirement type="package">last</requirement>
|
|
|
5 <requirement type="package">numpy</requirement>
|
|
3
|
6 <requirement type="package" version="1.0">rexdb</requirement>
|
|
0
|
7 </requirements>
|
|
|
8 <stdio>
|
|
|
9 <regex match="Traceback" source="stderr" level="fatal" description="Unknown error" />
|
|
|
10 <regex match="error" source="stderr" level="fatal" description="Unknown error" />
|
|
|
11 </stdio>
|
|
|
12 <command>
|
|
|
13 python3 ${__tool_directory__}/dante.py --query ${input} --domain_gff ${DomGff}
|
|
3
|
14 --protein_database \${REXDB}/${db_type}_pdb
|
|
0
|
15 --classification ${__tool_directory__ }/tool-data/protein_domains/${db_type}_class
|
|
|
16 </command>
|
|
|
17 <inputs>
|
|
|
18 <param format="fasta" type="data" name="input" label="Choose your input sequence" help="Input DNA must be in proper fasta format, multi-fasta containing more sequences is allowed" />
|
|
|
19
|
|
|
20 <param name="db_type" type="select" label="Select taxon and protein domain database version (REXdb)" help="">
|
|
|
21 <options from_file="rexdb_versions.loc">
|
|
|
22 <column name="name" index="0"/>
|
|
|
23 <column name="value" index="1"/>
|
|
|
24 </options>
|
|
|
25 </param>
|
|
|
26 </inputs>
|
|
|
27
|
|
|
28 <outputs>
|
|
|
29 <data format="gff3" name="DomGff" label="Unfiltered GFF3 file of ALL protein domains from dataset ${input.hid}" />
|
|
|
30 </outputs>
|
|
|
31 <help>
|
|
|
32
|
|
|
33 THIS IS A PRIMARY OUTPUT THAT SHOULD UNDERGO FURTHER QUALITY FILTERING TO GET RID OFF POTENTIAL FALSE POSITIVE DOMAINS
|
|
|
34
|
|
|
35 **WHAT IT DOES**
|
|
|
36
|
|
|
37 This tool uses external aligning programme `LAST`_ and RepeatExplorer database of TE protein domains(REXdb) (Viridiplantae and Metazoa)
|
|
|
38
|
|
|
39 .. _LAST: http://last.cbrc.jp/
|
|
|
40
|
|
|
41 *Lastal* runs similarity search to find hits between query DNA sequence and our database of protein domains from all Viridiplantae repetitive elements. Hits with overlapping positions in the sequence (even through other hits) forms a cluster which represents one potential protein domain. Strand orientation is taken into consideration when forming the clusters which means each cluster is built from forward or reverse stranded hits exclusively. The clusters are subsequently processed separately; within one cluster positions are scanned base-by-base and classification strings are assigned for each of them based on the database sequences which were mapped on that place. These asigned classification strings consist of a domain type as well as class and lineage of the repetitive element where the database protein comes from. Different classification levels are separated by "|" character. Every hit is scored according to the scoring matrix used for DNA-protein alignment (BLOSUM80). For single position only the hits reaching certain percentage (80% by default) of the overall best score within the whole cluster are reported. One cluster of overlapping hits represents one domain region and is recorded as one line in the resulting GFF3 file. Regarding the classition strings assigned to one region (cluster) there are three situations that can occur:
|
|
|
42
|
|
|
43 1. There is a single classification string assigned to each position as well as classifications along all the positions in the region are mutually uniform, in this case domain's final classification is equivalent to this unique classification.
|
|
|
44 2. There are multiple classification strings assigned to one cluster, i.e. one domain, which leads to classification to the common (less specific) level of all the strings
|
|
|
45 3. There is a conflict at the domain type level, domains are reported with slash (e.g. RT/INT) and the classification is in this case ambiguous
|
|
|
46
|
|
|
47 **There are 2 outputs produced by this tool:**
|
|
|
48
|
|
|
49 1. GFF3 file of all proteins domains built from all hits found by LAST. Domains are reported per line as regions (start - end) on the original DNA sequence including the seq ID, alignment score and strand orientation. The last "Attributes" column contains several semicolon-separated information related to annotation, repetitive classification, alignment and its quality. This file can undergo further filtering using *Protein Domain Filter* tool
|
|
|
50
|
|
|
51 - Attributes reported always:
|
|
|
52
|
|
|
53 Name
|
|
|
54 type of domain; if ambiguous reported with slash
|
|
|
55
|
|
|
56 Final_classification
|
|
|
57 definite classification based on all partial classifications of Region_hits_classifications attribute or
|
|
|
58 "Ambiguous_domain" when there is an ambiguous domain type
|
|
|
59
|
|
|
60 Region_Hits_Classifications
|
|
|
61 all hits classifications (comma separated) from a certain domain region that reach the set score threshold; in case of multiple annotations the square brackets indicate the number of bases having this particular classification
|
|
|
62
|
|
|
63 - Attributes only reported in case of unambiguous domain type (all the attributes including quality information are related to the Best_Hit of the region):
|
|
|
64
|
|
|
65 Best_hit
|
|
|
66 classification and position of the best alignment with the highest score within the cluster; in the square brackets is the percentage of the whole cluster range that this best hit covers
|
|
|
67
|
|
|
68 Best_Hit_DB_Pos
|
|
|
69 showing which part of the original datatabase domain corresponding to the Best Hit was aligned on query DNA (e.g. **Best_Hit_DB_Pos=17:75of79** means the Best Hit reported in GFF represents region from 17th to 75th of total 79 aminoacids in the original domain from the database)
|
|
|
70
|
|
|
71 DB_Seq
|
|
|
72 database protein sequence of the best hit mapped to the query DNA
|
|
|
73
|
|
|
74 Query_Seq
|
|
|
75 alignment sequence of the query DNA for the best hit
|
|
|
76
|
|
|
77 Identity
|
|
|
78 ratio of identical amino acids in alignment sequence to the length of alignment
|
|
|
79
|
|
|
80 Similarity
|
|
|
81 ratio of alignment positions with positive score (according to the scoring matrix) to the length of alignment
|
|
|
82
|
|
|
83 Relat_Length
|
|
|
84 ratio of gapless length of the aligned protein sequence to the whole length of the database protein
|
|
|
85
|
|
|
86 Relat_Interruptions
|
|
|
87 number of the interruptions (frameshifts + stop codons) in aligned translated query sequence per each starting 100 AA
|
|
|
88
|
|
|
89 Hit_to_DB_Length
|
|
|
90 proportion of alignment length to the original length of the protein domain from database
|
|
|
91
|
|
|
92
|
|
|
93
|
|
|
94 !NOTE: Tool can in average process 0.5 Gbps of the DNA sequence per day. This is only a rough estimate and it is highly dependent on input data (repetive elements occurence) as well as computing resources. Maximum running time of the tool is 7 days.
|
|
|
95
|
|
|
96 </help>
|
|
|
97 </tool>
|
|
|
98
|
