<?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/36897?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/36897?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37416/gfinisher-a-new-strategy-to-refine-and-finish-bacterial-genome-assemblies</guid>
	<pubDate>Thu, 26 Jul 2018 09:31:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37416/gfinisher-a-new-strategy-to-refine-and-finish-bacterial-genome-assemblies</link>
	<title><![CDATA[GFinisher: a new strategy to refine and finish bacterial genome assemblies]]></title>
	<description><![CDATA[<p>GFinisher is an application tools for refinement and finalization of prokaryotic genomes assemblies using the bias of GC Skew to identify assembly errors and organizes the contigs/scaffolds with genomes references.</p>
<pre>java -Xms2G -Xmx4G -jar GenomeFinisher.jar  \
    -i target_contigs.fasta  \
    -ds alternative_assemblies.fasta -ref reference.fasta  \
    -o outputDirectory</pre><p>Address of the bookmark: <a href="http://gfinisher.sourceforge.net" rel="nofollow">http://gfinisher.sourceforge.net</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</guid>
	<pubDate>Thu, 15 Nov 2018 12:48:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38224/novograph-building-whole-genome-graphs-from-long-read-based-de-novo-assemblies</link>
	<title><![CDATA[NovoGraph: building whole genome graphs from long-read-based de novo assemblies]]></title>
	<description><![CDATA[<p><span>NovoGraph: building whole genome graphs from long-read-based de novo assemblies</span></p>
<p><span><span>An algorithmically novel approach to construct a genome graph representation of long-read-based&nbsp;</span><em>de novo</em><span>&nbsp;sequence assemblies. We then provide a proof of principle by creating a genome graph of seven ethnically-diverse human genomes.</span></span></p>
<p>&nbsp;</p>
<p>https://f1000research.com/articles/7-1391/v1</p><p>Address of the bookmark: <a href="https://github.com/NCBI-Hackathons/NovoGraph" rel="nofollow">https://github.com/NCBI-Hackathons/NovoGraph</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</guid>
	<pubDate>Sat, 31 Aug 2019 11:30:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</link>
	<title><![CDATA[Integrative Meta-Assembly Pipeline (IMAP): Chromosome-level genome assembler combining multiple de novo assemblies]]></title>
	<description><![CDATA[<p><span>Chromosome-level genome assembler combining multiple de novo assemblies</span></p>
<p><span><a href="https://github.com/jkimlab/IMAP">https://github.com/jkimlab/IMAP</a></span></p><p>Address of the bookmark: <a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858" rel="nofollow">https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</guid>
	<pubDate>Thu, 19 May 2022 04:29:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</link>
	<title><![CDATA[GenomeQC: a quality assessment tool for genome assemblies and gene structure annotations]]></title>
	<description><![CDATA[<p><span>The GenomeQC web application is implemented in R/Shiny version 1.5.9 and Python 3.6 and is freely available at&nbsp;</span><a href="https://genomeqc.maizegdb.org/">https://genomeqc.maizegdb.org/</a><span>&nbsp;under the GPL license. All source code and a containerized version of the GenomeQC pipeline is available in the GitHub repository&nbsp;</span><a href="https://github.com/HuffordLab/GenomeQC">https://github.com/HuffordLab/GenomeQC</a><span>.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-020-6568-2</p><p>Address of the bookmark: <a href="https://github.com/HuffordLab/GenomeQC" rel="nofollow">https://github.com/HuffordLab/GenomeQC</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</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/37840/long-read-assembly-workshop</guid>
	<pubDate>Thu, 04 Oct 2018 17:23:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37840/long-read-assembly-workshop</link>
	<title><![CDATA[Long read assembly workshop !]]></title>
	<description><![CDATA[<p>This is a tutorial for a workshop on long-read (PacBio) genome assembly.</p>
<p>It demonstrates how to use long PacBio sequencing reads to assemble a bacterial genome, and includes additional steps for circularising, trimming, finding plasmids, and correcting the assembly with short-read Illumina data.</p>
<p>&nbsp;Please comment if you know any other long read addembly tutorial.</p><p>Address of the bookmark: <a href="http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/" rel="nofollow">http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</guid>
	<pubDate>Mon, 07 Jan 2019 08:40:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</link>
	<title><![CDATA[CANU genome assembly parameters !]]></title>
	<description><![CDATA[<p>Choose the appropriate parameters to run Canu and run it. The assembly will take about an hour. You can use two cores (parameter&nbsp;<code>-maxThreads=2</code>) and you would like to disable cluster option, since we compute on a single Amazon server set off the option to compute on cluster&nbsp;<code>useGrid=false</code>. This specifications should be for your project discussed with a local computing guru. The parameters that are in square brackets&nbsp;<code>[]</code>&nbsp;are optional, symbol&nbsp;<code>|</code>&nbsp;stands for "or".</p><pre><code>usage:   canu [-correct | -trim | -assemble | -trim-assemble] \
              [-s ] \
               -p  \
               -d  \
               genomeSize=[g|m|k] \
               -maxThreads=2 \
               useGrid=false \
              [other-options] \
               read_file.fastq.gz
</code></pre><p>A default&nbsp;<code>Canu</code>&nbsp;run produces usually high quality assembly, example of a command that was used for testing can be found below. However, there are still a lot of parameters that are possible to tweak. For example if we desire to assemble haplotypes separately of if we want to smash them together, we can alternate the error correction process.</p><pre><code>canu -p test_asmbl \
     -d asm_test3 \
     genomeSize=2m \
     -maxThreads=2 useGrid=false \
     -pacbio-raw \ ~/pacbio/dna/sample_reads.fastq.gz</code></pre><p>There is a brilliant&nbsp;<a href="http://canu.readthedocs.io/en/latest/faq.html#what-parameters-can-i-tweak">section in documentation</a>&nbsp;about parameter tweaking.</p><p>The output directory contains will contain many files. The most interesting ones are:</p><ul>
<li><code>*.correctedReads.fasta.gz</code>&nbsp;: file containing the input sequences after correction, trim and split based on consensus evidence.</li>
<li><code>*.trimmedReads.fastq</code>&nbsp;: file containing the sequences after correction and final trimming</li>
<li><code>*.layout</code>&nbsp;: file containing informations about read inclusion in the final assembly</li>
<li><code>*.gfa</code>&nbsp;: file containing the assembly graph by Canu</li>
<li><code>*.contigs.fasta</code>&nbsp;: file containing everything that could be assembled and is part of the primary assembly</li>
</ul><p>The basic stats of assembly can be read from reports generated by the assembler, or calculated using standard UNIX command line tools.</p><p>More at&nbsp;https://canu.readthedocs.io/en/latest/faq.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>