<?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/44637?offset=510</link>
	<atom:link href="https://bioinformaticsonline.com/related/44637?offset=510" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33660/equant-energy-based-quality-assessment-of-protein</guid>
	<pubDate>Sat, 24 Jun 2017 19:24:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33660/equant-energy-based-quality-assessment-of-protein</link>
	<title><![CDATA[eQuant : energy-based quality assessment of protein]]></title>
	<description><![CDATA[<p><span>Protein structures are of varying quality. Especially,&nbsp;</span><em>in-silico</em><span>&nbsp;modeled structures are prone to contain serious errors, which limit the usefulness and reliability of these particular protein structures.</span><br><br><span>eQuant is a service for structure quality assessment of single proteins, which utilizes a coarse-grained energy model. The overall quality is calculated as well as the reliability of individual residues. You can submit single PDB files or archives containing a set of proteins.</span></p>
<p>https://biosciences.hs-mittweida.de/equant/</p><p>Address of the bookmark: <a href="https://biosciences.hs-mittweida.de/equant/" rel="nofollow">https://biosciences.hs-mittweida.de/equant/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</guid>
	<pubDate>Fri, 29 Apr 2016 05:49:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</link>
	<title><![CDATA[Easyfig]]></title>
	<description><![CDATA[<p>Easyfig has moved to github, for newer releases of Easyfig please visit our new webpage - https://mjsull.github.io/Easyfig.&nbsp; Easyfig is a Python application for creating linear comparison figures of multiple genomic loci with an easy-to-use graphical user interface (GUI).</p>
<p>More at http://easyfig.sourceforge.net/</p><p>Address of the bookmark: <a href="http://easyfig.sourceforge.net/" rel="nofollow">http://easyfig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</guid>
	<pubDate>Thu, 18 May 2017 05:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</link>
	<title><![CDATA[maf2synteny]]></title>
	<description><![CDATA[<p>A tool for converting for recovering synteny blocks from multiple alignment (in MAF fromat)</p>
<p>This tool is a standalone version of Ragout module [<a href="http://fenderglass.github./Ragout">http://fenderglass.github./Ragout</a>]</p><p>Address of the bookmark: <a href="https://github.com/fenderglass/maf2synteny" rel="nofollow">https://github.com/fenderglass/maf2synteny</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 07 Mar 2018 18:11:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>https://www.youtube.com/watch?v=WgufqYMHCvM</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41736/synvisio-an-interactive-multiscale-synteny-visualization-tool-for-mcscanx</guid>
	<pubDate>Sun, 31 May 2020 02:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41736/synvisio-an-interactive-multiscale-synteny-visualization-tool-for-mcscanx</link>
	<title><![CDATA[SynVisio: An Interactive Multiscale Synteny Visualization Tool for McScanX.]]></title>
	<description><![CDATA[<p>SynVisio lets you explore the results of&nbsp;<a href="http://chibba.pgml.uga.edu/mcscan2/">McScanX</a>&nbsp;a popular synteny and collinearity detection toolkit and generate publication ready images.</p>
<p>SynVisio requires two files to run:</p>
<ul>
<li>The&nbsp;<strong>simplified gff file</strong>&nbsp;that was used as an input for a McScanX query.</li>
<li>The&nbsp;<strong>collinearity file</strong>&nbsp;generated as an output by McScanX for the same input query.</li>
<li>Optional&nbsp;<strong>track file</strong>&nbsp;in bedgraph format to annotate the generated charts.</li>
</ul>
<p>SynVisio offers different types of visualizations such as&nbsp;<strong>Linear Parallel plots</strong>,&nbsp;<strong>Hive plots</strong>,&nbsp;<strong>Stacked Parallel Plots&nbsp;</strong>and&nbsp;<strong>Dot plots</strong>. Users can configure the type of plots required and then choose the source and the target chromosomes that need to be mapped. Users also have option to download the generated visualizations in publication ready SVG or PNG formats.</p><p>Address of the bookmark: <a href="https://synvisio.github.io/#/" rel="nofollow">https://synvisio.github.io/#/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</guid>
	<pubDate>Fri, 14 Jun 2024 14:42:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</link>
	<title><![CDATA[Panacus : A Counting Tool for Pangenome Graphs]]></title>
	<description><![CDATA[<p dir="auto"><code>panacus</code>&nbsp;is a tool for calculating statistics for&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA</a>&nbsp;files. It supports GFA files with&nbsp;<code>P</code>&nbsp;and&nbsp;<code>W</code>&nbsp;lines, but requires that the graph is&nbsp;<code>blunt</code>, i.e., nodes do not overlap and consequently, each link (<code>L</code>) points from the end of one segment (<code>S</code>) to the start of another.</p>
<p dir="auto"><code>panacus</code>&nbsp;supports the following calculations:</p>
<ul dir="auto">
<li>coverage histogram</li>
<li>pangenome growth statistics</li>
<li>path-/group-resolved coverage table</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marschall-lab/panacus" rel="nofollow">https://github.com/marschall-lab/panacus</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>