<?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/36111?offset=180</link>
	<atom:link href="https://bioinformaticsonline.com/related/36111?offset=180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43791/comparative-genomics-visualisation-tools</guid>
	<pubDate>Thu, 17 Feb 2022 05:37:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43791/comparative-genomics-visualisation-tools</link>
	<title><![CDATA[Comparative genomics visualisation tools !]]></title>
	<description><![CDATA[<p>Comparative genomics visualisation tools !</p><p>Address of the bookmark: <a href="https://cmdcolin.github.io/awesome-genome-visualization/?latest=true&amp;selected=%23BRIG&amp;tag=Comparative" rel="nofollow">https://cmdcolin.github.io/awesome-genome-visualization/?latest=true&amp;selected=%23BRIG&amp;tag=Comparative</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44551/bioinformatic-tools-for-pathogens-informatics-at-cvr</guid>
	<pubDate>Sat, 08 Jun 2024 15:59:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44551/bioinformatic-tools-for-pathogens-informatics-at-cvr</link>
	<title><![CDATA[Bioinformatic tools for pathogens informatics at CVR]]></title>
	<description><![CDATA[<div><div><div><div><div><p>Novel sequencing and analytical approaches focused on studying viruses and virus-host interactions. Below you will find summaries and links to a number of bioinformatic tools that have been developed @ CVR.</p></div><div><h3><a href="http://giffordlabcvr.github.io/DIGS-tool/" target="_blank" title="DIGS">DIGS</a></h3></div><div><p>The database-integrated genome-screening (DIGS) tool provides a framework for implementing automated in silico screening of sequence databases using BLAST in combination with a relational database (MySQL).</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/discvr/" target="" title="DisCVR">DisCVR</a></h3></div><div><p>DisCVR is a Diagnostic tool for detecting known human viruses in clinical samples from Next-Generation Sequencing (NGS) data. The tool uses a simple and straightforward Graphical User Interface and is optimized on Windows OS without compromising speed and accuracy.</p></div><div><h3><a href="http://josephhughes.github.io/DiversiTools/" target="_blank" title="DiversiTools">DiversiTools</a></h3></div><div><p>DiversiTools is a computational tool that is specifically tailored towards viral HTS data sets and the analysis of the underlying viral populations that they represent. It was initially developed in collaboration with a number of virologists interested in characterising the intra-host diversity of viral populations and studying their evolution across transmission chains at the micro-evolutionary scale.</p></div><div><h3><a href="http://glue-tools.cvr.gla.ac.uk/" target="_blank" title="GLUE">GLUE</a></h3></div><div><p>GLUE is a flexible data-centric bioinformatics environment for virus sequence data, with a focus on virus evolution and genomic variation. GLUE has been applied to a range of viruses. A GLUE-based resource focused on Hepatitis C virus is HCV-GLUE.</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/tanoti/" target="_blank" title="Tanoti">Tanoti</a></h3></div><div><p>Tanoti is a BLAST guided reference based short read aligner. It is developed for maximising alignment in highly variable next generation sequence data sets (Illumina).</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/victree/" target="_blank" title="VicTREE">ViCTree</a></h3></div><div><p>ViCTree is a bioinformatic framework that automatically selects new candidate virus sequences from GenBank, generates multiple sequence alignments, calculates a maximum likelihood phylogeny and integrates the sequences into the existing phylogenetic trees.&nbsp;<span>For more information click&nbsp;</span><a href="https://bioinformatics.cvr.ac.uk/victree_web/" target="_blank">here</a>.</p></div></div></div></div></div><div><div><div><div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/viral-host-predictor/" target="" title="Viral Host Predictor">Viral Host Predictor</a></h3></div><div><p>Viral Host Predictor provides a fast and simple way to predict the hosts and vectors of RNA viruses from viral sequences.</p></div><div><h3><a href="https://github.com/salvocamiolo/GRACy/releases/tag/v0.4.4" target="_blank" title="GRACy">GRACy</a></h3></div><div><p>GRACy is a bioinformatic tool designed for the analysis of Illumina data originated from Human cytomegalovirus samples. GRACy can be used to perform read quality filtering, genotyping, de novo assembly, variant detection, annotation and data submission to public database.</p></div><div><h3><a href="https://github.com/salvocamiolo/LoReTTA/releases/tag/v0.1" target="_blank" title="LoReTTA">LoReTTA</a></h3></div><div><p>LoReTTA (Long Read Template Targeted Assembler) is a reference assisted de novo assembler specifically designed to deal with PacBio reads generated from viral genomes.&nbsp;</p></div><div><h3><a href="https://bioinformatics.cvr.ac.uk/software/bingleseq/" target="" title="BingleSeq">BingleSeq</a></h3></div><div><p>BingleSeq is a R-package enables the user-friendly analysis of count tables obtained by both Bulk RNA-Seq and single-cell RNA-Seq protocols. The development of BingleSeq focused on providing a flexible and intuitive user experience.</p></div></div></div></div></div>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</guid>
	<pubDate>Mon, 10 Apr 2017 05:42:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32134/lifemap</link>
	<title><![CDATA[Lifemap]]></title>
	<description><![CDATA[<p><strong>Lifemap</strong> is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in <strong>Lifemap</strong> is similar to the one used in cartography with tools like Google Maps&copy; or Open Street Maps: exploring is done by zooming and panning.</p>
<div>
<p>&nbsp;The current tree contains ALL species present in NCBI taxonomy as of <span style="text-decoration: underline;">October 18th, 2016</span>: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.</p>
</div>
<p>&nbsp;All the nodes in the tree are clickable. This displays various information and options:</p>
<ul>
<li>The species name (and the associated common name if there is one)</li>
<li>The rank (kingdom, family, class, species...)</li>
<li>Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)</li>
<li>Possibility to download the corresponding subtree in newick extended format</li>
<li>Possibilty to get the whole lineage from the current node/tip to the root of the tree.</li>
</ul><p>Address of the bookmark: <a href="http://lifemap-ncbi.univ-lyon1.fr/" rel="nofollow">http://lifemap-ncbi.univ-lyon1.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/38293/tree-illustrating-the-lack-of-interchromosomal-rearrangement-of-the-microchromosomes</guid>
	<pubDate>Mon, 26 Nov 2018 04:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38293/tree-illustrating-the-lack-of-interchromosomal-rearrangement-of-the-microchromosomes</link>
	<title><![CDATA[Tree illustrating the lack of interchromosomal rearrangement of the microchromosomes.]]></title>
	<description><![CDATA[<p><span>Tree illustrating the lack of interchromosomal rearrangement of the microchromosomes. No interchromosomal microchromosome fusions from the avian ancestor unless otherwise stated (macrochromosomal fusions not listed). The overall pattern of microchromosome stability and rearrangement across the species is illustrated</span></p><p><span><span>Jarvis et al. (2014)</span></span></p><p><span><span>Reference&nbsp;https://link.springer.com/article/10.1007/s00412-018-0685-6</span></span></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38293" length="291560" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43548/upgma-worked-example</guid>
	<pubDate>Wed, 13 Oct 2021 06:13:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43548/upgma-worked-example</link>
	<title><![CDATA[UPGMA Worked Example]]></title>
	<description><![CDATA[<p><span>The tabs below include a walkthrough of clustering 7 biological sequences (A-G) using the Unweighted Pair-Group Method with Arithmetic mean (UPGMA) method. Note that UPGMA is actually a generic method and thus the walkthrough could apply to any objects A-G for which pairwise distances can be calculated. A small CGI site for generating a UPGMA tree from a distance matrix can be found&nbsp;</span><a href="http://bioware.soton.ac.uk/upgma.html">here</a><span>.</span></p><p>Address of the bookmark: <a href="http://www.slimsuite.unsw.edu.au/teaching/upgma/" rel="nofollow">http://www.slimsuite.unsw.edu.au/teaching/upgma/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</guid>
	<pubDate>Wed, 03 Feb 2021 05:07:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42794/tmrca-calculator</link>
	<title><![CDATA[TMRCA Calculator]]></title>
	<description><![CDATA[<p><span>This program calculates the probability that two people have a certain number of generations between them, based on the standard&nbsp;</span><em>infinite alleles</em><span>&nbsp;formula of Walsh. It calculates both the probability of being at an exact number of generations back to the Most Recent Common Ancestor (MRCA) of a certain pair of people and the cumulative probability that the actual number of generations is less than a certain value. Note that the convention using generations is changed from an earlier version of this calculator which used "transmission events". It can list both result types in a table or graph. In either case the horizontal axis stops at the point where the cumulative probability reaches 95% or 10 generations, whichever is longer, or an absolute max of 50,000. Beyond 90% the calculation becomes inaccurate.</span></p>
<p>https://clandonaldusa.org/index.php/tmrca-calculator</p><p>Address of the bookmark: <a href="https://clandonaldusa.org/index.php/tmrca-calculator" rel="nofollow">https://clandonaldusa.org/index.php/tmrca-calculator</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<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/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/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</guid>
	<pubDate>Fri, 29 Jun 2018 09:19:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</link>
	<title><![CDATA[JBrowse: Embeddable genome browser built completely with JavaScript and HTML5]]></title>
	<description><![CDATA[JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl.

Headline Features:
Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed.
Scales easily to multi-gigabase genomes and deep-coverage sequencing.
Quickly open and view data files on your computer without uploading them to any server.
Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more.  BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed.
Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks.
Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance.
Can run as a stand-alone app on OSX and Windows using the Electron platform
Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry

https://jbrowse.org/<p>Address of the bookmark: <a href="https://github.com/GMOD/jbrowse" rel="nofollow">https://github.com/GMOD/jbrowse</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>