<?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/38735?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/38735?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</guid>
	<pubDate>Thu, 24 Jan 2019 10:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</link>
	<title><![CDATA[NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads]]></title>
	<description><![CDATA[<p>NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.</p>
<p>https://nxrepair.readthedocs.io/en/latest/tutorial.html</p>
<div>
<div>
<div id="js-repo-pjax-container">
<div>
<div>
<div id="readme">
<div>
<div>
<pre>nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta</pre>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://github.com/rebeccaroisin/nxrepair" rel="nofollow">https://github.com/rebeccaroisin/nxrepair</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</guid>
	<pubDate>Wed, 25 Mar 2020 17:11:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</link>
	<title><![CDATA[Coronavirus Resources !]]></title>
	<description><![CDATA[<p><span>2019nCoVR features comprehensive integration of genomic and proteomic sequences as well as their metadata information from the GISAID, NCBI, NMDC and CNCB/NGDC. It also incorporates a wide range of relevant information including scientific literatures, news, and popular articles for science dissemination, and provides visualization functionalities for genome variation analysis results based on all collected 2019-nCoV strains.</span></p>
<p><span>Annotation</span></p>
<p><span><a href="https://bigd.big.ac.cn/ncov/variation/annotation">https://bigd.big.ac.cn/ncov/variation/annotation</a></span></p>
<p><span>Genome wharehouse&nbsp;</span></p>
<p><span><a href="https://bigd.big.ac.cn/gwh/browse/index">https://bigd.big.ac.cn/gwh/browse/index</a></span></p>
<p>Released Genome</p>
<p><a href="https://bigd.big.ac.cn/ncov/release_genome">https://bigd.big.ac.cn/ncov/release_genome</a></p>
<p>Download data&nbsp;</p>
<p><a href="ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/">ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/</a></p>
<p>Raw data</p>
<p><a href="https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae">https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae</a></p><p>Address of the bookmark: <a href="https://bigd.big.ac.cn/ncov/about" rel="nofollow">https://bigd.big.ac.cn/ncov/about</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/42559/sample-bandage-input-file-for-visual-analysis</guid>
	<pubDate>Wed, 06 Jan 2021 03:51:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/42559/sample-bandage-input-file-for-visual-analysis</link>
	<title><![CDATA[Sample bandage input file for visual analysis]]></title>
	<description><![CDATA[<p>Sample bandage input file for visual analysis ...</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/42559" length="112199" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Mon, 26 Oct 2020 21:23:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding.]]></title>
	<description><![CDATA[<p><span>Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary and secondary contigs are not properly identified, the primary assembly will overrepresent both the size and complexity of the genome, which complicates downstream analysis such as scaffolding.</span></p>
<p><span>More at&nbsp;https://github.com/esolares/HapSolo</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding]]></title>
	<description><![CDATA[<p><span>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43634/illumina-based-assembly-pipeline-steps</guid>
	<pubDate>Fri, 10 Dec 2021 06:22:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43634/illumina-based-assembly-pipeline-steps</link>
	<title><![CDATA[Illumina based assembly pipeline steps !]]></title>
	<description><![CDATA[<h3 id="illumina">Illumina<a href="https://nf-co.re/viralrecon#illumina"><span></span></a></h3><ol>
<li>Merge re-sequenced FastQ files (<a href="http://www.linfo.org/cat.html"><code>cat</code></a>)</li>
<li>Read QC (<a href="https://www.bioinformatics.babraham.ac.uk/projects/fastqc/"><code>FastQC</code></a>)</li>
<li>Adapter trimming (<a href="https://github.com/OpenGene/fastp"><code>fastp</code></a>)</li>
<li>Removal of host reads (<a href="http://ccb.jhu.edu/software/kraken2/"><code>Kraken 2</code></a>; <em>optional</em>)</li>
<li>Variant calling<ol>
<li>Read alignment (<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml"><code>Bowtie 2</code></a>)</li>
<li>Sort and index alignments (<a href="https://sourceforge.net/projects/samtools/files/samtools/"><code>SAMtools</code></a>)</li>
<li>Primer sequence removal (<a href="https://github.com/andersen-lab/ivar"><code>iVar</code></a>; <em>amplicon data only</em>)</li>
<li>Duplicate read marking (<a href="https://broadinstitute.github.io/picard/"><code>picard</code></a>; <em>optional</em>)</li>
<li>Alignment-level QC (<a href="https://broadinstitute.github.io/picard/"><code>picard</code></a>, <a href="https://sourceforge.net/projects/samtools/files/samtools/"><code>SAMtools</code></a>)</li>
<li>Genome-wide and amplicon coverage QC plots (<a href="https://github.com/brentp/mosdepth/"><code>mosdepth</code></a>)</li>
<li>Choice of multiple variant calling and consensus sequence generation routes (<a href="https://github.com/andersen-lab/ivar"><code>iVar variants and consensus</code></a>; <em>default for amplicon data</em> <em>||</em> <a href="http://samtools.github.io/bcftools/bcftools.html"><code>BCFTools</code></a>, <a href="https://github.com/arq5x/bedtools2/"><code>BEDTools</code></a>; <em>default for metagenomics data</em>)
<ul>
<li>Variant annotation (<a href="http://snpeff.sourceforge.net/SnpEff.html"><code>SnpEff</code></a>, <a href="http://snpeff.sourceforge.net/SnpSift.html"><code>SnpSift</code></a>)</li>
<li>Consensus assessment report (<a href="http://quast.sourceforge.net/quast"><code>QUAST</code></a>)</li>
<li>Lineage analysis (<a href="https://github.com/cov-lineages/pangolin"><code>Pangolin</code></a>)</li>
<li>Clade assignment, mutation calling and sequence quality checks (<a href="https://github.com/nextstrain/nextclade"><code>Nextclade</code></a>)</li>
<li>Individual variant screenshots with annotation tracks (<a href="https://asciigenome.readthedocs.io/en/latest/"><code>ASCIIGenome</code></a>)</li>
</ul>
</li>
<li>Intersect variants across callers (<a href="http://samtools.github.io/bcftools/bcftools.html"><code>BCFTools</code></a>)</li>
</ol></li>
<li><em>De novo</em> assembly<ol>
<li>Primer trimming (<a href="https://cutadapt.readthedocs.io/en/stable/guide.html"><code>Cutadapt</code></a>; <em>amplicon data only</em>)</li>
<li>Choice of multiple assembly tools (<a href="http://cab.spbu.ru/software/spades/"><code>SPAdes</code></a> <em>||</em> <a href="https://github.com/rrwick/Unicycler"><code>Unicycler</code></a> <em>||</em> <a href="https://github.com/GATB/minia"><code>minia</code></a>)
<ul>
<li>Blast to reference genome (<a href="https://blast.ncbi.nlm.nih.gov/Blast.cgi?PAGE_TYPE=BlastSearch"><code>blastn</code></a>)</li>
<li>Contiguate assembly (<a href="https://www.sanger.ac.uk/science/tools/pagit"><code>ABACAS</code></a>)</li>
<li>Assembly report (<a href="https://github.com/BU-ISCIII/plasmidID"><code>PlasmidID</code></a>)</li>
<li>Assembly assessment report (<a href="http://quast.sourceforge.net/quast"><code>QUAST</code></a>)</li>
</ul>
</li>
</ol></li>
<li>Present QC and visualisation for raw read, alignment, assembly and variant calling results (<a href="http://multiqc.info/"><code>MultiQC</code></a>)</li>
</ol>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26306/busco</guid>
	<pubDate>Sun, 07 Feb 2016 16:02:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26306/busco</link>
	<title><![CDATA[BUSCO]]></title>
	<description><![CDATA[<p>Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs</p>
<p>More at http://busco.ezlab.org/</p><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>