<?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/44571?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/44571?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40594/gfaviz-flexible-and-interactive-visualization-of-gfa-sequence-graphs</guid>
	<pubDate>Thu, 23 Jan 2020 07:33:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40594/gfaviz-flexible-and-interactive-visualization-of-gfa-sequence-graphs</link>
	<title><![CDATA[GfaViz: flexible and interactive visualization of GFA sequence graphs]]></title>
	<description><![CDATA[<p><span>GFA (Graphical Fragment Assembly) is an emerging standard format for representing sequence graphs. Although it was originally conceived as a format for sequence assembly (hence the name), and this remains its core application, it is more general, and able to represent many different types of sequence graphs, including scaffolding graphs, alignment graphs, variant graphs and splicing graphs.</span></p><p>Address of the bookmark: <a href="https://github.com/ggonnella/gfaviz" rel="nofollow">https://github.com/ggonnella/gfaviz</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43120/ventoy-an-open-source-tool-to-create-bootable-usb-drive</guid>
	<pubDate>Tue, 29 Jun 2021 10:16:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43120/ventoy-an-open-source-tool-to-create-bootable-usb-drive</link>
	<title><![CDATA[Ventoy: an open source tool to create bootable USB drive]]></title>
	<description><![CDATA[<p>Ventoy is an open source tool to create bootable USB drive for ISO/WIM/IMG/VHD(x)/EFI files. With ventoy, you don't need to format the disk over and over, you just need to copy the image files to the USB drive and boot it. You can copy many image files at a time and ventoy will give you a boot menu to select them. x86 Legacy BIOS, IA32 UEFI, x86_64 UEFI, ARM64 UEFI and MIPS64EL UEFI are supported in the same way. Both MBR and GPT partition style are supported in the same way. Most type of OS supported(Windows/WinPE/Linux/Unix/Vmware/Xen...) 700+ ISO files are tested.&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/ventoy/Ventoy" rel="nofollow">https://github.com/ventoy/Ventoy</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43902/interactivenn-a-web-based-tool-for-the-analysis-of-sets-through-venn-diagrams</guid>
	<pubDate>Wed, 29 Jun 2022 03:22:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43902/interactivenn-a-web-based-tool-for-the-analysis-of-sets-through-venn-diagrams</link>
	<title><![CDATA[InteractiVenn: a web-based tool for the analysis of sets through Venn diagrams]]></title>
	<description><![CDATA[<p><span>InteractiVenn, a more flexible tool for interacting with Venn diagrams including up to six sets. It offers a clean interface for Venn diagram construction and enables analysis of set unions while preserving the shape of the diagram. Set unions are useful to reveal differences and similarities among sets and may be guided in our tool by a tree or by a list of set unions. The tool also allows obtaining subsets&rsquo; elements, saving and loading sets for further analyses, and exporting the diagram in vector and image formats. InteractiVenn has been used to analyze two biological datasets, but it may serve set analysis in a broad range of domains.</span></p>
<p><span>More at&nbsp;https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0611-3</span></p>
<p><span><img src="https://media.springernature.com/lw685/springer-static/image/art%3A10.1186%2Fs12859-015-0611-3/MediaObjects/12859_2015_611_Fig1_HTML.gif?as=webp" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="http://www.interactivenn.net/" rel="nofollow">http://www.interactivenn.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</guid>
	<pubDate>Sun, 31 Mar 2024 02:43:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</link>
	<title><![CDATA[Minda: a tool for evaluating structural variant (SV) callers]]></title>
	<description><![CDATA[<p dir="auto">Minda is a tool for evaluating structural variant (SV) callers that</p>
<ul dir="auto">
<li>standardizes VCF records for compatibility with both germline and somatic SV callers,</li>
<li>benchmarks against a single VCF input file, or</li>
<li>benchmarks against an ensemble call set created from multiple VCF input files.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/KolmogorovLab/minda" rel="nofollow">https://github.com/KolmogorovLab/minda</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44661/lovis4u-locus-visualisation-tool-for-comparative-genomics</guid>
	<pubDate>Tue, 17 Sep 2024 02:30:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44661/lovis4u-locus-visualisation-tool-for-comparative-genomics</link>
	<title><![CDATA[LoVis4u: Locus Visualisation tool for comparative genomics]]></title>
	<description><![CDATA[<p dir="auto"><a href="https://github.com/art-egorov/lovis4u/blob/main/docs/img/lovis4u_logo.png" target="_blank"><img src="https://github.com/art-egorov/lovis4u/raw/main/docs/img/lovis4u_logo.png" alt="image" width="300" style="border: 0px; border: 0px;"></a></p>
<div dir="auto">
<h2 dir="auto">Description</h2>
<a href="https://github.com/art-egorov/lovis4u#description"></a></div>
<p dir="auto"><span>LoVis4u</span>&nbsp;is a bioinformatics tool for&nbsp;<span>Lo</span>ci&nbsp;<span>Vis</span>ualisation.</p>
<p dir="auto"><span>LoVis4u, a command-line tool and Python API designed for highly customizable and fast visualisation of multiple genomic loci. LoVis4u generates vector images in PDF format based on annotation data from GenBank or GFF files. It is capable of visualising entire genomes of bacteriophages as well as plasmids and user-defined regions of longer prokaryotic genomes. Additionally, LoVis4u offers optional data processing steps to identify and highlight accessory and core genes in input sequences.</span></p>
<p dir="auto">https://art-egorov.github.io/lovis4u/</p>
<p dir="auto">&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/art-egorov/lovis4u" rel="nofollow">https://github.com/art-egorov/lovis4u</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</guid>
	<pubDate>Tue, 23 Jan 2018 05:28:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</link>
	<title><![CDATA[Alfred: BAM Statistics and Feature Counting]]></title>
	<description><![CDATA[<p>The easiest way to get Alfred is to download a statically linked binary from the&nbsp;<a href="https://github.com/tobiasrausch/alfred/releases/">Alfred github release page</a>. Alternatively, you can build Alfred from source. Alfred dependencies are included as submodules so you need to do a recursive clone.</p>
<p><code>git clone --recursive https://github.com/tobiasrausch/alfred.git</code></p>
<p><code>cd alfred/</code></p>
<p><code>make all</code></p>
<p>https://github.com/tobiasrausch/alfred/</p><p>Address of the bookmark: <a href="https://gear.embl.de/alfred" rel="nofollow">https://gear.embl.de/alfred</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43957/gfastats-the-swiss-army-knife-for-genome-assembly</guid>
	<pubDate>Thu, 08 Sep 2022 06:03:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43957/gfastats-the-swiss-army-knife-for-genome-assembly</link>
	<title><![CDATA[gfastats: The swiss army knife for genome assembly.]]></title>
	<description><![CDATA[<p><span>gfastats</span><span>&nbsp;is a single fast and exhaustive tool for&nbsp;</span><span>summary statistics</span><span>&nbsp;and simultaneous *fa* (fasta, fastq, gfa [.gz]) genome assembly file&nbsp;</span><span>manipulation</span><span>.&nbsp;</span><span>gfastats</span><span>&nbsp;also allows seamless fasta&lt;&gt;fastq&lt;&gt;gfa[.gz] conversion. It has been tested in genomes even &gt;100Gbp.</span></p><p>Address of the bookmark: <a href="https://github.com/vgl-hub/gfastats" rel="nofollow">https://github.com/vgl-hub/gfastats</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>