<?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/26306?offset=620</link>
	<atom:link href="https://bioinformaticsonline.com/related/26306?offset=620" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</guid>
	<pubDate>Wed, 28 Feb 2018 03:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</link>
	<title><![CDATA[Genome assembly stats plotting]]></title>
	<description><![CDATA[<p>A&nbsp;<em>de novo</em>&nbsp;genome assembly can be summarised b</p>
<p>y a number of metrics, including:</p>
<ul>
<li>Overall assembly length</li>
<li>Number of scaffolds/contigs</li>
<li>Length of longest scaffold/contig</li>
<li>Scaffold/contig N50 and N90Assembly base composition, in particular percentage GC and percentage Ns</li>
<li>CEGMA completeness</li>
<li>Scaffold/contig length/count distribution</li>
</ul>
<p>assembly-stats supports two widely used presentations of these values, tabular and cumulative length plots, and introduces an additional circular plot that summarises most commonly used assembly metrics in a single visualisation. Each of these presentations is generated using javascript from a common (JSON) data structure, allowing toggling between alternative views, and each can be applied to a single or multiple assemblies to allow direct comparison of alternate assemblies.</p>
<p>Tabular presentation allows direct comparison of exact values between assemblies, the limitations of this approach lie in the necessary omission of distributions and the challenge of interpreting ratios of values that may vary by several orders of magnitude.</p><p>Address of the bookmark: <a href="https://github.com/rjchallis/assembly-stats" rel="nofollow">https://github.com/rjchallis/assembly-stats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29274/strudel</guid>
	<pubDate>Fri, 30 Sep 2016 09:47:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29274/strudel</link>
	<title><![CDATA[Strudel]]></title>
	<description><![CDATA[<p>Strudel is our graphical tool for visualizing genetic and physical maps of genomes for comparative purposes. The application aims to let the user examine their data at a variety of different levels of resolution, from entire maps to individual markers, and explore syntenic relationships between genomes. All browsing and interaction with Strudel happens in real-time &ndash; there is no need to wait while the maps are generated. It is built using Java 1.6 and ships with its own JRE, so there is no need for users to install or update Java.</p><p>Address of the bookmark: <a href="https://ics.hutton.ac.uk/strudel/" rel="nofollow">https://ics.hutton.ac.uk/strudel/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</guid>
	<pubDate>Fri, 20 Jul 2018 10:03:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</link>
	<title><![CDATA[Converting a VCF into a FASTA given some reference !]]></title>
	<description><![CDATA[<p>Samtools/BCFtools (Heng Li) provides a Perl script&nbsp;<a href="https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl"><code>vcfutils.pl</code></a>&nbsp;which does this, the function&nbsp;<code>vcf2fq</code>&nbsp;(lines 469-528)</p><p>This script has been modified by others to convert InDels as well, e.g.&nbsp;<a href="https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl">this</a>&nbsp;by David Eccles</p><pre><code><span>./</span><span>vcf2fq</span><span>.</span><span>pl </span><span>-</span><span>f </span><span>&lt;</span><span>input</span><span>.</span><span>fasta</span><span>&gt;</span><span> </span><span>&lt;</span><span>all</span><span>-</span><span>site</span><span>.</span><span>vcf</span><span>&gt;</span><span> </span><span>&gt;</span><span> </span><span>&lt;</span><span>output</span><span>.</span><span>fastq</span><span>&gt;</span></code></pre><p>https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl</p><p>https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</guid>
	<pubDate>Wed, 14 Nov 2018 04:45:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</link>
	<title><![CDATA[SKESA: strategic k-mer extension for scrupulous assemblies]]></title>
	<description><![CDATA[<p><span>SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit shows that SKESA produces assemblies that have high sequence quality and contiguity, handles low-level contamination in reads, is fast, and produces an identical assembly for the same input when assembled multiple times with the same or different compute resources. </span></p>
<p><span>Source code for SKESA is freely available at&nbsp;</span><span><a href="https://github.com/ncbi/SKESA/releases"><span>https://github.com/ncbi/SKESA/releases</span></a></span><span>.</span></p>
<p>Research Paper&nbsp;@ <a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-018-1540-z">Link</a></p>
<p><span><span>SKESA algorithm are as follows:</span><br></span></p>
<p><span><img src="https://media.springernature.com/lw785/springer-static/image/art%3A10.1186%2Fs13059-018-1540-z/MediaObjects/13059_2018_1540_Fig4_HTML.png" alt="image" width="785" height="984" style="border: 0px; border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/ncbi/SKESA/releases" rel="nofollow">https://github.com/ncbi/SKESA/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38526/versatile-genome-assembly-evaluation-with-quast-lg</guid>
	<pubDate>Fri, 21 Dec 2018 22:06:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38526/versatile-genome-assembly-evaluation-with-quast-lg</link>
	<title><![CDATA[Versatile genome assembly evaluation with QUAST-LG]]></title>
	<description><![CDATA[<p>QUAST-LG is an extension of&nbsp;<a href="http://cab.spbu.ru/software/quast/">QUAST</a>&nbsp;intended for evaluating large-scale genome assemblies (up to mammalian-size).</p>
<p>QUAST-LG&nbsp;is included in the QUAST&nbsp; package starting from version 5.0.0 (<a href="https://sourceforge.net/projects/quast/files/latest/download?source=files">download the latest release</a>). Run QUAST as usual and do not forget to add&nbsp;<span>‐‐large</span>&nbsp;option to your command!</p>
<p>A short list of the new features (see&nbsp;<a href="http://cab.spbu.ru/files/quast/latest-docs/CHANGES.txt">CHANGES</a>&nbsp;for all):</p>
<ul>
<li>Significant speedup achieved by both&nbsp;use of new fast aligner (<a href="https://github.com/lh3/minimap2">minimap2</a>) and the refactoring of alignment analyzing&nbsp;modules</li>
<li>New k-mer-based completeness and correctness metrics</li>
<li>BUSCO added for enhanced reference-free analysis</li>
<li>The concept of upper bound&nbsp;assembly (theoretical limits on the assembly&nbsp;completeness and&nbsp;contiguity for a given genome and set of reads)</li>
</ul><p>Address of the bookmark: <a href="http://cab.spbu.ru/software/quast-lg/" rel="nofollow">http://cab.spbu.ru/software/quast-lg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38765/list-of-tools-frequently-used-while-genome-assembly</guid>
	<pubDate>Tue, 22 Jan 2019 09:39:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38765/list-of-tools-frequently-used-while-genome-assembly</link>
	<title><![CDATA[List of tools frequently used while genome assembly]]></title>
	<description><![CDATA[<h4>List of tools frequently used while genome assembly:</h4><p>I have used the following assemblers</p><ul>
<li><a href="http://bioinf.spbau.ru/spades">Spades</a>&nbsp;(v. 3.10.1)</li>
<li><a href="http://canu.readthedocs.io/en/stable/index.html">CANU</a>&nbsp;(v. 1.6)</li>
<li><a href="https://github.com/rrwick/Unicycler">Unicycler&nbsp;</a>(v. v0.4.1)</li>
<li><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;(v. 0.2-r137-dirty)</li>
</ul><p>I have used the following mappers</p><ul>
<li><a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;(v.&nbsp;2.0rc1-r232)</li>
<li><a href="https://github.com/lh3/minimap">minimap&nbsp;</a>(v. 0.2-r124-dirty)</li>
<li><a href="https://github.com/lh3/bwa">bwa</a>&nbsp;(v.&nbsp;0.7.12-r1039)</li>
</ul><p>I have used the following polishing tools</p><ul>
<li><a href="https://github.com/isovic/racon">Racon</a>&nbsp;(v. not available)</li>
<li><a href="https://github.com/broadinstitute/pilon">Pilon</a>&nbsp;(v. 1.18)</li>
<li><a href="https://github.com/jts/nanopolish">Nanopolish</a>&nbsp;(v. 0.8.3)</li>
</ul><p>I have used the following tools to assess genome assembly characteristics</p><ul>
<li><a href="https://github.com/chjp/ANI">ANI.pl</a>&nbsp;(https://github.com/chjp/ANI)</li>
<li><a href="http://ecogenomics.github.io/CheckM/">CheckM</a>&nbsp;(v. 1.0.7)</li>
<li><a href="https://github.com/tseemann/prokka">Prokka</a>&nbsp;(v. 1.12)</li>
<li><a href="http://bioinf.spbau.ru/en/quast">QUAST</a>&nbsp;(v. 2.3)</li>
<li><a href="http://mummer.sourceforge.net/">mummer&nbsp;</a>(v. not available)</li>
</ul><p>If you have any ideas or superior tools we have missed please let us know in the comments.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</guid>
	<pubDate>Fri, 04 Nov 2016 12:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</link>
	<title><![CDATA[R Graphical Cookbook by Winston Chang]]></title>
	<description><![CDATA[<p>R Graphical Cookbook by Winston Chang</p><p>A very nice book by Winston Chang for R ethusiast. The R code presented in these pages is the R code actually used to produce the Figures in the book. There will be differences compared to the code chunks shown in the text of the book, but in most cases the differences will be that these pages contain additional code to lay out multiple plots on a single "page".</p><p>The code presented for each figure is self-contained, i.e., all code required to produce the figure is included. This means that there is sometimes considerable overlap of code between several figures  In some cases, it may be necessary to install an add-on package from CRAN to get the code to run.</p><p>More books at http://www.e-reading.club/bookreader.php/137370/C486x_APPb.pdf</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29638" length="37521" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</guid>
	<pubDate>Fri, 31 Jan 2020 05:50:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</link>
	<title><![CDATA[HASLR: a tool for rapid genome assembly of long sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR is a tool for rapid genome assembly of long sequencing reads. HASLR is a hybrid tool which means it requires long reads generated by Third Generation Sequencing technologies (such as PacBio or Oxford Nanopore) together with Next Generation Sequencing reads (such as Illumina) from the same sample.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>