<?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/41493?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/41493?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44377/mitochondrial-genome-assembly-tools</guid>
	<pubDate>Wed, 06 Sep 2023 00:37:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44377/mitochondrial-genome-assembly-tools</link>
	<title><![CDATA[Mitochondrial genome assembly tools !]]></title>
	<description><![CDATA[<p>Mitochondrial genome assembly tools are specialized software and algorithms designed to accurately reconstruct the mitochondrial genome (mitogenome) from sequencing data, typically obtained through techniques like next-generation sequencing (NGS). The mitochondrial genome is relatively small compared to the nuclear genome, making it an ideal target for assembly. Here are some commonly used mitochondrial genome assembly tools:</p><p><strong>MitoFinder:</strong> Mitofinder is a pipeline to assemble mitochondrial genomes and annotate mitochondrial genes from trimmed read sequencing data.</p><p><strong>MitoHiFi:</strong> a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads</p><p>MITObim: MITObim is a tool specifically developed for the iterative assembly of mitochondrial genomes. It starts with a reference mitogenome and iteratively refines the assembly using the read data.</p><p><strong>MITOS:</strong> MITOS is a web-based platform that provides a pipeline for annotating mitochondrial genomes. It integrates multiple software tools for assembly, annotation, and visualization of mitogenomes.</p><p><strong>MIRA:</strong> MIRA (Mimicking Intelligent Read Assembly) is a versatile genome assembly tool that can be used for mitochondrial genome assembly. It supports various sequencing technologies and allows for reference-based or de novo assembly.</p><p><strong>NOVOPlasty:</strong> NOVOPlasty is a user-friendly tool designed for de novo assembly of organelle genomes, including mitochondria. It utilizes a seed-and-extend algorithm and is suitable for both short-read and long-read data.</p><p><strong>MITOS2:</strong> MITOS2 is an updated version of the MITOS pipeline, which automates the annotation of mitochondrial genomes. It provides improved accuracy and additional features for mitochondrial genome analysis.</p><p><strong>GetOrganelle:</strong> While primarily designed for chloroplast genome assembly, GetOrganelle can also be used for mitochondrial genome assembly. It is particularly useful for dealing with high-throughput sequencing data.</p><p><strong>SPAdes:</strong> SPAdes (St. Petersburg genome assembler) is a versatile genome assembly tool that can be employed for mitochondrial genome assembly, especially when dealing with complex datasets that may contain nuclear mitochondrial DNA sequences (numts).</p><p><strong>IDBA-UD:</strong> IDBA-UD (Iterative De Bruijn Graph De Novo Assembler) is another de novo assembly tool that can be used for mitochondrial genome assembly, especially in cases with relatively low coverage.</p><p><strong>Velvet:</strong> Velvet is a de novo assembly tool that can be applied to mitochondrial genome assembly, especially when working with short-read data.</p><p>When selecting a mitochondrial genome assembly tool, it's important to consider the specific characteristics of your sequencing data, such as read length and coverage, as well as the complexity of the mitochondrial genome. Additionally, some tools are better suited for specific organisms or research objectives, so choosing the right tool will depend on your particular project requirements.</p>]]></description>
	<dc:creator>Abhi</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/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>
<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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30216/quickmerge-a-simple-and-fast-metassembler-and-assembly-gap-filler-designed-for-long-molecule-based-assemblies</guid>
	<pubDate>Mon, 19 Dec 2016 10:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30216/quickmerge-a-simple-and-fast-metassembler-and-assembly-gap-filler-designed-for-long-molecule-based-assemblies</link>
	<title><![CDATA[quickmerge: A simple and fast metassembler and assembly gap filler designed for long molecule based assemblies.]]></title>
	<description><![CDATA[<p><span>quickmerge uses a simple concept to improve contiguity of genome assemblies based on long molecule sequences, often with dramatic outcomes. The program uses information from assemblies made with illumina short reads and PacBio long reads to improve contiguities of an assembly generated with PacBio long reads alone. This is counterintuitive because illumina short reads are not typically considered to cover genomic regions which PacBio long reads cannot. Although we have not evaluated this program for assemblies generated with Oxford nanopore sequences, the program should work with ONP-assemblies too.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/quickmerge" rel="nofollow">https://github.com/mahulchak/quickmerge</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</guid>
	<pubDate>Mon, 06 Mar 2017 03:44:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</link>
	<title><![CDATA[MetaBAT:  An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities]]></title>
	<description><![CDATA[<p>MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities</p>
<p>Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (&gt;200kb) in 3 hours, where 621 genome bins are &gt;50% complete with &lt;5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.</p><p>Address of the bookmark: <a href="https://bitbucket.org/berkeleylab/metabat" rel="nofollow">https://bitbucket.org/berkeleylab/metabat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>