<?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/34543?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/34543?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</guid>
	<pubDate>Thu, 24 May 2018 02:53:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</link>
	<title><![CDATA[%MinMax: A versatile tool for calculating and comparing synonymous codon usage and its impact on protein folding.]]></title>
	<description><![CDATA[%MM calculates whether a given gene sequence encodes amino acids using the most common codons possible, the least common codons possible, or (most typically) some combination of these extremes. See our PLoS ONE paper for more details on how the %MinMax algorithm works. 

%MinMax results are averaged over an 18-codon sliding window; hence the result for "codon window = 1" is the average codon usage for codons 1-18, codon window 2 = codons 2-19, etc.<p>Address of the bookmark: <a href="http://www.codons.org/" rel="nofollow">http://www.codons.org/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</guid>
	<pubDate>Mon, 09 Jul 2018 05:27:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</link>
	<title><![CDATA[Epiviz: an interactive visualization tool for functional genomics data.]]></title>
	<description><![CDATA[<p><span>Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other user-supplied visualizations. It also includes data from the&nbsp;</span><a href="http://barcode.luhs.org/" target="_blank">Gene Expression Barcode project</a><span>&nbsp;for transcriptome visualization. It has a flexible plugin framework so users can add</span><a href="http://d3js.org/" target="_blank">d3</a><span>&nbsp;visualizations. You can see a video tour&nbsp;</span><a href="http://youtu.be/099c4wUxozA" target="_blank">here</a><span>.</span></p>
<p><span>https://bioconductor.org/packages/release/bioc/html/epivizr.html</span></p>
<p><span>https://github.com/epiviz</span></p>
<p><span>https://github.com/epiviz/epiviz</span></p><p>Address of the bookmark: <a href="https://epiviz.github.io/" rel="nofollow">https://epiviz.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</guid>
	<pubDate>Mon, 01 Oct 2018 08:34:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</link>
	<title><![CDATA[Heatmapper: web-enabled heat mapping for all]]></title>
	<description><![CDATA[<p><span>Heatmapper is a freely available web server that allows users to interactively visualize their data in the form of heat maps through an easy-to-use graphical interface. Heatmapper is a versatile tool that allows users to easily create a wide variety of heat maps for many different data types and applications. Heatmapper allows users to generate, cluster and visualize: </span></p>
<p><span>1)&nbsp;</span><span>expression-based heat maps</span><span>&nbsp;from transcriptomic, proteomic and metabolomic experiments; 2)&nbsp;</span><span>pairwise distance maps</span><span>; </span></p>
<p><span>3)&nbsp;</span><span>correlation maps</span><span>; </span></p>
<p><span>4)&nbsp;</span><span>image overlay heat maps</span><span>; </span></p>
<p><span>5)&nbsp;</span><span>latitude and longitude heat maps</span><span>&nbsp;and </span></p>
<p><span>6)&nbsp;</span><span>geopolitical (choropleth) heat maps</span><span>. </span></p>
<p><span>Heatmapper offers a number of simple and intuitive customization options for easy adjustments to each heat map&rsquo;s appearance and plotting parameters. Heatmapper also allows users to interactively explore their numeric data values by hovering their cursor over each heat map, or by using a searchable/sortable data table view.</span></p>
<p><span>Ref&nbsp;https://www.ncbi.nlm.nih.gov/pubmed/27190236</span></p><p>Address of the bookmark: <a href="http://www2.heatmapper.ca/" rel="nofollow">http://www2.heatmapper.ca/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</guid>
	<pubDate>Wed, 12 Dec 2018 09:16:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</link>
	<title><![CDATA[KOALA: KEGG&#039;s internal annotation tool for K number assignment of KEGG GENES using SSEARCH computation]]></title>
	<description><![CDATA[<p>KOALA (KEGG Orthology And Links Annotation) is KEGG's internal annotation tool for&nbsp;<a href="https://www.kegg.jp/kegg/ko.html">K number</a>&nbsp;assignment of KEGG GENES using SSEARCH computation. BlastKOALA and GhostKOALA assign K numbers to the user's sequence data by&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/">BLAST</a>&nbsp;and&nbsp;<a href="http://www.bi.cs.titech.ac.jp/ghostx/">GHOSTX</a>&nbsp;searches, respectively, against a nonredundant set of KEGG GENES. Annotate Sequence in KEGG Mapper and Pathogen Checker in KEGG Pathogen are special interfaces to the BlastKOALA server and can be executed in an interactive mode. &nbsp;&nbsp; See&nbsp;<a href="https://www.kegg.jp/blastkoala/help_blastkoala.html" target="_blastkoala">Step-by-step Instructions</a>.</p>
<div>Reference: Kanehisa, M., Sato, Y., and Morishima, K. (2016) BlastKOALA and GhostKOALA: KEGG tools for functional characterization of genome and metagenome sequences. J. Mol. Biol. 428, 726-731. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/26585406">pubmed</a>] [<a href="https://doi.org/10.1016/j.jmb.2015.11.006">pdf</a>]</div><p>Address of the bookmark: <a href="https://www.kegg.jp/blastkoala/" rel="nofollow">https://www.kegg.jp/blastkoala/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39728/patterns-a-modeling-tool-dedicated-to-biological-network-modeling</guid>
	<pubDate>Fri, 26 Jul 2019 01:11:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39728/patterns-a-modeling-tool-dedicated-to-biological-network-modeling</link>
	<title><![CDATA[Patterns: a modeling tool dedicated to biological network modeling]]></title>
	<description><![CDATA[<p>It is designed to work with <strong>patterned data</strong>. Famous examples of problems related to patterned data are:</p>
<ul>
<li>recovering <strong>signals</strong> in networks after a <strong>stimulation</strong> (cascade network reverse engineering),</li>
<li>analysing <strong>periodic signals</strong>.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/fbertran/Patterns" rel="nofollow">https://github.com/fbertran/Patterns</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40721/efs-an-ensemble-feature-selection-tool-implemented-as-r-package-and-web-application</guid>
	<pubDate>Tue, 28 Jan 2020 05:12:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40721/efs-an-ensemble-feature-selection-tool-implemented-as-r-package-and-web-application</link>
	<title><![CDATA[EFS: an ensemble feature selection tool implemented as R-package and web-application]]></title>
	<description><![CDATA[<p><span>The software EFS (Ensemble Feature Selection) makes use of multiple feature selection methods and combines their normalized outputs to a quantitative ensemble importance. Currently, eight different feature selection methods have been integrated in EFS, which can be used separately or combined in an ensemble.</span></p>
<p><a href="https://biodatamining.biomedcentral.com/articles/10.1186/s13040-017-0142-8">https://biodatamining.biomedcentral.com/articles/10.1186/s13040-017-0142-8</a></p><p>Address of the bookmark: <a href="http://efs.heiderlab.de/" rel="nofollow">http://efs.heiderlab.de/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</guid>
	<pubDate>Tue, 30 Jun 2020 21:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</link>
	<title><![CDATA[truvari: Structural variant comparison tool for VCFs]]></title>
	<description><![CDATA[<p>Structural variant comparison tool for VCFs</p>
<p>Given benchmark and comparsion sets of SVs, calculate the recall, precision, and f-measure.</p>
<p><a href="https://github.com/spiralgenetics/www.spiralgenetics.com">Spiral Genetics</a></p>
<p><a href="https://docs.google.com/presentation/d/17mvC1XOpOm7khAbZwF3SgtG2Rl4M9Mro37yF2nN7GhE/edit">Motivation</a></p><p>Address of the bookmark: <a href="https://github.com/spiralgenetics/truvari" rel="nofollow">https://github.com/spiralgenetics/truvari</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>