|
0
|
1 <?xml version="1.0" encoding="UTF-8" ?>
|
|
|
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
|
|
|
3 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
|
|
|
4
|
|
|
5 <html xmlns="http://www.w3.org/1999/xhtml">
|
|
|
6
|
|
|
7 <head>
|
|
|
8 <title>README.html</title>
|
|
|
9
|
|
|
10 </head>
|
|
|
11
|
|
|
12 <body>
|
|
|
13
|
|
|
14 <h1>RepeatExplorer utilities</h1>
|
|
|
15 <p>This repository include utilities for preprocessing of NGS data to suitable format for RepeatExplorer and TAREAN
|
|
|
16 analysis. Each tool include also XML file which define tool interface for Galaxy environment</p>
|
|
|
17 <h2>Available tools</h2>
|
|
|
18 <h3>Paired fastq reads filtering and interlacing</h3>
|
|
|
19 <p>tool definition file: <code>paired_fastq_filtering.xml</code></p>
|
|
|
20 <p>This tool is designed to make memory efficient preprocessing of two fastq files. Output of this file can be used as input of RepeatExplorer clustering. Input files can be in GNU zipped archive (.gz extension). Reads are filtered based on the quality, presence of N bases and adapters. Two input fastq files are procesed in parallel. Only complete pair are kept. As the input files are process in chunks, it is required that pair reads are complete and in the same order in both input files. All reads which pass the quality filter fill be writen into output files. If sampling is specified, only sample of sequences will be returned. Cutadapt us run with this options:</p>
|
|
|
21 <p><code>--anywhere='AATGATACGGCGACCACCGAGATCTACACTCTTTCCCTACACGACGCTCTTCCGATCT'
|
|
|
22 --anywhere='AGATCGGAAGAGCGTCGTGTAGGGAAAGAGTGTAGATCTCGGTGGTCGCCGTATCATT'
|
|
|
23 --anywhere='GATCGGAAGAGCACACGTCTGAACTCCAGTCAC'
|
|
|
24 --anywhere='ATCTCGTATGCCGTCTTCTGCTTG'
|
|
|
25 --anywhere='CAAGCAGAAGACGGCATACGAGAT'
|
|
|
26 --anywhere='GTGACTGGAGTTCAGACGTGTGCTCTTCCGATC'
|
|
|
27 --error-rate=0.05
|
|
|
28 --times=1 --overlap=15 --discard</code></p>
|
|
|
29 <p>Order of fastq files processing</p>
|
|
|
30 <ol>
|
|
|
31 <li>Trimming (optional)</li>
|
|
|
32 <li>Filter by quality</li>
|
|
|
33 <li>Discard single reads, keep complete pairs</li>
|
|
|
34 <li>Cutadapt filtering</li>
|
|
|
35 <li>Discard single reads, keep complete pairs</li>
|
|
|
36 <li>Sampling (optional)</li>
|
|
|
37 <li>Interlacing two fasta files</li>
|
|
|
38 </ol>
|
|
|
39 <h3>single fastq reads filtering</h3>
|
|
|
40 <p>tool definition file: <code>single_fastq_filtering.xml</code></p>
|
|
|
41 <p>This tool is designed to perform preprocessing
|
|
|
42 of fastq file. Input files can be in GNU zipped archive (.gz extension). Reads
|
|
|
43 are filtered based on the quality, presence of N bases and adapters. All reads
|
|
|
44 which pass the quality filter fill be writen into output files. If sampling is
|
|
|
45 specified, only sample of sequences will be returned. </p>
|
|
|
46 <h3>fasta afixer</h3>
|
|
|
47 <p>tool definition file: <code>fasta_affixer.xml</code></p>
|
|
|
48 <p>Tool for appending prefix and suffix to sequences names in fasta formated sequences. This tool is useful
|
|
|
49 if you want to do comparative analysis with RepeatExplorer and need to
|
|
|
50 append sample codes to sequence identifiers</p>
|
|
|
51 <h2>Dependencies</h2>
|
|
|
52 <p>R programming environment with installed packages <em>optparse</em> and <em>ShortRead</em> (Bioconductor)
|
|
|
53 python3
|
|
|
54 cutadapt</p>
|
|
|
55 <h2>License</h2>
|
|
|
56 <p>Copyright (c) 2012 Petr Novak (petr@umbr.cas.cz), Jiri Macas and Pavel Neumann,
|
|
|
57 Laboratory of Molecular Cytogenetics(http://w3lamc.umbr.cas.cz/lamc/)
|
|
|
58 Institute of Plant Molecular Biology, Biology Centre AS CR, Ceske Budejovice, Czech Republic</p>
|
|
|
59 <p>This program is free software: you can redistribute it and/or modify
|
|
|
60 it under the terms of the GNU General Public License as published by
|
|
|
61 the Free Software Foundation, either version 3 of the License, or
|
|
|
62 (at your option) any later version.</p>
|
|
|
63 <p>This program is distributed in the hope that it will be useful,
|
|
|
64 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
65 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
66 GNU General Public License for more details.
|
|
|
67 You should have received a copy of the GNU General Public License
|
|
|
68 along with this program. If not, see <a href="http://www.gnu.org/licenses/">http://www.gnu.org/licenses/</a>.</p>
|
|
|
69 </body>
|
|
|
70 </html>
|
