<?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/27696?offset=1730</link>
	<atom:link href="https://bioinformaticsonline.com/related/27696?offset=1730" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/7288/critical-to-discoveries-in-bioinformatics</guid>
	<pubDate>Mon, 16 Dec 2013 17:13:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/7288/critical-to-discoveries-in-bioinformatics</link>
	<title><![CDATA[Critical to discoveries in bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/MnKvMP8CeSQ" frameborder="0" allowfullscreen></iframe>EMBL-EBI distributes datasets worldwide using the Janet network. This biological data enables the discovery of new drugs, new diagnostics and increasingly new agro-chemicals.  Their work, which includes the 1000-genome project, has generated petabytes of data and this growth is showing no signs of abating.  On-demand bandwidth over Janet will therefore be critical to their ongoing work.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</guid>
	<pubDate>Sat, 25 Nov 2017 08:57:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</link>
	<title><![CDATA[coursera genome assembly tutorial]]></title>
	<description><![CDATA[<p><span>Solutions to Coursera Genome Sequencing (Bioinformatics II)</span></p><p>Address of the bookmark: <a href="https://github.com/iansealy/coursera-assembly" rel="nofollow">https://github.com/iansealy/coursera-assembly</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7483/research-associate-indian-institute-of-spices-research</guid>
  <pubDate>Wed, 25 Dec 2013 12:34:43 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate @ INDIAN INSTITUTE OF SPICES RESEARCH]]></title>
  <description><![CDATA[
<p>INDIAN INSTITUTE OF SPICES RESEARCH<br />(Indian Council of Agricultural Research)<br />Marikunnu P.O., Kozhikode – 673 012, Kerala</p>

<p>WALK -IN- TEST CUM INTERVIEW</p>

<p>Walk- in- Test cum Interview (based on test) for the selection of Research Associate (Bioinformatics) &amp; Bioinformatic Trainees under the scheme ‘Distributed Information Sub Centre- DISC’ will be held at this Institute as per details indicated below.</p>

<p>Research Associate</p>

<p>Date of Interview : 21 -01-2014 at 10.00 A.M</p>

<p>Qualifications : a) Essential: Doctorate degree in Bioinformatics or Biotechnology/Life Sciences/Biochemistry with expertise in  Bioinformatics as evidenced by publications.</p>

<p>OR</p>

<p>Three years research experience after MVSc/MPharm/ME/MTech with Bioinformatics  Specialization.</p>

<p>b Desirable: Experience in handling NGS data  Programming skills in Python/Bioperl</p>

<p>Emoluments : Rs:22000/- per month + HRA (higher pay upto Rs.24000/- can be paid  depending on the qualifications and experience.</p>

<p>Upper age limit : 40 years for Men &amp; 45 years for Women as on date of Interview (Upper Age limits are relaxable for SC, ST and OBC candidates as per Govt. of India norms (at present 5 years for SC/ST and 3 years for OBC)</p>

<p>Duration of Project : Till the closure of the project.</p>

<p>General Terms and conditions</p>

<p>1. The above positions are purely on temporary basis and is co-terminus with the closure of the project. There is no provision of re-employment after termination of project. The selected candidate will not have any right for claiming pay scale or absorption against any regular post being vacant on a later date at this Institute.<br />2 . No TA/DA will be paid for attending the Interview.<br />3. Canvassing in any form will lead to cancellation of candidate.<br />4. The decision of Director, IISR would be final and binding in all aspects.<br />5. Candidates will not be permitted to enter the Examination Hall after 10.00 A.M.<br />6. Candidates who secure the minimum marks prescribed by the Institute in written test  only will be eligible for calling for the interview. The number of candidates to be  called for the interview will be decided by the Director of the Institute.<br />7 Those who do not possess original Degree/PG certificate or Provisional certificate will not be allowed to attend the Test/Interview.</p>

<p>Note: All relevant certificates (in original) and bio data<br />No objection certificate in case he/she is employed elsewhere and experience certificate in original (if any) need to be produced at the time of interview.<br />Location of IISR Kozhikode Main Campus - Pallithazham bus stop between Moozhikkal East and Chelavoor on the NH 212 ”Kozhikode - Kollegal” Road.</p>

<p>Advertisement:  www.spices.res.in/pdf/DISC-Website.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>