<?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/32399?offset=1370</link>
	<atom:link href="https://bioinformaticsonline.com/related/32399?offset=1370" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/10415/bioinformatician-stuck-in-wet-lab</guid>
	<pubDate>Tue, 06 May 2014 12:46:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10415/bioinformatician-stuck-in-wet-lab</link>
	<title><![CDATA[Bioinformatician stuck in wet-lab]]></title>
	<description><![CDATA[<p>This guide is aimed at pet bioinformaticians, and is meant to guide them towards better career development.</p>
<p><strong>1. Make friends with local bioinformatics groups</strong><br> <strong>2. Talk to your computing group</strong><br> <strong>3. Obtain clear expectations</strong><br> <strong>4. Rewrite your job description</strong><br> <strong>5. Papers</strong><br> <strong>6. Attend bioinformatics meetings</strong><br> <strong>7. Try first, ask later</strong></p><p>Address of the bookmark: <a href="http://biomickwatson.wordpress.com/2013/04/23/a-guide-for-the-lonely-bioinformatician/" rel="nofollow">http://biomickwatson.wordpress.com/2013/04/23/a-guide-for-the-lonely-bioinformatician/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</guid>
	<pubDate>Tue, 14 Aug 2018 18:11:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</link>
	<title><![CDATA[NCBI Magic-BLAST]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/10739/science-for-life-laboratory-scilifelab-sweden</guid>
  <pubDate>Sat, 10 May 2014 06:22:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Science for Life Laboratory (SciLifeLab)-Sweden]]></title>
  <description><![CDATA[
<p>Science for Life Laboratory (SciLifeLab) is a national center for molecular biosciences with focus on health and environmental research. The center combines frontline technical expertise with advanced knowledge of translational medicine and molecular bioscience. SciLifeLab is a national resource and a collaboration between four universities: Karolinska Institutet, KTH Royal Institute of Technology, Stockholm University and Uppsala University.</p>

<p>Webpage : https://www.scilifelab.se/about-us/<br />Opportunity: https://www.scilifelab.se/about-us/career/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11000/professorassociate-professor-assistant-professor-at-chettinad-academy-of-research-and-education</guid>
  <pubDate>Sat, 24 May 2014 00:00:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Professor/Associate Professor/ Assistant Professor at Chettinad Academy of Research and Education]]></title>
  <description><![CDATA[
<p>OPEN FACULTY POSITION</p>

<p>Chettinad Academy of Research and Education (CARE) invites applications from eligible and translational research-oriented candidates to the posts of Professor/Associate Professor/ Assistant Professor  Computational Biology, Bioinformatics, and Pharmaceutical Chemistry.</p>

<p>Emoluments: As per UGC norms (Adequate Compensation for Postdoctoral/Teaching experience)</p>

<p>Candidates fulfilling the eligibility criteria as per the UGC norms can send their full CV with copies of certificates and reference letters to the following address by post or by e-mail on or before 31st May 2014</p>

<p>The Registrar,<br />Chettinad Academy of Research and Education,<br />Chettinad Health City<br />Kelambakkam, Chennai 603 103<br />Tamil Nadu<br />T +91 (0)44 4741 1000<br />F +91 (0)44 4741 1011<br />Email: jobs @chettinadhealthcity.com</p>

<p>Advertisement: http://182.73.176.163/chc/ads2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Fri, 19 May 2017 07:44:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS is a tool able to merge two or more assemblies in order to improve contiguity and correctness. It can be used on all NGS-based assembly projects and it shows its full potential with multi-library Illumina-based projects. With more than 20 available assemblers it is hard to select the best tool. In this context we propose a tool that improves assemblies (and, as a by-product, perhaps even assemblers) by merging them and selecting the generating that is most likely to be correct.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/11107/the-minerva-research-group-for-bioinformatics</guid>
  <pubDate>Tue, 27 May 2014 15:48:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Minerva Research Group for Bioinformatics]]></title>
  <description><![CDATA[
<p>The focus of the bioinformatics group is to use computational approaches to gain an insight into genome evolution in primates.</p>

<p>http://www.eva.mpg.de/genetics/bioinformatics/overview.html?Fsize=0%2C%20%40%2F%27</p>

<p>Kelso Group<br />Department of Evolutionary Genetics<br />Max Planck Institute for Evolutionary Anthropology<br />Deutscher Platz 6<br />04103 Leipzig<br />Germany<br />Phone: +49 341 3550 500</p>

<p>Job: <br />http://www.eva.mpg.de/genetics/bioinformatics/jobs.html?Fsize=0%2C%2B%40</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33506/bedops-v2426-high-performance-genomic-feature-operations</guid>
	<pubDate>Mon, 12 Jun 2017 10:11:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33506/bedops-v2426-high-performance-genomic-feature-operations</link>
	<title><![CDATA[BEDOPS v2.4.26: high-performance genomic feature operations]]></title>
	<description><![CDATA[<p><strong>BEDOPS v2.4.26</strong> is a suite of tools to address common questions raised in genomic studies &mdash; mostly with regard to overlap and proximity relationships between data sets. It aims to be scalable and flexible, facilitating the efficient and accurate analysis and management of large-scale genomic data.</p>
<p>The <a href="https://bedops.readthedocs.io/en/latest/content/overview.html#overview">overview</a> section of the <strong>BEDOPS v2.4.26</strong> documentation summarizes the toolkit, functionality and performance enhancements. The <a href="https://bedops.readthedocs.io/en/latest/index.html#reference">reference</a> table offers documentation for all applications and scripts.</p><p>Address of the bookmark: <a href="https://github.com/bedops/bedops" rel="nofollow">https://github.com/bedops/bedops</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</guid>
	<pubDate>Fri, 06 Jun 2014 16:18:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</link>
	<title><![CDATA[Monitor running jobs on Linux server]]></title>
	<description><![CDATA[<p>You as a bioinformatican run lots of program on your servers. Sometime the shared server is also used by your colleague. If server is busy you sometime need to check the running programs and want to monitor the running programs as well. The "top" command will come in handy when you need to find out if things are still running, how long they&rsquo;ve been running, or how much memory is being used.<br /><br />&lsquo;top&rsquo; is very simple to run: type<br /><br />%% top<br /><br />You&rsquo;ll get a screen that looks like this, and is updated regularly:<br /><br /><img src="http://bioinformaticsonline.com/mod/photo/top.png" width="659" height="582" alt="image" style="border: 0px;"><br />Simple, right? Heh.<br /><br />First! Note that you can use &lsquo;q&rsquo; or &lsquo;CTRL-C&rsquo; to exit from &lsquo;top&rsquo;.<br /><br />Now let&rsquo;s read and understand at each line independently.<br /><br />The first line:<br /><br />top - 23:00:48 up 39 days,&nbsp; 2 user,&nbsp; load average: 0.00, 0.00, 0.00<br /><br />The first line tells you the current time, how long the machine has been up, how many users are logged in, and the short/medium/long-term compute load on the machine. If you run something for a long time, you&rsquo;ll see these numbers go up. Right now, the machine is basically just sitting there, so these are all close to 0.<br /><br />The second line:</p><p>Tasks:&nbsp; 239 total,&nbsp;&nbsp; 1 running,&nbsp; 238 sleeping,&nbsp;&nbsp; 0 stopped,&nbsp;&nbsp; 0 zombie<br /><br />This line tells you how many processes are running. If you are using laptops machines it&rsquo;s not so interesting because you really are the only one using this machine.<br /><br />Cpu(s):&nbsp; 0.0%us,&nbsp; 0.0%sy,&nbsp; 0.0%ni,100.0%id,&nbsp; 0.0%wa,&nbsp; 0.0%hi,&nbsp; 0.0%si,&nbsp; 0.0%st<br /><br />This line contains the CPU load. The first two numbers are how busy the system is doing computation (&ldquo;us&rdquo; stands for &ldquo;user&rdquo;) and how busy the system is doing system-y things like accessing disks or network (&ldquo;sy&rdquo; stands for &ldquo;system&rdquo;). We&rsquo;ll talk more about this later.<br /><br />Mem:&nbsp;&nbsp; 49457320k total,&nbsp;&nbsp;&nbsp; 3492174k used,&nbsp; 14535596k free,&nbsp;&nbsp;&nbsp; 1435148k buffers<br /><br />This should be easy to understand &ndash; how much memory you&rsquo;re using! <br /><br />Swap:&nbsp;&nbsp; 539356k total,&nbsp;&nbsp; 28332k used,&nbsp;&nbsp; 836562k free,&nbsp;&nbsp;&nbsp; 29862014k cached<br /><br />Swap is just on-disk memory that can be used to &ldquo;swap&rdquo; out programs from main memory. Again, we&rsquo;ll talk about this later.:<br /><br />PID USER&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PR&nbsp; NI&nbsp; VIRT&nbsp; RES&nbsp; SHR S %CPU %MEM&nbsp;&nbsp;&nbsp; TIME+&nbsp; COMMAND<br />&nbsp; 1 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 39 &nbsp; 19&nbsp; 0&nbsp; 0&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 246:57.22 kipmi0<br />&nbsp; 2 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; RT&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 0:00.00 migration/0<br /><br />And... finally! What&rsquo;s actually running! The two most important numbers are the %CPU and %MEM towards the right, as well as the COMMAND. This tells you how compute- and memory-intensive your program is. Right now, nothing&rsquo;s running so the numbers aren&rsquo;t very interesting, but just wait until we run something...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>