<?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/43614?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/43614?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/pages/view/43728/short-read-assembly-using-spades</guid>
	<pubDate>Mon, 31 Jan 2022 07:18:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43728/short-read-assembly-using-spades</link>
	<title><![CDATA[Short-read assembly using Spades !]]></title>
	<description><![CDATA[<h2 id="short-read-assembly-a-comparison">If we only had Illumina reads, we could also assemble these using the tool Spades.</h2><p>You can try this here, or try it later on your own data.</p><h2 id="get-data">Get data</h2><p>We will use the same Illumina data as we used above:</p><ul>
<li>illumina_R1.fastq.gz: the Illumina forward reads</li>
<li>illumina_R2.fastq.gz: the Illumina reverse reads</li>
</ul><h2 id="assemble">Assemble</h2><p>Run Spades:</p><div><pre>spades.py -1 illumina_R1.fastq.gz -2 illumina_R2.fastq.gz --careful --cov-cutoff auto -o spades_assembly_all_illumina
</pre></div><ul>
<li><code>-1</code>&nbsp;is input file of forward reads</li>
<li><code>-2</code>&nbsp;is input file of reverse reads</li>
<li><code>--careful</code>&nbsp;minimizes mismatches and short indels</li>
<li><code>--cov-cutoff auto</code>&nbsp;computes the coverage threshold (rather than the default setting, &ldquo;off&rdquo;)</li>
<li><code>-o</code>&nbsp;is the output directory</li>
</ul><h2 id="results">Results</h2><p>Move into the output directory and look at the contigs:</p><div><pre>infoseq contigs.fasta</pre></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45314/nf-coremag-v5-advancing-genome-resolved-metagenomics</guid>
	<pubDate>Sat, 12 Sep 2026 20:27:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45314/nf-coremag-v5-advancing-genome-resolved-metagenomics</link>
	<title><![CDATA[nf-core/mag v5: Advancing Genome-Resolved Metagenomics]]></title>
	<description><![CDATA[<p>Metagenomics is rapidly moving beyond short-read sequencing. With the increasing adoption of long-read technologies, researchers can generate more contiguous assemblies&mdash;but converting these reads into reliable metagenome-assembled genomes (MAGs) remains computationally challenging.</p><p>nf-core/mag v5 (https://github.com/nf-core/mag) addresses this challenge by extending its reproducible Nextflow-based workflow for modern genome-resolved metagenomics.</p><p>A key addition is support for long-read-only metagenomic assembly and bin refinement, enabling long-read data to be processed through an integrated workflow. The release also introduces five additional binning tools, providing complementary strategies for recovering genomes from complex microbial communities.</p><p>The workflow has also expanded beyond conventional bacterial and archaeal MAGs, with improved classification of viruses and eukaryotes, together with enhanced genome-quality assessment.</p><p>Conceptually, the workflow brings together:</p><p>Reads &rarr; QC &rarr; Assembly &rarr; Binning &rarr; Bin refinement &rarr; Taxonomic classification &rarr; MAG quality assessment</p><p>The real strength of nf-core/mag is not any single algorithm, but the integration and reproducibility of multiple tools within a standardized workflow. This is particularly important for large-scale metagenomic studies where software versions, parameters, databases and computational environments can strongly influence results.</p><p>After seven years of development involving multiple curator teams and the wider nf-core community, v5 demonstrates how community-driven workflow development can keep metagenomic analysis aligned with rapidly evolving sequencing technologies.</p><p>The future of genome-resolved metagenomics is not simply longer reads&mdash;it is better integration of assembly, binning, refinement and quality control within reproducible computational workflows.</p><p>Read the full paper in Bioinformatics https://academic.oup.com/bioinformatics/article/42/9/btag628/8770536?</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31100/vaguevelvet-assembler-graphical-front-end</guid>
	<pubDate>Fri, 24 Feb 2017 08:56:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31100/vaguevelvet-assembler-graphical-front-end</link>
	<title><![CDATA[VAGUE:Velvet Assembler Graphical Front End]]></title>
	<description><![CDATA[<p>VAGUE is a vague acronym for "Velvet Assembler Graphical Front End", which means it is a GUI for the Velvet <em>de novo</em> assembler. The command line version of Velvet can be complicated for beginners to use, but VAGUE makes it clear and simple</p>
<p>More at&nbsp;http://www.vicbioinformatics.com/software.vague.shtml</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.vague.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.vague.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</guid>
	<pubDate>Fri, 24 Feb 2017 10:17:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31105/understanding-pacbio</link>
	<title><![CDATA[Understanding PacBio]]></title>
	<description><![CDATA[<p>This tutorial includes resources for learning more about PacBio data and bioinformatics analysis, and includes content suitable for both beginners and experts. Below are links to training modules (webinars and PowerPoint presentations) to help you get started with your data processing, as well as information for specialized applications.</p>
<p>Training Resources:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Workshop">Bioinformatics Workshop (Webinars)</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Bioinformatics-Training-Slides">Bioinformatics Training Slides</a></li>
</ul>
<p>Specialized Applications:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/De-Novo-Assembly">De Novo Assembly</a></li>
<li><a href="https://github.com/PacificBiosciences/cDNA_primer/wiki">Transcriptome analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Base-modification-analysis">Base Modification Analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Barcoding">Barcoding</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Data-Analysis-Tools">Data Analysis Tools</a></li>
<li><a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/Minor-Variants-and-Phasing-Analysis">Minor Variants and Phasing Analysis</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki" rel="nofollow">https://github.com/PacificBiosciences/Bioinformatics-Training/wiki</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30074/minia</guid>
	<pubDate>Thu, 08 Dec 2016 05:07:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30074/minia</link>
	<title><![CDATA[Minia]]></title>
	<description><![CDATA[<p>Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn assemblers (e.g. Velvet).</p>
<h3>Download</h3>
<p><a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-bin-Linux.tar.gz">Minia 2.0.7 Linux 64-bits binaries</a>&nbsp;(<a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-Source.tar.gz">Source code</a>)&nbsp;<span>(<a href="http://minia.genouest.org/files/minia-1.6906.tar.gz">Legacy codebase</a>)</span></p>
<h3>For the impatient</h3>
<p>A typical Minia command line looks like:</p>
<pre>./minia -in <span>reads.fa</span> -kmer-size <span>31</span> -abundance-min <span>3</span> -out <span>output_prefix</span></pre>
<p>Type</p>
<pre>./minia</pre>
<p><span>for a quick explanation of the parameters.</span></p>
<p>For more information, refer to the&nbsp;<a href="http://minia.genouest.org/files/minia.pdf">manual</a>.</p>
<p><a href="http://kmergenie.bx.psu.edu/">KmerGenie</a>&nbsp;can be used to determine the best k-mer size, minimum abundance of correct k-mers, and genome size estimation for your dataset.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://minia.genouest.org/" rel="nofollow">http://minia.genouest.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30205/garmgenome-assembly-reconciliation-and-merging</guid>
	<pubDate>Mon, 19 Dec 2016 06:03:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30205/garmgenome-assembly-reconciliation-and-merging</link>
	<title><![CDATA[GARM:Genome Assembly, Reconciliation and Merging]]></title>
	<description><![CDATA[<p><span>The pipeline is based mainly implemented using Perl scripts and modules and third-party open source software like the AMOS (Myers et al., 2000) and MUMmer (Kurtz et al., 2004) packages. The pipeline was tested on Debian, Ubuntu, Fedora and BioLinux distributions. The method merges contigs or scaffolds from different assemblers using the same or different sequencing technologies. When scaffolds are provided, a process of finding probable compressions or extensions (CE) problems in the assemblies can be per-formed; contigs are joined back into scaffolds after gap recalculation</span></p><p>Address of the bookmark: <a href="http://garm-meta-assem.sourceforge.net/" rel="nofollow">http://garm-meta-assem.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>