<?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/43263?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/43263?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44896/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</guid>
	<pubDate>Sun, 31 Aug 2025 06:30:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44896/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><span>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.</span></p><p>Address of the bookmark: <a href="https://github.com/MGXlab/Jaeger" rel="nofollow">https://github.com/MGXlab/Jaeger</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</guid>
	<pubDate>Thu, 25 Oct 2018 04:48:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37987/ropebwt2-incremental-construction-of-fm-index-for-dna-sequences</link>
	<title><![CDATA[RopeBWT2: Incremental construction of FM-index for DNA sequences]]></title>
	<description><![CDATA[<p><span>RopeBWT2 is an tool for constructing the FM-index for a collection of DNA sequences. It works by incrementally inserting one or multiple sequences into an existing pseudo-BWT position by position, starting from the end of the sequences. This algorithm can be largely considered a mixture of&nbsp;</span><a href="http://dx.doi.org/10.1007/978-3-642-21458-5_20">BCR</a><span>&nbsp;and&nbsp;</span><a href="http://dfmi.sourceforge.net/">dynamic FM-index</a><span>. Nonetheless, ropeBWT2 is unique in that it may&nbsp;</span><em>implicitly</em><span>sort the input into reverse lexicographical order (RLO) or reverse-complement lexicographical order (RCLO) while building the index.</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/ropebwt2" rel="nofollow">https://github.com/lh3/ropebwt2</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/29917/gojs</guid>
	<pubDate>Tue, 22 Nov 2016 08:25:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29917/gojs</link>
	<title><![CDATA[GoJS]]></title>
	<description><![CDATA[<p><strong>GoJS</strong> is a feature-rich JavaScript library for implementing custom interactive diagrams and complex visualizations across modern web browsers and platforms. <strong>GoJS</strong> makes constructing JavaScript diagrams of complex nodes, links, and groups easy with customizable templates and layouts.</p>
<p><strong>GoJS</strong> offers many advanced features for user interactivity such as drag-and-drop, copy-and-paste, in-place text editing, tooltips, context menus, automatic layouts, templates, data binding and models, transactional state and undo management, palettes, overviews, event handlers, commands, and an extensible tool system for custom operations.</p>
<p><strong>GoJS</strong> is pure JavaScript, so users get interactivity without requiring round-trips to servers and without plugins. <strong>GoJS</strong> normally runs completely in the browser, rendering to an HTML5 Canvas element or SVG without any server-side requirements. <strong>GoJS</strong> does not depend on any JavaScript libraries or frameworks, so it should work with any HTML or JavaScript framework or with no framework at all. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</p>
<p>More at&nbsp;http://gojs.net/latest/index.html</p><p>Address of the bookmark: <a href="http://gojs.net/latest/index.html" rel="nofollow">http://gojs.net/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</guid>
	<pubDate>Tue, 30 Oct 2018 10:46:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</link>
	<title><![CDATA[VGSC: A Web-Based Vector Graph Toolkit of Genome Synteny and Collinearity]]></title>
	<description><![CDATA[<p><span>VGSC, the Vector Graph toolkit of genome Synteny and Collinearity, and its online service, to visualize the synteny and collinearity in the common graphical format, including both raster (JPEG, Bitmap, and PNG) and vector graphic (SVG, EPS, and PDF).</span><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45267/when-thousands-of-bacterial-genomes-become-one-giant-map</guid>
	<pubDate>Thu, 27 Aug 2026 10:56:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45267/when-thousands-of-bacterial-genomes-become-one-giant-map</link>
	<title><![CDATA[When Thousands of Bacterial Genomes Become One Giant Map]]></title>
	<description><![CDATA[<p>Imagine trying to understand a city by studying just one house.</p><p>You might learn a lot about that house&mdash;the rooms, the doors, the furniture&mdash;but you would miss the bigger story: the streets, the neighborhoods, and all the ways the city changes from one place to another.</p><p>Something similar happens when scientists study bacterial genomes one at a time.</p><p>Over the past decade, researchers have collected thousands of bacterial genomes. These genomes contain an enormous amount of information about how bacteria survive, adapt, and evolve. But comparing thousands of individual genomes can quickly become a computational maze.</p><p>That is where PANORAMA enters the story.</p><p>Developed by J&eacute;r&ocirc;me Arnoux and colleagues, PANORAMA is a computational tool designed to explore bacterial pangenomes&mdash;the complete collection of genetic possibilities found across a species or group of related organisms. Instead of looking at every genome as an isolated object, the approach represents their shared and variable genetic features as a graph.</p><p>Think of this graph as a giant subway map.</p><p>Some stations appear on almost every route. These represent genes that are highly conserved. Other stations appear only on certain routes, representing genes that some bacteria possess while others do not. By looking at the entire network, scientists can begin to see not just *what genes exist*, but how they are organized and how biological systems are distributed across populations.</p><p>The researchers put PANORAMA to the test using 941 genomes of Pseudomonas aeruginosa, a bacterium important in human health. They used the tool to investigate biological systems, including bacterial defense mechanisms against viruses known as bacteriophages. They then expanded the analysis to more than 6,000 genomes from four Enterobacteriaceae species.</p><p>The result is more than a faster way to process data.</p><p>PANORAMA allows researchers to ask a bigger question: What can an entire microbial species do, genetically speaking?</p><p>By comparing pangenomes, the researchers could identify systems shared between species as well as distinctive features. They could also find recurring genomic locations where genetic material is inserted&mdash;clues that may reveal common evolutionary processes.</p><p>And this is perhaps the most exciting part of the story.</p><p>Every bacterial genome is like a page in a huge evolutionary book. Until recently, reading thousands of those pages together was difficult. PANORAMA provides a way to turn those pages into a map, allowing scientists to see patterns that might disappear when each genome is studied separately.</p><p>The study, published in PLOS Computational Biology in July 2026, presents PANORAMA as a foundation for large-scale comparative pangenomics. The software and accompanying analysis resources are openly available, giving other researchers the opportunity to explore microbial diversity themselves.</p><p>So the story is not really about one bacterium or one genome.</p><p>It is about changing the way we look at life.</p><p>Instead of asking, &ldquo;What is inside this genome?&rdquo;, scientists can increasingly ask, &ldquo;What is the full genetic landscape of this species&mdash;and how did it become this way?&rdquo;</p><p>And sometimes, when you stop looking at one house and finally see the whole city, the most interesting discoveries are hiding in the streets between them.</p><p>Read more at&nbsp;https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013856</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</guid>
	<pubDate>Mon, 04 Feb 2019 04:53:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</link>
	<title><![CDATA[wtdbg2: A fuzzy Bruijn graph approach to long noisy reads assembly]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output.&nbsp;</span></p>
<pre>./wtdbg2 -x rs -g 4.6m -t 16 -i reads.fa.gz -fo prefix
./wtpoa-cns -t 16 -i prefix.ctg.lay.gz -fo prefix.ctg.fa</pre><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44182/collection-of-graph-visualization-tools</guid>
	<pubDate>Wed, 25 Jan 2023 02:57:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44182/collection-of-graph-visualization-tools</link>
	<title><![CDATA[Collection of Graph Visualization tools !]]></title>
	<description><![CDATA[<p>Standard approaches to genome inference and analysis relate sequences to a single linear reference genome. This is efficient but has a fundamental problem: Differences from this reference are hard to observe and describe in a coherent way. Variation and sequence are separated.</p>
<p><a href="https://pangenome.github.io/images/genomic-vs-pangenomic-analysis.png"><img src="https://pangenome.github.io/images/genomic-vs-pangenomic-analysis.png" alt="image" width="45%" style="border: 0px; border: 0px;"></a><span>&nbsp;</span><a href="https://pangenome.github.io/images/genomic-vs-pangenomic-models.png"><img src="https://pangenome.github.io/images/genomic-vs-pangenomic-models.png" alt="image" width="54%" style="border: 0px; border: 0px;"></a></p>
<p><a href="https://fungidb.org/fungidb/app/downloads/Current_Release/GultimumBR650/" target="_blank">https://fungidb.org/fungidb/app/downloads/Current_Release/GultimumBR650/</a></p><p>Address of the bookmark: <a href="https://pangenome.github.io/" rel="nofollow">https://pangenome.github.io/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19087/dcgor</guid>
	<pubDate>Sat, 08 Nov 2014 14:54:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19087/dcgor</link>
	<title><![CDATA[dcGOR]]></title>
	<description><![CDATA[<p>An R package for analysing ontologies and protein domain annotations has been published in PLoS Computational Biology (http://dx.doi.org/10.1371/journal.pcbi.1003929). The package is distributed as part of CRAN (http://cran.r-project.org/package=dcGOR), and also at GitHub for version control.<br /><br />The dedicated website is available in http://supfam.org/dcGOR, from which several demos are also provided:<br /><br />1. Analysing SCOP domains: http://supfam.org/dcGOR/demo-Fang.html<br /><br />2. Analysing Pfam domains: http://supfam.org/dcGOR/demo-Basu.html<br /><br />3. Analysing InterPro domains: http://supfam.org/dcGOR/demo-Customisation.html<br /><br />&nbsp;</p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>