<?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/42965?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/42965?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44364/genbank-release-2570-is-now-available</guid>
	<pubDate>Wed, 23 Aug 2023 00:23:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44364/genbank-release-2570-is-now-available</link>
	<title><![CDATA[GenBank release 257.0 is now available!]]></title>
	<description><![CDATA[<p><span>GenBank release 257.0 is now available! This release has 25.10 trillion bases and 3.69 billion records. Learn more:&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2023/08/21/genbank-release-257/</span><a href="https://ow.ly/zHbV50PBE5o"><br /></a></p><p><a href="https://www.ncbi.nlm.nih.gov/genbank/?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=genbank-release-20230821">GenBank</a>&nbsp;release 257.0 (8/15/2023) is now available on the&nbsp;<a href="https://ftp.ncbi.nlm.nih.gov/genbank/">NCBI FTP site</a>. This release has 25.10 trillion bases and 3.69 billion records.</p><p><strong>The current release has:</strong></p><ul>
<li>246,119,175 traditional records containing 2,112,058,517,945 base pairs of sequence data</li>
<li>2,631,493,489 WGS records containing 22,294,446,104,543 base pairs of sequence data</li>
<li>686,271,945 bulk-oriented TSA records containing 646,176,166,908 base pairs of sequence data</li>
<li>124,421,006 bulk-oriented TLS records containing 48,289,699,026 base pairs of sequence data</li>
</ul>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37788/s-plot2-creates-an-interactive-two-dimensional-heatmap-of-sequences</guid>
	<pubDate>Fri, 28 Sep 2018 05:36:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37788/s-plot2-creates-an-interactive-two-dimensional-heatmap-of-sequences</link>
	<title><![CDATA[S-plot2: creates an interactive, two-dimensional heatmap of sequences]]></title>
	<description><![CDATA[<p><span>S-plot2 creates an interactive, two-dimensional heatmap capturing the similarities and dissimilarities in nucleotide usage between genomic sequences (partial or complete). In S-plot2, whole eukaryotic chromosomes and smaller prokaryotic genomes can be efficiently compared. The tool includes functionality to extract, analyze, and automate BLAST queries of regions of interest within the heatmap. This facilitates the investigation of quickly evolving coding regions, novel coding regions, and laterally transferred elements.</span></p>
<p><span>http://www.putonti-lab.com/uploads/4/5/3/0/45307835/s-plot2_tutorial.pdf</span></p>
<p><span>http://journals.sagepub.com/doi/pdf/10.1177/1176934318797354</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/lkalesinskas/splot" rel="nofollow">https://bitbucket.org/lkalesinskas/splot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</guid>
	<pubDate>Wed, 12 Dec 2018 09:22:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38452/silix-implements-an-ultra-efficient-algorithm-for-the-clustering-of-homologous-sequences</link>
	<title><![CDATA[SiLiX: implements an ultra-efficient algorithm for the clustering of homologous sequences]]></title>
	<description><![CDATA[<p>The software package SiLiX implements<strong>&nbsp;an ultra-efficient algorithm for the clustering of homologous sequences</strong>, based on single transitive links (<em>single linkage</em>) with alignment coverage constraints.</p>
<p>SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the&nbsp;<em>Disjoint Sets Data Structure</em>, allows the computation of sequence families with&nbsp;<strong>low time and space requirements</strong>.</p>
<p><strong>A parallel version</strong>&nbsp;of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of&nbsp;<strong>very large datasets</strong>.</p>
<p>SiLiX is already included in the analysis pipeline for&nbsp;<a href="http://pbil.univ-lyon1.fr/databases/hogenom/acceuil.php">HOGENOM</a>.</p><p>Address of the bookmark: <a href="http://lbbe.univ-lyon1.fr/SiLiX?lang=fr" rel="nofollow">http://lbbe.univ-lyon1.fr/SiLiX?lang=fr</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:38:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39867/gepard-allows-the-calculation-of-dotplots-even-for-large-sequences-like-chromosomes-or-bacterial-genomes</link>
	<title><![CDATA[Gepard: allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes]]></title>
	<description><![CDATA[<p>Gepard (German: "cheetah", Backronym for "GEnome PAir - Rapid Dotter") allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes. Reference: Krumsiek J, Arnold R, Rattei T. Gepard: A rapid and sensitive tool for creating dotplots on genome scale. Bioinformatics 2007; 23(8): 1026-8. PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17309896" target="_blank">17309896</a></p>
<p><a href="http://cube.univie.ac.at/gepard">http://cube.univie.ac.at/gepard</a></p><p>Address of the bookmark: <a href="https://github.com/univieCUBE/gepard" rel="nofollow">https://github.com/univieCUBE/gepard</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</guid>
	<pubDate>Thu, 14 Aug 2025 04:02:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</link>
	<title><![CDATA[Jaeger : an accurate and fast deep-learning tool to detect bacteriophage sequences]]></title>
	<description><![CDATA[<p dir="auto">Jaeger is a tool that utilizes homology-free machine learning to identify phage genome sequences that are hidden within metagenomes. It is capable of detecting both phages and prophages within metagenomic assemblies.</p>
<p dir="auto">The performance of the Jaeger workflow can be significantly increased by utilizing GPUs. To enable GPU support, the CUDA Toolkit and cuDNN library must be accessible to conda.</p>
<div>
<pre><code># setup bioconda
conda config --add channels defaults
conda config --add channels bioconda
conda config --add channels conda-forge
conda config --set channel_priority strict

# create conda environment and install jaeger
mamba create -n jaeger -c nvidia -c conda-forge cuda-nvcc "python&gt;=3.9,&lt;3.12" pip jaeger-bio


# activate environment
conda activate jaeger</code></pre>
</div><p>Address of the bookmark: <a href="https://github.com/MGXlab/Jaeger" rel="nofollow">https://github.com/MGXlab/Jaeger</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>