<?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/44873?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/44873?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44489/proksee</guid>
	<pubDate>Wed, 27 Mar 2024 11:11:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44489/proksee</link>
	<title><![CDATA[Proksee]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p>
<fieldset><legend>Please Cite the Following</legend>
<div>Grant JR, Enns E, Marinier E, Mandal A, Herman EK, Chen C, Graham M, Van Domselaar G, and Stothard P</div>
<div><a href="https://pubmed.ncbi.nlm.nih.gov/37140037/">Proksee: in-depth characterization and visualization of bacterial genomes</a></div>
<div>Nucleic Acids Research, 2023, gkad326, https://doi.org/10.1093/nar/gkad326</div>
</fieldset><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45251/aurora-a-new-detective-for-bacterial-genomes</guid>
	<pubDate>Fri, 21 Aug 2026 11:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45251/aurora-a-new-detective-for-bacterial-genomes</link>
	<title><![CDATA[Aurora: A New Detective for Bacterial Genomes]]></title>
	<description><![CDATA[<p>Imagine trying to solve a mystery with thousands of clues&mdash;but some of the clues are labelled incorrectly.</p><p>That is the challenge researchers face when studying how bacteria adapt to different environments. A bacterial gene may appear to be linked to a particular habitat, when the real reason is simply that closely related bacteria happen to live there.</p><p>In their 2025 Genome Biology paper, Bujdo&scaron;, Walter, and O&rsquo;Toole introduce aurora, a machine-learning tool designed to tackle this problem.</p><p>Aurora identifies potentially mislabeled or unusual bacterial strains before performing genome-wide association studies (GWAS). By cleaning up the dataset and accounting for bacterial evolutionary relationships, it can help researchers find genetic features that are more genuinely connected to habitat adaptation.</p><p>The researchers tested aurora using simulated and real bacterial datasets and found that it could recover important genetic associations even when datasets contained misleading labels.</p><p>The bigger lesson is simple: better biological discoveries often begin with better data.</p><p>Aurora gives researchers a new way to separate real genetic clues from misleading ones&mdash;and could help us better understand how bacteria adapt, survive, and evolve in the environments they call home.</p><p>Based on Bujdo&scaron; et al., &ldquo;aurora: a machine learning GWAS tool for analyzing microbial habitat adaptation,&rdquo; Genome Biology (2025).[Read the original paper](https://link.springer.com/article/10.1186/s13059-025-03524-7?)</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37536/snippy-rapid-haploid-variant-calling-and-core-snp-phylogeny</guid>
	<pubDate>Sat, 11 Aug 2018 11:06:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37536/snippy-rapid-haploid-variant-calling-and-core-snp-phylogeny</link>
	<title><![CDATA[Snippy: Rapid haploid variant calling and core SNP phylogeny]]></title>
	<description><![CDATA[<p><span>Snippy finds SNPs between a haploid reference genome and your NGS sequence reads. It will find both substitutions (snps) and insertions/deletions (indels). It will use as many CPUs as you can give it on a single computer (tested to 64 cores). It is designed with speed in mind, and produces a consistent set of output files in a single folder. It can then take a set of Snippy results using the same reference and generate a core SNP alignment (and ultimately a phylogenomic tree).</span></p>
<pre><code>snippy --cpus 16 --outdir mysnps --ref Listeria.gbk --R1 FDA_R1.fastq.gz --R2 FDA_R2.fastq.gz</code></pre><p>Address of the bookmark: <a href="https://github.com/tseemann/snippy" rel="nofollow">https://github.com/tseemann/snippy</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</guid>
	<pubDate>Sat, 02 Jan 2021 07:05:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</link>
	<title><![CDATA[shovill: Assemble bacterial isolate genomes from Illumina paired-end reads]]></title>
	<description><![CDATA[<p><span>Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take advantage of the pre- and post-processing the Shovill provides with those too.</span></p><p>Address of the bookmark: <a href="https://github.com/tseemann/shovill" rel="nofollow">https://github.com/tseemann/shovill</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</guid>
	<pubDate>Wed, 22 Aug 2018 03:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</link>
	<title><![CDATA[GTDB-Tk: A toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes.]]></title>
	<description><![CDATA[<p>GTDB-Tk is a software toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes. It is computationally efficient and designed to work with recent advances that allow hundreds or thousands of metagenome-assembled genomes (MAGs) to be obtained directly from environmental samples. It can also be applied to isolate and single-cell genomes. The GTDB-Tk is open source and released under the GNU General Public License (Version 3).</p>
<p>GTDB-Tk is&nbsp;<span>under active development and validation</span>. Please independently confirm the GTDB-Tk predictions by manually inspecting the tree and bringing any discrepencies to our attention. Notifications about GTDB-Tk releases will be available through the ACE Twitter account (<a href="https://twitter.com/ace_uq">https://twitter.com/ace_uq</a>).</p><p>Address of the bookmark: <a href="https://github.com/Ecogenomics/GTDBTk" rel="nofollow">https://github.com/Ecogenomics/GTDBTk</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</guid>
	<pubDate>Tue, 09 May 2023 19:38:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</link>
	<title><![CDATA[Proksee: in-depth characterization and visualization of bacterial genomes]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44539/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</guid>
	<pubDate>Wed, 15 May 2024 14:36:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44539/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</link>
	<title><![CDATA[Bactopia: a Flexible Pipeline for Complete Analysis of Bacterial Genomes]]></title>
	<description><![CDATA[<p dir="auto">Bactopia is a flexible pipeline for complete analysis of bacterial genomes. The goal of Bactopia is to process your data with a broad set of tools, so that you can get to the fun part of analyses quicker!</p>
<p dir="auto">Bactopia can be split into two main parts:&nbsp;<a href="https://bactopia.github.io/latest/beginners-guide/">Bactopia Analysis Pipeline</a>, and&nbsp;<a href="https://bactopia.github.io/latest/bactopia-tools/">Bactopia Tools</a>.</p>
<p dir="auto">Bactopia Analysis Pipeline is the main&nbsp;<em>per-isolate</em>&nbsp;workflow in Bactopia. Built with&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>, input FASTQs (local or available from SRA/ENA) are put through numerous analyses including: quality control, assembly, annotation, minmer sketch queries, sequence typing, and more.</p>
<p dir="auto"><a href="https://github.com/bactopia/bactopia/blob/master/data/bactopia-workflow.png" target="_blank"><img src="https://github.com/bactopia/bactopia/raw/master/data/bactopia-workflow.png" alt="Bactopia Overview" style="border: 0px;"></a></p>
<p dir="auto">Bactopia Tools are a set a independent workflows fo</p><p>Address of the bookmark: <a href="https://github.com/bactopia/bactopia" rel="nofollow">https://github.com/bactopia/bactopia</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</guid>
	<pubDate>Thu, 23 Nov 2017 09:55:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</link>
	<title><![CDATA[poRe: an R package for the visualization and analysis of nanopore sequencing data]]></title>
	<description><![CDATA[<p><strong>Motivation:</strong>&nbsp;The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.</p>
<p><strong>Results:</strong>&nbsp;Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.</p>
<p><strong>Availability and implementation:</strong>&nbsp;poRe is released as a package for R at&nbsp;<a href="http://sourceforge.net/projects/rpore/" target="">http://sourceforge.net/projects/rpore/</a>&nbsp;. A tutorial and further information are available at&nbsp;<a href="https://sourceforge.net/p/rpore/wiki/Home/" target="">https://sourceforge.net/p/rpore/wiki/Home/</a></p>
<p><strong>Contact:</strong><a href="mailto:mick.watson@roslin.ed.ac.uk" target="">mick.watson@roslin.ed.ac.uk</a></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/1/114/2365693" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/1/114/2365693</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>