<?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/41125?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/41125?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</guid>
	<pubDate>Sun, 31 Aug 2025 06:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</link>
	<title><![CDATA[geNomad: Identification of mobile genetic elements]]></title>
	<description><![CDATA[<p><span>geNomad is a tool that identifies virus and plasmid genomes from nucleotide sequences. It provides state-of-the-art classification performance and can be used to quickly find mobile genetic elements from genomes, metagenomes, or metatranscriptomes.</span></p><p>Address of the bookmark: <a href="https://portal.nersc.gov/genomad" rel="nofollow">https://portal.nersc.gov/genomad</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34718/dipspades-assembler-for-highly-polymorphic-diploid-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:35:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34718/dipspades-assembler-for-highly-polymorphic-diploid-genomes</link>
	<title><![CDATA[dipSPAdes: Assembler for Highly Polymorphic Diploid Genomes.]]></title>
	<description><![CDATA[<p><span>While the number of sequenced diploid genomes have been steadily increasing in the last few years, assembly of highly polymorphic (HP) diploid genomes remains challenging. As a result, there is a shortage of tools for assembling HP genomes from the next generation sequencing (NGS) data. The initial approaches to assembling HP genomes were proposed in the pre-NGS era and are not well suited for NGS projects. To address this limitation, we developed the first de Bruijn graph assembler, dipSPAdes, for HP genomes that significantly improves on the state-of-the-art assemblers for HP diploid genomes.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pubmed/25734602" rel="nofollow">https://www.ncbi.nlm.nih.gov/pubmed/25734602</a></p>]]></description>
	<dc:creator>Jit</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/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</guid>
	<pubDate>Fri, 08 Dec 2017 07:16:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</link>
	<title><![CDATA[Harvest: a suite of core-genome alignment and visualization tools]]></title>
	<description><![CDATA[<p>Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.</p>
<p><a href="https://harvest.readthedocs.io/en/latest/_images/screen.png"><img src="https://harvest.readthedocs.io/en/latest/_images/screen.png" alt="_images/screen.png" style="border: 0px;"></a><span></span></p>
<p><strong>Tools</strong></p>
<ul>
<li><a href="https://harvest.readthedocs.io/en/latest/content/parsnp.html">Parsnp</a>&nbsp;- Core-genome alignment and analysis</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/gingr.html">Gingr</a>&nbsp;- Interactive visualization of alignments, trees and variants</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/harvest-tools.html">HarvestTools</a>&nbsp;- Archiving and postprocessing</li>
<li></li>
</ul><p>Address of the bookmark: <a href="https://harvest.readthedocs.io/en/latest/" rel="nofollow">https://harvest.readthedocs.io/en/latest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36736/checkmassessing-the-quality-of-microbial-genomes-recovered-from-isolates-single-cells-and-metagenomes</guid>
	<pubDate>Wed, 23 May 2018 04:39:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36736/checkmassessing-the-quality-of-microbial-genomes-recovered-from-isolates-single-cells-and-metagenomes</link>
	<title><![CDATA[CheckM:Assessing the quality of microbial genomes recovered from isolates, single cells, and metagenomes]]></title>
	<description><![CDATA[<p><span>CheckM provides a set of tools for assessing the quality of genomes recovered from isolates, single cells, or metagenomes. It provides robust estimates of genome completeness and contamination by using collocated sets of genes that are ubiquitous and single-copy within a phylogenetic lineage. Assessment of genome quality can also be examined using plots depicting key genomic characteristics (e.g., GC, coding density) which highlight sequences outside the expected distributions of a typical genome. CheckM also provides tools for identifying genome bins that are likely candidates for merging based on marker set compatibility, similarity in genomic characteristics, and proximity within a reference genome tree.</span></p><p>Address of the bookmark: <a href="http://ecogenomics.github.io/CheckM/" rel="nofollow">http://ecogenomics.github.io/CheckM/</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</guid>
	<pubDate>Tue, 20 Aug 2019 09:47:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39856/tritex-sequence-assembly-pipeline-for-triticeae-genomes</link>
	<title><![CDATA[TRITEX sequence assembly pipeline for Triticeae genomes]]></title>
	<description><![CDATA[<div>
<p>The pipeline is open-source and hosted in a public Bitbucket&nbsp;<a href="https://bitbucket.org/tritexassembly/tritexassembly.bitbucket.io/src/master/">repository</a>.</p>
</div>
<div>
<p>TRITEX has been run on highly inbred genotypes of barley (<em>Hordeum vulgare</em>), tetraploid wheat (<em>Triticum turgidum</em>) and hexaploid wheat (<em>T. aestivum</em>) with reasonable results: super-scaffold N50 values in the range of dozens of Mb and pseudomolecules with better gene space representation than a BAC-by-BAC assembly. It has never been tested and is not expected to work on heterozygous or autopolyploid genomes.</p>
</div>
<div>
<p>A protocol for generating chromosome-conformation capture sequencing (Hi-C) data suitable for use with the pipeline is described in&nbsp;<a href="https://bio-protocol.org/e2955">Himmelbach et al. 2018</a>. Refer to the&nbsp;<a href="https://www.10xgenomics.com/resources/technical-notes/">technical notes</a>&nbsp;of 10X Genomics on how to generate Chromium data.</p>
</div><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>