<?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/40721?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/40721?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40964/panev-an-r-package-for-a-pathway-based-network-visualization</guid>
	<pubDate>Sun, 09 Feb 2020 12:41:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40964/panev-an-r-package-for-a-pathway-based-network-visualization</link>
	<title><![CDATA[PANEV: an R package for a pathway-based network visualization]]></title>
	<description><![CDATA[<p><span>PANEV (PAthway NEtwork Visualizer) is an R package set for gene/pathway-based network visualization. Based on information available on KEGG, it visualizes genes within a network of multiple levels (from 1 to&nbsp;</span><em>n</em><span>) of interconnected upstream and downstream pathways. The network graph visualization helps to interpret functional profiles of a cluster of genes.</span></p>
<p><span><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3371-7">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3371-7</a></span></p><p>Address of the bookmark: <a href="https://github.com/vpalombo/PANEV" rel="nofollow">https://github.com/vpalombo/PANEV</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</guid>
	<pubDate>Fri, 28 Feb 2020 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41272/rainbowr-reliable-association-inference-by-optimizing-weights-with-r-r-package-for-snp-set-gwas-and-multi-kernel-mixed-model</link>
	<title><![CDATA[RAINBOWR: Reliable Association INference By Optimizing Weights with R (R package for SNP-set GWAS and multi-kernel mixed model)]]></title>
	<description><![CDATA[<p><code>RAINBOWR</code>(Reliable Association INference By Optimizing Weights with R) is a package to perform several types of <code>GWAS</code> as follows.</p>
<ul>
<li>Single-SNP GWAS with <code>RGWAS.normal</code> function</li>
<li>SNP-set (or gene set) GWAS with <code>RGWAS.multisnp</code> function (which tests multiple SNPs at the same time)</li>
<li>Check epistatic (SNP-set x SNP-set interaction) effects with <code>RGWAS.epistasis</code> (very slow and less reliable)</li>
</ul>
<p>https://github.com/KosukeHamazaki/RAINBOWR</p>
<p>https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007663</p>
<p>https://cran.r-project.org/web/packages/RAINBOWR/index.html</p><p>Address of the bookmark: <a href="https://github.com/KosukeHamazaki/RAINBOWR" rel="nofollow">https://github.com/KosukeHamazaki/RAINBOWR</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</guid>
	<pubDate>Mon, 09 Nov 2020 02:56:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42299/platypus-%E2%80%93-r-package-for-object-detection-and-image-segmentation</link>
	<title><![CDATA[Platypus – R package for object detection and image segmentation.]]></title>
	<description><![CDATA[<p><a href="https://github.com/maju116/platypus" target="_blank">platypus</a>&nbsp;is an R package for object detection and semantic segmentation. Currently using&nbsp;</p>
<div>platypus&nbsp;you can perform:</div>
<ul>
<li>multi-class semantic segmentation using&nbsp;U-Net&nbsp;architecture</li>
<li>multi-class object detection using&nbsp;YOLOv3&nbsp;architecture</li>
</ul>
<p>You can install the latest version of&nbsp;platypus&nbsp;with&nbsp;remotes&nbsp;package:</p>
<div>
<div>
<div>
<div>remotes::install_github("maju116/platypus")</div>
</div>
</div>
</div>
<p>Note that in order to install&nbsp;platypus&nbsp;you need to install&nbsp;keras&nbsp;and&nbsp;tensorflow&nbsp;packages and&nbsp;Tensorflow&nbsp;version&nbsp;&gt;= 2.0.0&nbsp;(&nbsp;Tensorflow 1.x&nbsp;will not be supported!)</p><p>Address of the bookmark: <a href="https://github.com/maju116/platypus" rel="nofollow">https://github.com/maju116/platypus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</guid>
	<pubDate>Fri, 01 Apr 2022 19:05:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43848/r-shiny-in-life-sciences-%E2%80%93-top-7-dashboard-examples</link>
	<title><![CDATA[R Shiny in Life Sciences – Top 7 Dashboard Examples]]></title>
	<description><![CDATA[<p><span>&nbsp;R Shiny is one of the easiest ways for developers to make production-ready dashboards when speed and functionality are crucial. Shiny is approachable with a lot of documentation available, and because of this, a lot of developers/researchers with non-coding backgrounds are able to produce some impressive results. The whole ecosystem is easy to get your head around and pretty much limitless with regard to what you can do.</span></p><p>Address of the bookmark: <a href="https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/" rel="nofollow">https://www.r-bloggers.com/2022/03/r-shiny-in-life-sciences-top-7-dashboard-examples/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26569/genome-stability-laboratory</guid>
  <pubDate>Mon, 07 Mar 2016 04:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Genome Stability Laboratory]]></title>
  <description><![CDATA[
<p>The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims. </p>

<p>More at http://faculty.iisertvm.ac.in/~nishantkt/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</guid>
	<pubDate>Mon, 11 Jun 2018 05:43:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</link>
	<title><![CDATA[GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments]]></title>
	<description><![CDATA[GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap closure. We demonstrate with sequencing data from various organisms that the gap-closing accuracy of GMcloser is 3–100-fold higher than those of other available tools, with similar efficiency.

https://academic.oup.com/bioinformatics/article/31/23/3733/209212<p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/23/3733/209212" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/23/3733/209212</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27113/picard</guid>
	<pubDate>Fri, 29 Apr 2016 08:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27113/picard</link>
	<title><![CDATA[Picard]]></title>
	<description><![CDATA[<p>Picard is a set of command line tools for manipulating high-throughput sequencing (HTS) data and formats such as SAM/BAM/CRAM and VCF. These file formats are defined in the <a href="http://samtools.github.io/hts-specs/">Hts-specs</a> repository. See especially the <a href="http://samtools.github.io/hts-specs/SAMv1.pdf">SAM specification</a> and the <a href="http://samtools.github.io/hts-specs/VCFv4.3.pdf">VCF specification</a>.</p>
<p>Note that the information on this page is targeted at end-users. For developers, the source code, building instructions and implementation/development resources are available on <a href="https://github.com/broadinstitute/picard">GitHub</a>.</p>
<p>The Picard toolkit is open-source under the <a href="https://tldrlegal.com/license/mit-license">MIT license</a> and free for all uses.</p>
<p>Enjoy!</p><p>Address of the bookmark: <a href="http://broadinstitute.github.io/picard/" rel="nofollow">http://broadinstitute.github.io/picard/</a></p>]]></description>
	<dc:creator>Neel</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>

</channel>
</rss>