<?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/27331?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/27331?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</guid>
	<pubDate>Fri, 17 Apr 2015 04:34:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</link>
	<title><![CDATA[BCIL Bioinformatics BITP Application !!]]></title>
	<description><![CDATA[<p>BCIL Bioinformatics BITP Application Form 2015 logoGrab latest Information! Biotech Consortium India Limited has announced a notification for offering admission in Biotech Industrial Training Program. The organization has invited online application from 7th April 2015 BCIL Admission 2015. BCIL has conducted an entrance exam which is scheduled on 20th June 2015. Candidates those who are looking for this program just go for it and don&rsquo;t miss this opportunity.<br /><br />To apply for Biotech Industrial Training Programme the candidates should have 50% marks in B.Tech/BE/M.Tech Degree in Bio technology, bio process technology and other related disciplines form any recognized institution. The organization has decided application fee of Rs.500/- for all candidates and that should be paid through demand draft. Applicants who satisfy the organization requirement, they can take their steps forward.<br /><br />Candidates should submit the online application before 10th May 2015. After registering the online application you need to take the hard copy of it and send through post. Print out of this application should be reached before 15th May 2015. All the latest updates like selection process, exam syllabus and other related information are updated soon at the main URL of the department and aspirants should keep in touch with this site. Further details of BCIL Bioinformatics BITP Application Form 2015 are explained below.<br /><br />Organization: Biotech Consortium India Limited<br /><br />Website URL: www.bcil.nic.in<br /><br />Location: New Delhi<br /><br />Course Name: Biotech Industrial Training Program<br /><br />Exam Name: BCIL Entrance Exam<br /><br />Educational Details: Applicants should complete their B.Tech/M.Tech/BE programs in Neuro- Science, Agricultural, Bio technology, bio process technology and other related disciplines having 50% aggregate from any authorized university.<br /><br />Application Fee: For all candidates application fee is Rs.500/- and it will be paid through Demand Draft drawn in favour of BCIL, New Delhi.<br /><br />How to Apply: Candidates who are willing to apply for this program they can apply through online mode. Then send the hard copy of registered application form to through post.<br /><br />Important Dates<br /><br />Opening Date of Submission Online Application Form: 7h April 2015<br /><br />Closing Date of Submission of Online Application Form: 10th May 2015<br /><br />Last Date of Receipt of Application Form: 15th May 2015<br /><br />Exam Date: 20th June 2015</p><p>More at http://bcil.nic.in/default.htm</p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22024/research-associate-bioinformatics-job-position-in-indian-agricultural-statistics-research-institute-iasri-pusa-new-delhi</guid>
  <pubDate>Tue, 14 Apr 2015 11:57:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics job position in Indian Agricultural Statistics Research Institute (IASRI), Pusa, New Delhi]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute is inviting applications from indian citizens for recruiting following posts:</p>

<p>Vacancies:<br />Research Associate-02<br />Age Limits:<br />Candidates age limit should be not more than 40 years as on date of interview.<br />Qualification:<br />Candidates should possess Ph.D in Bioinformatics/Agricultural Statistics/Statistics/Computer Science/Computer Application or equivalent.<br />Selection Process:<br />Selection will be based on interview.<br />How to Apply:<br />Eligible candidates may attend for interview along with application in prescribed format, recent passport size photograph pasted on the application form, bio-data, original certificates and self attested copies of relevant documents, all experience certificates, testimonials etc, held at Indian Agricultural Statistics Research Institute, Pusa, New Delhi on 18-04-2015 at 10:30 AM.<br />Last Date:<br />18-04-2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:12:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22044/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper for round ONE.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22044" length="1260" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37837/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Thu, 04 Oct 2018 16:39:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37837/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</link>
	<title><![CDATA[ClipCrop: a tool for detecting structural variations with single-base resolution using soft-clipping information]]></title>
	<description><![CDATA[<p>This is a tool for detecting structural variations using soft-clipping information From&nbsp;<a href="http://samtools.sourceforge.net/SAM1.pdf">SAM</a>&nbsp;files.</p>
<p>https://github.com/shinout/clipcrop</p><p>Address of the bookmark: <a href="https://github.com/shinout/clipcrop" rel="nofollow">https://github.com/shinout/clipcrop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/22068/binc-examination-2015</guid>
	<pubDate>Fri, 17 Apr 2015 03:34:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22068/binc-examination-2015</link>
	<title><![CDATA[BINC examination 2015 !!!]]></title>
	<description><![CDATA[<p>BioInformatics National Certification (BINC) Examination 2015 organized by Department of Biotechnology, Government of India, New Delhi Pondicherry University, Puducherry</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22068" length="281577" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38561/hawkeye-an-interactive-visual-analytics-tool-for-genome-assemblies</guid>
	<pubDate>Tue, 01 Jan 2019 11:56:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38561/hawkeye-an-interactive-visual-analytics-tool-for-genome-assemblies</link>
	<title><![CDATA[Hawkeye: an interactive visual analytics tool for genome assemblies]]></title>
	<description><![CDATA[<p><span>Genome sequencing remains an inexact science, and genome sequences can contain significant errors if they are not carefully examined. Hawkeye is our new visual analytics tool for genome assemblies, designed to aid in identifying and correcting assembly errors. Users can analyze all levels of an assembly along with summary statistics and assembly metrics, and are guided by a ranking component towards likely mis-assemblies. Hawkeye is freely available and released as part of the open source AMOS project&nbsp;</span><span><a href="http://amos.sourceforge.net/hawkeye"><span>http://amos.sourceforge.net/hawkeye</span></a></span><span>.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/gb-2007-8-3-r34</p><p>Address of the bookmark: <a href="http://amos.sourceforge.net/wiki/index.php?title=Hawkeye" rel="nofollow">http://amos.sourceforge.net/wiki/index.php?title=Hawkeye</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22234/national-institute-of-biologicals-recruitment-2015</guid>
  <pubDate>Mon, 27 Apr 2015 19:44:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[National Institute of Biologicals Recruitment 2015]]></title>
  <description><![CDATA[
<p>National Institute of Biologicals (NIB), Noida<br />Job Code: 260415(04)Y</p>

<p>National Institute of Biologicals (NIB), Noida invites applications to recruit on vacant posts of Scientist, Training Officer, Administrative Assistant, Stenographer, Junior Engineer, Computer Operator etc. Applications against these Government Jobs can be submitted on or before 01 July 2015.</p>

<p>NIB Vacancy 2015 Details<br />1. Scientist Grade III – 06<br />Qualification: PG degree in the concern field.<br />Age Limit: 35 Years</p>

<p>2. Junior Scientist – 07<br />Qualification: M.Sc. in Microbiology / Clinical Microbiology / Biotechnology/ Bioinformatics/ Biochemistry/Bacteriology/Pharmacology/ Serology / Molecular Biology/Physiology from any recognized University with at least 60% marks.<br />Age Limit: 30 Years</p>

<p>How to Apply: Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Administrative Officer, National Institute of Biologicals (Ministry of Health &amp; Family Welfare), A-32, Sector-62, Institutional Area, Noida-201309. Click here to obtain application form.</p>

<p>The Last Date to apply to NIB Job is 01 July 2015.</p>

<p>Click here to view details http://nib.gov.in/Advt%20%20%2824.04.2015%29.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</guid>
	<pubDate>Tue, 03 Dec 2019 02:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</link>
	<title><![CDATA[Minipolish: A tool for Racon polishing of miniasm assemblies]]></title>
	<description><![CDATA[<p><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate &ndash; they are essentially made of stitched-together pieces of long reads.</p>
<p><a href="https://github.com/isovic/racon">Racon</a>&nbsp;is a great polishing tool that can be used to clean up assembly errors. It's also very fast and well suited for long-read data. However, it operates on FASTA files, not the&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA graphs</a>&nbsp;that miniasm makes.</p>
<p>That's where Minipolish comes in. With a single command, it will use Racon to polish up a miniasm assembly, while keeping the assembly in graph form.</p>
<p>It also takes care of some of the other nuances of polishing a miniasm assembly:</p>
<ul>
<li>Adding read depth information to contigs</li>
<li>Fixing sequence truncation that can occur in Racon</li>
<li>Adding circularising links to circular contigs if not already present (so they display better in&nbsp;<a href="https://github.com/rrwick/Bandage">Bandage</a>)</li>
<li>'Rotating' circular contigs between polishing rounds to ensure clean circularisation</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Minipolish" rel="nofollow">https://github.com/rrwick/Minipolish</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>