<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/37674?offset=210</link>
	<atom:link href="https://bioinformaticsonline.com/related/37674?offset=210" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26309/ratt</guid>
	<pubDate>Sun, 07 Feb 2016 16:09:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26309/ratt</link>
	<title><![CDATA[RATT]]></title>
	<description><![CDATA[<p><strong>RATT</strong> is software to transfer annotation from a reference (annotated) genome to an unannotated query genome.</p>
<p>It was first developed to transfer annotations between different genome assembly versions. However, it can also transfer annotations between strains and even different species, like <em>Plasmodium chabaudi</em> onto <em> P. berghei</em>, between different Leishmania species or <em>Salmonella enterica</em> onto other Salmonella serotypes. <strong>RATT</strong> is able to transfer any entries present on a reference sequence, such as the systematic id or an annotator's notes; such information would be lost in a <em>de novo</em> annotation.</p>
<p>More at http://ratt.sourceforge.net/</p><p>Address of the bookmark: <a href="http://ratt.sourceforge.net/" rel="nofollow">http://ratt.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26332/pilon</guid>
	<pubDate>Mon, 08 Feb 2016 15:56:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26332/pilon</link>
	<title><![CDATA[Pilon]]></title>
	<description><![CDATA[<p>Pilon is a software tool which can be used to:</p>
<ul>
<li>Automatically improve draft assemblies</li>
<li>Find variation among strains, including large event detection</li>
</ul>
<p>Pilon requires as input a FASTA file of the genome along with one or more BAM files of reads aligned to the input FASTA file. Pilon uses read alignment analysis to identify inconsistencies between the input genome and the evidence in the reads. It then attempts to make improvements to the input genome, including:</p>
<ul>
<li>Single base differences</li>
<li>Small indels</li>
<li>Larger indel or block substitution events</li>
<li>Gap filling</li>
<li>Identification of local misassemblies, including optional opening of new gaps</li>
</ul>
<p>More at https://github.com/broadinstitute/pilon/wiki</p><p>Address of the bookmark: <a href="https://github.com/broadinstitute/pilon/wiki" rel="nofollow">https://github.com/broadinstitute/pilon/wiki</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</guid>
	<pubDate>Wed, 23 Mar 2016 05:53:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</link>
	<title><![CDATA[RNA-Seq De novo Assembly Using Trinity]]></title>
	<description><![CDATA[<p>Trinity, developed at the <a href="http://www.broadinstitute.org">Broad Institute</a> and the <a href="http://www.cs.huji.ac.il">Hebrew University of Jerusalem</a>, represents a novel method for the efficient and robust de novo reconstruction of transcriptomes from RNA-seq data. Trinity combines three independent software modules: Inchworm, Chrysalis, and Butterfly, applied sequentially to process large volumes of RNA-seq reads. Trinity partitions the sequence data into many individual de Bruijn graphs, each representing the transcriptional complexity at at a given gene or locus, and then processes each graph independently to extract full-length splicing isoforms and to tease apart transcripts derived from paralogous genes. Briefly, the process works like so:</p>
<ul>
<li>
<p><em>Inchworm</em> assembles the RNA-seq data into the unique sequences of transcripts, often generating full-length transcripts for a dominant isoform, but then reports just the unique portions of alternatively spliced transcripts.</p>
</li>
<li>
<p><em>Chrysalis</em> clusters the Inchworm contigs into clusters and constructs complete de Bruijn graphs for each cluster. Each cluster represents the full transcriptonal complexity for a given gene (or sets of genes that share sequences in common). Chrysalis then partitions the full read set among these disjoint graphs.</p>
</li>
<li>
<p><em>Butterfly</em> then processes the individual graphs in parallel, tracing the paths that reads and pairs of reads take within the graph, ultimately reporting full-length transcripts for alternatively spliced isoforms, and teasing apart transcripts that corresponds to paralogous genes.</p>
</li>
</ul>
<p>More at https://github.com/trinityrnaseq/trinityrnaseq/wiki</p>
<p>......................................................................................................................................</p>
<p>Download Trinity <a href="https://github.com/trinityrnaseq/trinityrnaseq/releases">here</a>.</p>
<p>Build Trinity by typing 'make' in the base installation directory.</p>
<p>Assemble RNA-Seq data like so:</p>
<pre><code> Trinity --seqType fq --left reads_1.fq --right reads_2.fq --CPU 6 --max_memory 20G 
</code></pre>
<p>Find assembled transcripts as: 'trinity_out_dir/Trinity.fasta'</p><p>Address of the bookmark: <a href="https://github.com/trinityrnaseq/trinityrnaseq/wiki" rel="nofollow">https://github.com/trinityrnaseq/trinityrnaseq/wiki</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</guid>
	<pubDate>Wed, 06 Apr 2016 08:21:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</link>
	<title><![CDATA[Sequence assembly with MIRA 4]]></title>
	<description><![CDATA[<p>MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by</p>
<div>
<ul>
<li>
<p>electrophoresis sequencing (aka Sanger sequencing)</p>
</li>
<li>
<p>454 pyro-sequencing (GS20, FLX or Titanium)</p>
</li>
<li>
<p>Ion Torrent</p>
</li>
<li>
<p>Solexa (Illumina) sequencing</p>
</li>
<li>
<p>(in development) Pacific Biosciences sequencing</p>
</li>
</ul>
</div>
<p>into contiguous sequences (called <span><em>contigs</em></span>). One can use the sequences of different sequencing technologies either in a single assembly run (a <span><em>true hybrid assembly</em></span>) or by mapping one type of data to an assembly of other sequencing type (a <span><em>semi-hybrid assembly (or mapping)</em></span>) or by mapping a data against consensus sequences of other assemblies (a <span><em>simple mapping</em></span>).</p>
<p>The MIRA acronym stands for <span><strong>M</strong></span>imicking <span><strong>I</strong></span>ntelligent <span><strong>R</strong></span>ead <span><strong>A</strong></span>ssembly and the program pretty well does what its acronym says (well, most of the time anyway). It is the Swiss army knife of sequence assembly that I've used and developed during the past 14 years to get assembly jobs I work on done efficiently - and especially accurately. That is, without me actually putting too much manual work into it.</p>
<p>More at http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</p><p>Address of the bookmark: <a href="http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html" rel="nofollow">http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26975/trimmomatic-a-flexible-read-trimming-tool-for-illumina-ngs-data</guid>
	<pubDate>Fri, 15 Apr 2016 05:58:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26975/trimmomatic-a-flexible-read-trimming-tool-for-illumina-ngs-data</link>
	<title><![CDATA[Trimmomatic: A flexible read trimming tool for Illumina NGS data]]></title>
	<description><![CDATA[<h4>Paired End:</h4>
<p><code>java -jar trimmomatic-0.35.jar PE -phred33 input_forward.fq.gz input_reverse.fq.gz output_forward_paired.fq.gz output_forward_unpaired.fq.gz output_reverse_paired.fq.gz output_reverse_unpaired.fq.gz ILLUMINACLIP:TruSeq3-PE.fa:2:30:10 LEADING:3 TRAILING:3 SLIDINGWINDOW:4:15 MINLEN:36</code></p>
<p>This will perform the following:</p>
<ul>
<li>Remove adapters (ILLUMINACLIP:TruSeq3-PE.fa:2:30:10)</li>
<li>Remove leading low quality or N bases (below quality 3) (LEADING:3)</li>
<li>Remove trailing low quality or N bases (below quality 3) (TRAILING:3)</li>
<li>Scan the read with a 4-base wide sliding window, cutting when the average quality per base drops below 15 (SLIDINGWINDOW:4:15)</li>
<li>Drop reads below the 36 bases long (MINLEN:36)</li>
</ul>
<p>More at http://www.usadellab.org/cms/?page=trimmomatic</p><p>Address of the bookmark: <a href="http://www.usadellab.org/cms/?page=trimmomatic" rel="nofollow">http://www.usadellab.org/cms/?page=trimmomatic</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27092/medea-comparative-genomic-visualization-with-adobe-flash</guid>
	<pubDate>Tue, 26 Apr 2016 12:15:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27092/medea-comparative-genomic-visualization-with-adobe-flash</link>
	<title><![CDATA[MEDEA: Comparative Genomic Visualization with Adobe Flash]]></title>
	<description><![CDATA[<p><span>As the number of sequence and annotated genomes grows larger, the need to understand, compare, and contrast the data becomes increasingly important. Using the power of the human visual system to detect trends and spot outliers is necessary in such large and complex data sets.</span></p>
<p><span>More at&nbsp;http://www.broadinstitute.org/annotation/medea/</span></p><p>Address of the bookmark: <a href="http://www.broadinstitute.org/annotation/medea/" rel="nofollow">http://www.broadinstitute.org/annotation/medea/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</guid>
	<pubDate>Fri, 03 Jun 2016 10:09:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</link>
	<title><![CDATA[methylKit]]></title>
	<description><![CDATA[<p><em>methylKit</em> is an <a href="http://en.wikipedia.org/wiki/R_%28programming_language%29">R</a> package for DNA methylation analysis and annotation from high-throughput bisulfite sequencing. The package is designed to deal with sequencing data from <a href="http://www.nature.com/nprot/journal/v6/n4/abs/nprot.2010.190.html">RRBS</a> and its variants, but also target-capture methods such as <a href="http://www.halogenomics.com/sureselect/methyl-seq">Agilent SureSelect methyl-seq</a>. In addition, methylKit can deal with base-pair resolution data for 5hmC obtained from Tab-seq or oxBS-seq. It can also handle whole-genome bisulfite sequencing data if proper input format is provided.</p><p>Address of the bookmark: <a href="https://github.com/al2na/methylKit" rel="nofollow">https://github.com/al2na/methylKit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>