<?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/27216?offset=480</link>
	<atom:link href="https://bioinformaticsonline.com/related/27216?offset=480" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<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/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</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/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</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/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</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/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</guid>
	<pubDate>Fri, 24 Jun 2016 18:08:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28051/convert-ensembl-gtf-to-annotation-table-geneid-genesymbol-genewisechrlocation-geneclass-strand-raw</link>
	<title><![CDATA[Convert EnsEMBL GTF to Annotation table (Geneid, GeneSymbol, GeneWiseChrLocation, GeneClass, Strand) Raw]]></title>
	<description><![CDATA[<p><strong>Bash Script source:</strong></p><p>https://gist.github.com/santhilalsubhash/367befcf5216be4b1fd9</p><p>&nbsp;</p><p><strong>Information</strong>:</p><p>This script converts EnsEMBL GTF (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF">https://gist.githubusercontent.com/santhilalsubhash/1e7cca357e52a181dc25/raw/cfb803e07900a2baefbb6534f1299fd30cb57a29/sample.GTF</a>) file to annotation table format. It generated two files<br />1) Transcript wise chromosome location with information about transcripts (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c7dec516e0338503a4b6/raw/de0af1a39f0005c4ce7321c5ae57fc8b4a14c7f4/sample.GTF_enst_annotation.txt</a>)<br />2) Gene wise chromosome location with information about genes (Ex:&nbsp;<a href="https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt">https://gist.githubusercontent.com/santhilalsubhash/c92006c5080f0333bec2/raw/d16e0b2440d73b09b486d3c9751cdb248a73fa0b/sample.GTF_ensg_annotation.txt</a>)</p><p>Note: You can download GTF files from&nbsp;<a href="http://www.ensembl.org/info/data/ftp/index.html">http://www.ensembl.org/info/data/ftp/index.html</a></p>]]></description>
	<dc:creator>EagleEye</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22429/walk-ins-for-jrf-ans-srf-post-in-nirrh-mumbai</guid>
  <pubDate>Thu, 28 May 2015 19:04:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for JRF ans SRF post in NIRRH, Mumbai]]></title>
  <description><![CDATA[
<p>Title of project- "EXPLORING THE HINGE AND TRANSMEMBRANE REGION OF HUMAN FSHR FOR DESIGN OF SMALL MOLECULE AND PEPTIDOMIMETIC MODULATORS"<br />Name of the Post- Junior Research Fellow<br />No. of vacancy- One<br />Stipend- Rs. 25000/ +30% HRA<br />Essential qualification- Candidate should be Post Graduate Degree in Life Sciences / Bioinformatics /Pharmacology/ Chemistry or any other relevant area of Biology or Graduate Degree in Professional Course with NET qualification or Post Graduate Degree in Professional Course.<br />Desirable- Candidate with Good knowledge of protein structures, docking, MD simulations will be preferred.<br />Age Limit- Not exceeding 28 Years<br />Duration of project- Upto May 2018</p>

<p>Title of project- "Analysis of the structures of known antimicrobial peptides using machine learning algorithms and molecular dynamics simulations".<br />Name of the Post- Senior Research Fellow<br />No. of vacancy- One<br />Stipend- Rs. 14000/ +30% HRA<br />Essential qualification- Candidate should be having M.Sc. degree in Life Sciences / Bioinformatics / Pharmacology/ Chemistry or any other relevant area of Biology and 2 years of research experience.<br />Desirable- Candidate with Good knowledge of protein structures, docking, MD simulations will be preferred.<br />Age Limit- Not exceeding 35 Years<br />Duration of project- Upto April 2016<br />How to Apply- Interested candidates can download the application form from below mentioned link- http://www.nirrh.res.in/links/BiodataForm.pdf<br />Candidate must bring the filled up application form along with all the relevant documents in original and one set of attested photocopies of the same and one passport size recent colour photograph.</p>

<p>Ref. - http://www.nirrh.res.in/links/job_jrf-srf.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>