<?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/29635?offset=350</link>
	<atom:link href="https://bioinformaticsonline.com/related/29635?offset=350" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</guid>
	<pubDate>Fri, 25 Apr 2014 19:31:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</link>
	<title><![CDATA[“On” and “Off” the neuron !!!]]></title>
	<description><![CDATA[<p><span>Optogenetics is a recent innovation in neuroscience that gives researchers the ability to control the activity of neurons with light. With this powerful tool, researchers are teasing apart the biological basis of memory, behavior, and disease (see &ldquo;<a href="http://www.technologyreview.com/news/517226/scientists-make-mice-remember-things-that-didnt-happen/"><span>Scientists Make Mice &lsquo;Remember&rsquo; Things That Didn&rsquo;t Happen</span></a>&rdquo; and &ldquo;<a href="http://www.technologyreview.com/news/423254/an-on-off-switch-for-anxiety/"><span>An On-Off Switch for Anxiety</span></a>,&rdquo;). But for the first several years of this technology&rsquo;s existence, the proteins that scientists added to neurons to make them react to light were only good at activating neurons. That limited researchers&rsquo; ability to understand neuronal circuits, sets of interconnected neurons that are thought to control behavior and, when misfiring, to underlie many brain conditions. Problems can arise from any imbalance in circuit activity, whether too much or too little.&nbsp;</span></p><p><span>Now, two research groups have engineered new optogenetic proteins that can be used to efficiently silence neurons.&nbsp;<span><span>One of the two new proteins comes from the lab of<span>&nbsp;</span><a href="http://www.stanford.edu/group/dlab/about_pi.html" target="_blank">Karl Deisseroth</a>, a psychiatrist and neuroscientist at Stanford University who helped develop optogenetics as a research tool.&nbsp;His group&rsquo;s new &ldquo;off&rdquo; switch for neurons was created by changing 10 of the 333 amino acids in an existing optogenetic protein, which itself had been engineered by combining natural proteins from<span>&nbsp;</span></span></span><a href="http://genome.jgi-psf.org/Chlre3/Chlre3.home.html" target="_blank"><span>green algae</span></a><span><span>. That advance&nbsp;</span><span>&ldquo;creates a powerful tool that allows neuroscientists to apply a brake in any specific circuit with millisecond precision,&rdquo; said Thomas&nbsp;Insel, director of the National Institute of Mental Health, in a released statement.&nbsp;</span><a href="http://www.sciencemag.org/content/344/6182/409" target="_blank"><span>The other new silencing protein</span></a>, developed by scientists at the H</span><span>umboldt University of Berlin and collaborators, was created by changing amino acids in the same existing optogenetic protein.&nbsp;</span></span></p><p><span><span>Some researchers are also looking to optogenetics as a potential treatment for patients with a variety of conditions (see &ldquo;</span></span><span><a href="http://www.technologyreview.com/news/524771/for-mice-and-maybe-men-pain-is-gone-in-a-flash/"><span>For Mice, and Maybe Men, Pain Is Gone in a Flash</span></a><span><span>,&rdquo; and &ldquo;</span></span><a href="http://www.technologyreview.com/news/506981/flipping-on-the-lights-to-halt-seizures/"><span>Flipping on the Lights to Halt Seizures</span></a><span><span>&rdquo;) but there are huge challenges to overcome. The method requires genetic modification of cells to make them light-sensitive. It also requires implanted light sources for all but the shallowest of nerve endings. <br /></span></span></span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33592/circular-plots-in-r</guid>
	<pubDate>Mon, 19 Jun 2017 06:20:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33592/circular-plots-in-r</link>
	<title><![CDATA[Circular plots in R]]></title>
	<description><![CDATA[<div>
<p><strong>Circular plots</strong>&nbsp;are useful to represent complicated informations. They are used in 2 specific cases: when you have long axis and numerous categories, and when you want to show relationships between elements. The&nbsp;<a href="http://circos.ca/images/samples/" target="_blank">circos gallery</a>&nbsp;displays several examples of circular plots, what gives a nice overview of the possibilities. Circos is the most famous</p>
</div>
<div>
<p>tool to create circular plots. Thanks to&nbsp;<a href="https://www.linkedin.com/in/zuguanggu" target="_blank">Zuguang Gu</a>, the&nbsp;<a href="https://cran.r-project.org/web/packages/circlize/vignettes/circlize.pdf" target="_blank">Circlize library</a>&nbsp;makes the circos functions available in R! It implements low-level graphic functions for adding common graphics in a circular layout. This page aims to learn you how to use the library, so I strongly advise to read the graphics in the proposed order!</p>
<p><img src="http://www.r-graph-gallery.com/wp-content/uploads/2016/03/122_Circlize_package.png" width="480" height="480" alt="image" style="border: 0px;"></p>
</div>
<p>http://www.r-graph-gallery.com/portfolio/circular-plot/</p><p>Address of the bookmark: <a href="http://www.r-graph-gallery.com/portfolio/circular-plot/" rel="nofollow">http://www.r-graph-gallery.com/portfolio/circular-plot/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</guid>
	<pubDate>Tue, 06 May 2014 01:10:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</link>
	<title><![CDATA[Check Linux server configuration !!]]></title>
	<description><![CDATA[<p>Bioinformatician uses servers for computational analysis. Sometime we need to check the server details before running our programs or tools. Here I am showing some basic commands using them you can gather the system/server information.<br /><br />To check what version of Operating System is installed on the server you can use the following commands:-<br />&nbsp;=================================================================<br />1.cat /etc/issue<br />[root@localhost ~]# cat /etc/issue<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Kernel \r on an \m<br /><br />2.cat /etc/redhat-release<br />[root@localhost ~]# cat /etc/redhat-release<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br /><br /><br />3.lsb_release -a<br />[root@localhost ~]# lsb_release -a<br />LSB Version:&nbsp;&nbsp;&nbsp; :core-3.1-ia32:core-3.1-noarch:graphics-3.1-ia32:graphics-3.1-noarch<br />Distributor ID: RedHatEnterpriseServer<br />Description:&nbsp;&nbsp;&nbsp; Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Release:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5.5<br />Codename:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Tikanga<br /><br /><br /><br />To check whether the operating system is 32 or 64bit:-<br />================================<br /># uname -i<br />[root@localhost ~]# uname -i<br />i386<br />(i386 represents that server is having 32bit operating system)<br /><br />[root@localhost ~]# uname -i<br />x86_64<br />(x86_64 represents that server is having 64bit operating system)<br /><br />To see the processor/CPU information:-<br />=============================<br /># cat /proc/cpuinfo<br />[root@localhost ~] cat /proc/cpuinfo<br />processor&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />vendor_id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : GenuineIntel<br />cpu family&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />model&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 15<br />model name&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : Intel(R) Xeon(R) CPU&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5130&nbsp; @ 2.00GHz<br />stepping&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />cpu MHz&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 1995.087<br />cache size&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 4096 KB<br />physical id&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />siblings&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />core id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />cpu cores&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />apicid&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />fdiv_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />hlt_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />f00f_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />coma_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />fpu&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />fpu_exception&nbsp;&nbsp; : yes<br />cpuid level&nbsp;&nbsp;&nbsp;&nbsp; : 10<br />wp&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />flags&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe nx lm constant_tsc pni monitor ds_cpl vmx tm2 ssse3 cx16 xtpr lahf_lm<br />bogomips&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 3990.17<br />(Here processor number 0 indicates that the system is having one process(processor number starts with zero))<br /><br /><br /><br /><br />To check memory information:-<br />===========================<br /># free -m<br />[root@localhost ~]# free -m<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; total&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; used&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; free&nbsp;&nbsp;&nbsp;&nbsp; shared&nbsp;&nbsp;&nbsp; buffers&nbsp;&nbsp;&nbsp;&nbsp; cached<br />Mem:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5066&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3513&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1552&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 612&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2319<br />-/+ buffers/cache:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 582&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4484<br />Swap:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983<br /><br /><br /><br /># cat /proc/meminfo<br />[root@localhost ~]# cat /proc/meminfo<br />MemTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5187752 kB<br />MemFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1639300 kB<br />Buffers:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 627024 kB<br />Cached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2374944 kB<br />SwapCached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Active:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2458788 kB<br />Inactive:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 920964 kB<br />HighTotal:&nbsp;&nbsp;&nbsp;&nbsp; 4325164 kB<br />HighFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1561936 kB<br />LowTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 862588 kB<br />LowFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 77364 kB<br />SwapTotal:&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />SwapFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />Dirty:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 704 kB<br />Writeback:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />AnonPages:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 377892 kB<br />Mapped:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 35328 kB<br />Slab:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 153036 kB<br />PageTables:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 6316 kB<br />NFS_Unstable:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Bounce:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />CommitLimit:&nbsp;&nbsp; 4625484 kB<br />Committed_AS:&nbsp;&nbsp; 977132 kB<br />VmallocTotal:&nbsp;&nbsp; 116728 kB<br />VmallocUsed:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4492 kB<br />VmallocChunk:&nbsp;&nbsp; 112124 kB<br />HugePages_Total:&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Free:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Rsvd:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />Hugepagesize:&nbsp;&nbsp;&nbsp;&nbsp; 2048 kB<br /><br /><br />To check the model and serial name of the server:-<br />=======================================<br />[root@localhost ~]#&nbsp; dmidecode | egrep -i "product name|Serial number"<br />Product Name: PowerEdge R710<br />Serial Number: AB8CDE1<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br /><br />To check the host name:-<br />=====================<br />[root@localhost ~]# uname -n<br />localhost<br /><br />[root@localhost ~]# hostname<br />localhost<br /><br />To check the kernel version:-<br />========================<br />[root@localhost ~]# uname -r<br />2.6.18-238.9.1.el5PAE</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</guid>
	<pubDate>Thu, 23 Nov 2017 10:24:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34400/ioniser-tools-for-the-quality-assessment-of-data-produced-by-oxford-nanopore%E2%80%99s-minion-sequencer</link>
	<title><![CDATA[IONiseR:  tools for the quality assessment of data produced by Oxford Nanopore’s MinION sequencer]]></title>
	<description><![CDATA[<p>This package is intended to provide tools for the quality assessment of data produced by Oxford Nanopore&rsquo;s MinION sequencer. It includes a functions to generate a number plots for examining the statistics that we think will be useful for this task.</p>
<p>However, nanopore sequencing is an emerging and rapidly developing technology. It is not clear what will be most informative. We hope that&nbsp;<code>IONiseR</code>&nbsp;will provide a framework for visualisation of metrics that we haven&rsquo;t thought of, and welcome feedback at&nbsp;<a href="mailto:mike.smith@embl.de" target="_blank">mike.smith@embl.de</a>.</p>
<p>If you&rsquo;re not interested in the quality assement of the raw or event level data, and want to jump straight to the getting FASTQ format files from fast5 files you can go straight to the final section of this document.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/IONiseR/inst/doc/IONiseR.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10460/assistant-professor-at-jawaharlal-nehru-university-in-delhi</guid>
  <pubDate>Wed, 07 May 2014 00:29:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at Jawaharlal Nehru University in Delhi]]></title>
  <description><![CDATA[
<p>Advt. No. RC/48/2014</p>

<p>SCHOOL OF COMPUTATIONAL AND INTEGRATIVE SCIENCES (SC&amp;IS)</p>

<p>ESSENTIAL QUALIFICATION : - M.Sc./M.Tech. in Physics/ Chemistry/ Biology/ Mathematics/ Statistics/ Bioinformatics/ Computational Biology. Ph.D. in the broad areas of Bioinformatics/ Computational Biology. Candidates must have demonstrated capabilities in terms of high impact research publications in either of the above mentioned areas.</p>

<p>Scale of Pay : - 15600-39100/- (PB-III) AGP Rs. 6000/-</p>

<p>For more details on Centre/School, Specializations etc. please visit JNU website www.jnu.ac.in or contact Section Officer, Room Nos. 131-132, Recruitment Cell, Administrative Block, JNU, New Delhi – 110067, Email: recruitmentjnu2013@gmail.com The last date for the receipt of application is 15 May, 2014.</p>

<p>http://www.jnu.ac.in/Career/</p>

<p>http://www.jnu.ac.in/Career/ADVTNo_RC_48_2014.pdf<br />Last Apply Date:</p>

<p>15 May 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10749/memories-can-be-passed-down-through-dna</guid>
	<pubDate>Sat, 10 May 2014 21:24:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10749/memories-can-be-passed-down-through-dna</link>
	<title><![CDATA[Memories Can Be Passed Down Through DNA]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/tbPwzII_g6o" frameborder="0" allowfullscreen></iframe>The premise of Assassin's Creed is the reliving of other people's memories stored inside DNA. Well scientists have found that in mice, it actually happens! Anthony is joined by special guest and our friend Tara Long from Hard Science to explain how this process works, and if it might apply to humans as well.

Read More: 
Parental olfactory experience influences behavior and neural structure in subsequent generations
http://www.nature.com/neuro/journal/vaop/ncurrent/abs/nn.3594.html
"Using olfactory molecular specificity, we examined the inheritance of parental traumatic exposure, a phenomenon that has been frequently observed, but not understood."

What Is Epigenetics?
http://www.sciencemag.org/content/330/6004/611
"The cells in a multicellular organism have nominally identical DNA sequences (and therefore the same genetic instruction sets), yet maintain different terminal phenotypes. This nongenetic cellular memory, which records developmental and environmental cues (and alternative cell states in unicellular organisms), is the basis of epi-(above)-genetics."

Epigenetics
http://en.wikipedia.org/wiki/Epigenetics

Watch More:
How to Change Your Genes
https://www.youtube.com/watch?v=B5DU9lgbsSE
TestTube Wild Card
http://testtube.com/dnews/dnews-231-how-too-many-screens-affect-our-brain?utm_source=YT&utm_medium=DNews&utm_campaign=DNWC
Is Sexiness Hereditary?
https://www.youtube.com/watch?v=z6STRCncvM8
____________________

DNews is dedicated to satisfying your curiosity and to bringing you mind-bending stories & perspectives you won't find anywhere else! New videos twice daily. 

Watch More DNews on TestTube http://testtube.com/dnews

Subscribe now! http://www.youtube.com/subscription_center?add_user=dnewschannel

DNews on Twitter http://twitter.com/dnews

Anthony Carboni on Twitter http://twitter.com/acarboni

Laci Green on Twitter http://twitter.com/gogreen18

Trace Dominguez on Twitter http://twitter.com/trace501

DNews on Facebook http://facebook.com/dnews

DNews on Google+ http://gplus.to/dnews

Discovery News http://discoverynews.com]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</guid>
	<pubDate>Sat, 25 Aug 2018 04:46:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</link>
	<title><![CDATA[Julia Programming Language, a Python and R rival]]></title>
	<description><![CDATA[<p>Big data has grown to become one of the most lucrative fields. In fact, data scientists are some of the most sought people. They are usually hired to analyze, control and parse large chunks of data. Implementing these actions using traditional techniques is not a walk in the park. This is why most data scientists prefer using programming languages such as R and Python. However, there is one more programming language that can do the job. That is Julia programming language.</p><p>What Is Julia Language?</p><p>Julia is a programming language that came into the limelight in 2012. It is a general-purpose programming language that was designed for solving scientific computations. Julia was meant to be an alternative to Python, R and other programming languages that were mainly used for manipulating data. This is because it has numerous features that can minimize the complexities of numerical computations.&nbsp;</p><p>Julia optimizes on the best features of Python and R while at the same time overlooks their weaknesses. This explains why it is viewed as an alternative to these programming languages. For instance, it utilizes the readability and simplicity of Python then performs faster.</p><p>Julia is the most preferred programming language for data scientists and mathematicians. This is because its core features are similar to the ones that are used on most data software. Also, the language is ideal for these two subjects because its syntax is similar to the standard mathematical formulas.</p><p>Key Features Of Julia Language<br />Uses JIT Compilation<br />Parallelism<br />Dynamic Typing<br />Simple Syntax<br />Allows Metaprogramming<br />Accessible to Libraries<br />-1-Array Indexing</p><p>Julia Vs Python And R Programming Languages<br />1. Speed<br />Julia is faster than both Python and R. This is a very critical aspect that is given special attention in the big data programming. The high speed of Julia is because of JIT compilers. You will need to install external libraries on Python to achieve similar speed.</p><p>2. Syntax<br />Julia has a math-friendly syntax. The syntax of this programming language is similar to the mathematical formulas hence can be used to perform mathematical and scientific computations. This syntax makes it easier to learn than Python.</p><p>3. Parallelism<br />Although both Python and R use parallelism, Julia uses a top-level parallelism. Julia allows the processor to perform to the optimum level than what Python and R can achieve.</p><p>4. Versatility<br />Julia programming language is more versatile than Python and R. It allows a programmer to move from different codes and functions with ease.</p><p>The only area that Python and R are superior to Julia is in terms of community. Given that Julia is a new programming language, it has a small community as compared to others which have been around for years.</p><p>In overall Julia programming language is a better alternative that you can use to handle Big data projects. Despite having a small community, it is one of those programming languages that you can easily learn.</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10773/bioinformatics-jrfsrf-position-at-national-research-centre-on-plant-biotechnology</guid>
  <pubDate>Sun, 11 May 2014 22:29:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY]]></title>
  <description><![CDATA[
<p>NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY<br />LBS, CENTRE, PUSA CAMPUS, IARI NEW DELHI<br />NEW DELHI – 110 012</p>

<p>WALK- IN –INTERVIEWS</p>

<p>Eligible candidates may appear in Walk-in-Interview on May 23, 2014 at 10 AM for the posts of Research Associates &amp; Senior Research Fellows (SRF) in the following DST/DBT/ICAR funded projects.</p>

<p>1 NPTC Project on Bioinformatics and Comparative Genomics</p>

<p>Research Associate (One)</p>

<p>Rs. 24000/- + 30% HRA for masters degree holder with more than 4 years experience</p>

<p>Essential: Ph D in Plant Molecular Biology &amp; Biotechnology/Genetics 0r Candidates who have already submitted their Ph D thesis in above subjects</p>

<p>Desirable: Research experience in Genomics, Molecular biology, Microarrays analysis, Gene cloning, transgenic Techniques , and computational analysis.</p>

<p>Senior Research Fellow ( UGCCSIR/ DBT/ ICAR Net qualified only): (One)</p>

<p>Rs. 16000/- + 30% HRA and Rs. 18000+30 HRA from 3rd year onwards</p>

<p>Essential:</p>

<p>1. ICAR/ UGCCSIR/DBT Net qualified only</p>

<p>2. M. Sc. (with thesis) in Biotechnology, Life Sciences, Biosciences/ Bioinformatics, Genetics/ Plant Pathology with experience in molecular biology.</p>

<p>Or M.Sc with more than 3 years research experiences</p>

<p>3. B.Sc. Agriculture or Biology</p>

<p>Desirable:<br />1. M. Sc. with thesis<br />2. Experience in molecular biology, plant tissue culture<br />3. Bioinformatics knowledge is important</p>

<p>2 DST JC Bose National Fellowship</p>

<p>Research Associate (Bioinformatics) : One</p>

<p>Rs.22000/- + 30% HRA for 1 &amp; 2nd Yr., Rs. 23000+ 30% HRA for 3rd year and Rs. 24000+30% HRA for 4th &amp;5th yr</p>

<p>Essential: M Ph D in Plant Molecular Biology &amp; Biotechnology/Genetics</p>

<p>Desirable: Research experience in Genomics, Molecular biology, Microarrays analysis, Gene cloning, transgenic Techniques , and computational analysis.</p>

<p>Age limit: Max.35 years (Age relaxation of 5 years for SC/ST &amp; women and 3 years for OBC)</p>

<p>The posts are purely temporary in nature and are co-terminus with the project. Initially the offer will be made for one year only and may be further extendable based on performance of the candidate. The interview will be held on May 23 , 2014 at 10:00 AM at NRCPB, LBS Building, Pusa Campus, IARI, New Delhi- 110012. The candidates must bring four copies of biodata (in the prescribed proforma), original certificates, attested photocopies of each of the certificates and an attested copy of recent passport size photograph. No. TA/DA would be given for the appearance in interview. Only the candidates having essential qualification would be entertained for the interviews. Short-listing of candidates based on academic merit and experience will be done in case of large number of applicants.</p>

<p>Advertisement: http://www.nrcpb.org/sites/default/files/Advertisement%20for%20RA%20and%20SRF%20Position.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</guid>
	<pubDate>Sun, 09 Dec 2018 19:06:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38385/decipher-a-software-toolset-for-deciphering-and-managing-biological-sequences-efficiently-using-the-r</link>
	<title><![CDATA[DECIPHER; a software toolset for deciphering and managing biological sequences efficiently using the R]]></title>
	<description><![CDATA[<p><span>DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;programming language. The&nbsp;</span><a href="http://www.r-project.org/">R</a><span>&nbsp;package is distributed as platform independent source code under the&nbsp;</span><a href="http://www.gnu.org/copyleft/gpl.html">GPL version 3 license</a><span>. Some functionality of the program is accessible online through web tools.</span></p>
<p><span style="font-size: medium; text-align: justify;">&nbsp;</span></p><p>Address of the bookmark: <a href="http://www2.decipher.codes/" rel="nofollow">http://www2.decipher.codes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>