<?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: All site news]]></title>
	<link>https://bioinformaticsonline.com/news/all?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/news/all?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28563/find-predicted-crispr-sites-using-ensembl</guid>
	<pubDate>Wed, 27 Jul 2016 03:15:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28563/find-predicted-crispr-sites-using-ensembl</link>
	<title><![CDATA[Find predicted CRISPR sites using Ensembl]]></title>
	<description><![CDATA[<p>Did you know that you can now use Ensembl to help design your CRISPR experiments? Just turn on the brand new track that shows you the CRISPR sites that have been predicted by the WGE group (<a href="http://www.sanger.ac.uk/science/tools/wge" target="_blank">http://www.sanger.ac.uk/science/tools/wge</a>)</p><p><img src="http://www.ensembl.info/wp-content/uploads/2016/07/Screen-Shot-2016-07-22-at-13.04.33.png" width="1400" height="544" alt="image" style="border: 0px;"></p><p>Find out more on our blog:<br /><a href="http://www.ensembl.info/blog/2016/07/26/find-predicted-crispr-sites-using-ensembl/" target="_blank">http://www.ensembl.info/&hellip;/find-predicted-crispr-sites-usin&hellip;/</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</guid>
	<pubDate>Tue, 19 Jul 2016 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</link>
	<title><![CDATA[Aravind J Shankar gets all India rank 1 in BINC, 2016]]></title>
	<description><![CDATA[<p>Aravind J Shankar, a bioinformatics graduate of SASTRA University, has secured the all India rank 1 in the Bioinformatics National Certification (BINC) 2016, organised by the Department of Biotechnology, Government of India.</p><p>The BINC is a nationwide examination aimed at certifying professionals in bioinformatics and tests their theoretical and practical knowledge across three phases of examination. He is entitled to receive a DBT research fellowship leading to a Ph.D. from any premier research institute in India.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28199/genome-workbench-2107</guid>
	<pubDate>Fri, 01 Jul 2016 12:09:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28199/genome-workbench-2107</link>
	<title><![CDATA[Genome Workbench 2.10.7]]></title>
	<description><![CDATA[<p>Genome Workbench 2.10.7 is here! New features include added support for local custom BLAST databases and improvements to Tree View.</p><p>For the full list of features, improvements and fixes, see the release notes:<a href="https://ncbi.nlm.nih.gov/tools/gbench/releasenotes" target="_blank">https://ncbi.nlm.nih.gov/tools/gbench/releasenotes</a></p><p>New Features</p><ul>
<li>BLAST Tool: added support for local custom BLAST databases</li>
<li>Graphical Sequence View: added log scaling option for graph tracks</li>
<li>Generic Table View:&nbsp;<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial17">new tutorial</a>&nbsp;added</li>
</ul><p>Bug Fixes and Improvements</p><ul>
<li>Project Tree View: Genomic Collections/Assemblies now show accessions, not just names</li>
<li>Tree View: layout updated to better accommodate nodes of different sizes</li>
<li>Table Import Dialog (MacOS): fixed issue with table visibility</li>
<li>Fixed bug where different molecules IDs in GenBank could resolve to the same sequence</li>
<li>Graphical Sequence View: fixed issue where sequence track was not shown for some sequences</li>
<li>Graphical Sequence View: fixed protein coloration methods</li>
<li>Graphical Sequence View: improved rendering of Markers to better indicate boundaries and produce higher quality PDF images</li>
<li>Create Gene Model tool: fixed scenario when gene model tool failed with local sequences</li>
<li>Search View: ORF Finder &ndash; fixed incorrect protein lengths</li>
<li>Fixed bug with not opening project file (.gbp) on a click</li>
<li>Fixed issues in GVF import</li>
<li>Fixed BLAST Search tool against NCBI databases not working</li>
<li>Fixed tblastn (protein BLAST) not working in standalone mode</li>
<li>Fixed GTF export failure</li>
</ul>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</guid>
	<pubDate>Tue, 17 May 2016 03:31:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27348/ngago-challenge-crispr</link>
	<title><![CDATA[NgAgo challenge CRISPR !!]]></title>
	<description><![CDATA[<p><a href="http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html" target="_blank" title="A recent Nature Biotechnology paper"><strong>A recent Nature Biotechnology paper</strong></a>&nbsp;from Chunyu Han&rsquo;s lab,&nbsp;DNA-guided genome editing using the&nbsp;<em>Natronobacterium gregoryi&nbsp;</em>Argonaute,&nbsp;is a must-read for genome editing folks who want to learn about NgAgo. Their team sums up NgAgo&rsquo;s potential pluses this way (<strong>emphasis</strong>&nbsp;mine):</p><blockquote><p>&ldquo;The useful features of NgAgo for genome editing include the following.<strong>First, it has a low tolerance to guide&ndash;target mismatch</strong>. A single nucleotide mismatch at each position of the gDNA impaired the cleavage efficiency of NgAgo, and mismatches at three positions completely blocked cleavage in our experiments.&nbsp;<strong>Second, 5&prime; phosphorylated short ssDNAs are rare in mammalian cells, which minimizes the possibility of cellular oligonucleotides misguiding NgAgo</strong>.<strong>Third, NgAgo follows a &lsquo;one-guide-faithful&rsquo; rule,</strong>&nbsp;that is, a guide can only be loaded when NgAgo protein is in the process of expression, and, once loaded, NgAgo cannot swap its gDNA with other free ssDNA at 37 &deg;C. All of these features could minimize off-target effects.&nbsp;<strong>Finally, it is easy to design and synthesize ssDNAs and to adjust their concentration</strong>, which is difficult with the Cas9-sgRNA system, if the sgRNA is expressed from a plasmid and the normal dosage of an ssDNA guide is only ~1/10 of that of a sgRNA expression plasmid.</p></blockquote><p>NgAgo might be a more orderly way and perhaps even simpler way to go about genome editing than CRISPR, but the jury is still out on that until there are more papers and data. The NgAgo edit efficiency at this preliminary stage of technology development seems very strong. See the pics below</p><p><img src="http://i1.wp.com/www.ipscell.com/wp-content/uploads/2016/05/NgAgo1.jpg" alt="image" width="1311" height="559" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>Reference:&nbsp;http://www.nature.com/nbt/journal/vaop/ncurrent/full/nbt.3547.html</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27344/orffinder-with-smart-blast</guid>
	<pubDate>Tue, 17 May 2016 01:43:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27344/orffinder-with-smart-blast</link>
	<title><![CDATA[ORFfinder with smart BLAST]]></title>
	<description><![CDATA[<p><span>ORF Finder</span></p><p><span><a href="http://www.ncbi.nlm.nih.gov/orffinder">ORFfinder</a><span>&nbsp;is a graphical analysis tool for finding open reading frames (ORFs). We&rsquo;ve been working on a few updates, and we&rsquo;d like to find out what you think about them. Read on to find out what you can do with the new ORFfinder.</span></span></p><p>Smart BLAST (https://ncbiinsights.ncbi.nlm.nih.gov/2015/07/29/smartblast/)</p><p>Select one or a group of ORFs and BLAST several databases at once, and use the newly developed&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/smartblast/">SmartBLAST</a>&nbsp;to verify protein names.&nbsp;Looking for the traditional results from&nbsp;<a href="http://blast.ncbi.nlm.nih.gov/Blast.cgi">BLAST</a>? They&rsquo;re there too.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27311/release-notes-for-genome-workbench-2105</guid>
	<pubDate>Thu, 12 May 2016 13:49:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27311/release-notes-for-genome-workbench-2105</link>
	<title><![CDATA[Release Notes for Genome Workbench 2.10.5]]></title>
	<description><![CDATA[<p>New Features in latest release</p><ul>
<li>New ProSplign tool integrated with Genome Workbench (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial13">Tutorial</a>,&nbsp;<a href="https://www.youtube.com/watch?v=V9UqKJprzAg&amp;feature=youtu.be" target="_blank">Video</a>)</li>
<li>New export function for BAM/cSRA coverage graphs (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial14">Tutorial</a>)</li>
<li>New export function for alignments GFF3 format ((<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial15">Tutorial</a>))</li>
<li>Tree View: implemented new export mode based on selections (tutorial coming)</li>
<li>Tree View: added support for&nbsp;<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3/#distance_based_circular_trees">distance based circular trees</a></li>
<li>Tree View: new rooting mode (Midpoint Root) results in more balanced trees (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3#reroot_tree">Tutorial</a>)</li>
<li>Tree View: added possibility to right-click on an edge between two nodes and "Place Root at Middle of Branch" &ndash; to re-root at mid-branch (<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial3#reroot_tree">Tutorial</a>)</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27277/binc-2016</guid>
	<pubDate>Wed, 11 May 2016 07:15:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27277/binc-2016</link>
	<title><![CDATA[BINC 2016]]></title>
	<description><![CDATA[<p>Bioinformatics National Certification (BINC) Examination 2016</p><p>Department of Biotechnology, Government of India, New Delhi &amp; Pondicherry University, Puducherry</p><p>Starting of online submission of application : April 13, 2016</p><p>Last date for submission of application : May 13, 2016</p><p>Examination consists of two parts:</p><p>Part - I (Paper - I) : June 12, 2016 (10 AM -12 PM)<br />Part - II (Paper &bull; II &amp; III) : June 26, 2016 (9 AM &bull; 12 PM &amp; 2 PM &bull; 4 PM)</p><p>Objective: Pondicherry University, on behalf of the Department of Biotechnology (DBT),<br />Government of India, will conduct the Bioinformatics National Certification (BING) examination. The objective of this examination is to identify Bioinformatics professionals<br />for further studies as well as to help potential employers in recruitment of candidates having exceptionally good Bioinformatics skills.</p><p>Eligibility : Bachelor degree in Life Sciences, Physical Sciences, Chemical Sciences, Mathematical Sciences, Agriculture, Veterinary, Medicine, Pharmacy, Engineering and Technology are eligible to appear for the examination. They need not have any formal training, diploma or certificate in Bioinformatics.</p><p>Application and syllabus : The online application can be filled from April 13, 2016 to May 13, 2016.</p><p>Syllabus for the examination is available online.</p><p>It consists of five sections:<br />Bioinformatics, Biology, Physical and Chemical Sciences, Mathematics &amp; Statistics and Computer Science &amp; Information Technology.</p><p>Examination : The examination fee is Rs. 600/- for general candidates, Rs. 400/- for women/OBC candidates and Rs. 200 for SC/ST candidates, and no fee for physically challenged candidates.</p><p>The online Part - I (Paper - I) examination is scheduled on June 12,2016 and Part- II (Paper - II and Paper- III) on June 26, 2016. The Paper- I will be of objective type and candidates scoring a minimum of 40% marks in Paper - I will be called to appear in Part II examination.</p><p>Part II examination consists of two papers : The Paper - II will be of short answer type questions of three hours duration while the Paper- III will be a practical examination of two hours duration to test analytical ability and programming skill of candidates.</p><p>Research Fellowships for all the successful candidates those who are interested and qualified in pursuing Ph.D. in India will be awarded. In addition, cash prizes will be awarded to the top 10 successful candidates.</p><p>The details of examination centres, other details and submission of application, please<br />visit:&nbsp;<a href="http://www.pondiuni.edu.in/exams/binc/">http://www.pondiuni.edu.in/exams/binc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27235/supposedly-educational-r</guid>
	<pubDate>Tue, 03 May 2016 16:43:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27235/supposedly-educational-r</link>
	<title><![CDATA[Supposedly Educational R]]></title>
	<description><![CDATA[<p>R 3.3.0 (codename &ldquo;Supposedly Educational&rdquo;)&nbsp;was <a href="http://r.789695.n4.nabble.com/R-3-3-0-is-released-td4720368.html" target="_blank">released today</a>.&nbsp;You can get the latest binaries version <strong><a href="http://cran.rstudio.com/" target="_blank">from here</a>.</strong>&nbsp;(or the .tar.gz&nbsp;<strong>source</strong> code from <a href="http://cran.r-project.org/src/base/R-3/R-3.3.0.tar.gz" target="_blank">here</a>).&nbsp;The full list of new features and bug fixes is provided below.</p><p>If you are using <strong>Windows&nbsp;</strong>you can easily upgrade to the latest version of R using <a href="http://cran.r-project.org/web/packages/installr/" target="_blank">the installr package</a>. Simply run the following code in Rgui:</p><div><table width="710">
<tbody>
<tr id="p613882">
<td id="p61388code2">
<pre><span style="color: #0000ff; font-weight: bold;">install.<span>packages</span></span><span style="color: #080;">(</span><span style="color: #ff0000;">"installr"</span><span style="color: #080;">)</span> <span style="color: #228b22;"># install </span>
setInternet2<span style="color: #080;">(</span>TRUE<span style="color: #080;">)</span>
installr<span style="color: #080;">::</span><span>updateR</span><span style="color: #080;">(</span><span style="color: #080;">)</span> <span style="color: #228b22;"># updating R.</span></pre>
</td>
</tr>
</tbody>
</table></div><p><span>Running &ldquo;updateR()&rdquo; will detect if there is a new R version available, and if so it will download+install it (etc.). There is also <a href="http://www.r-statistics.com/2015/06/a-step-by-step-screenshots-tutorial-for-upgrading-r-on-windows/" target="_blank">a&nbsp;step by step tutorial (with screenshots) on how to upgrade R on Windows, using the <em>installr</em></a>&nbsp;package. If you only see the option to upgrade to an older version of R, then change your mirror or try again in a few hours (it usually take around 24 hours for all CRAN mirrors to get the latest version of R).</span></p><p><em>I try to keep the <a href="https://github.com/talgalili/installr" target="_blank">installr</a> package updated and useful, so if you have any suggestions or remarks on the package &ndash; you are invited to <a href="https://github.com/talgalili/installr/issues" target="_blank">open an issue in the github page</a>.</em></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/26965/predictions-from-fred-bazzoli-editor-of-health-data-management</guid>
	<pubDate>Thu, 14 Apr 2016 21:15:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/26965/predictions-from-fred-bazzoli-editor-of-health-data-management</link>
	<title><![CDATA[Predictions from Fred Bazzoli, Editor of Health Data Management]]></title>
	<description><![CDATA[<p>https://www.youtube.com/watch?v=xJxH-tWk5LI</p>]]></description>
	<dc:creator>parul</dc:creator>
</item>

</channel>
</rss>