<?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/28915?offset=1520</link>
	<atom:link href="https://bioinformaticsonline.com/related/28915?offset=1520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/23537/research-associate-bioinformatics-central-institute-for-research-on-buffaloes-cirb-hisar-haryana</guid>
  <pubDate>Fri, 31 Jul 2015 10:19:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics Central Institute for Research on Buffaloes (CIRB) - Hisar, Haryana]]></title>
  <description><![CDATA[
<p>Research Associate (RA) under Network Project on Agricultural Bioinformatics</p>

<p>Name of the Project : Network Project on Agricultural Bioinformatics Number of positions One<br />Qualifications : Ph.D Degree in Bioinformatics/Biotechnology/ Biochemistry/Genetics &amp; Breeding/Life Sciences OR Master’s Degree in relevant subject with at least 2 years research experience. Desirable : Working experience in Molecular Biology/Genomics/Bioinformatics, specifically, sequence data analysis using software’s proficiently</p>

<p>Emoluments : Masters Degree Holders Rs. 38,000/- per month Doctoral Degree Holders Rs. 40,000/- per month</p>

<p>Emoluments : Rs.25000/- per month for 1st and 2nd year and Rs. 28000/- per month for 3rd year<br />Age Limit : Upper age limit is 35 years for men and 40 years for women on the date of interview. Age relaxation for SC/ST and OBC candidates as per rules</p>

<p>More at http://www.cirb.res.in/attachments/195_walk-in-interview%20for%20contractual%20positions%20of%20RA%20and%20SRF%20%28On%20Dated%2011.8.2015%29.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21022/ra-bioinformatics-at-tezpur-university</guid>
  <pubDate>Fri, 06 Feb 2015 04:11:23 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at TEZPUR UNIVERSITY]]></title>
  <description><![CDATA[
<p>Walk-in-interview will be held on 23 February, 2015 at 11.00 a.m. for the following temporary positions in the DBT (U-EXCEL) sponsored project entitled “Sequencing genomes of some bacteria that invade/resides in tomato plant” under the Principal Investigator Dr. Suvendra Kumar Ray, Department of Molecular Biology and Biotechnology, Tezpur University.</p>

<p>Interested candidates may appear before the interview board on 23 February, 2015 at the Office of the Head, Department of Molecular Biology &amp; Biotechnology, Tezpur University with original documents and photocopies of marks sheets, certificates, testimonials, caste certificate (if applicable), experience certificate and a copy of curriculum vitae (CV) duly signed by the candidate.</p>

<p>Position: One (01) Research Associate.</p>

<p>Educational Qualification: Candidates having Ph.D. degree or submitted thesis in any topic of Life Science Areas (Zoology, Botany, Microbiology, Biotechnology etc.) along with knowledge of gene and protein sequence analysis may apply.</p>

<p>Remuneration: Rs. 22,000/- (Rupees twenty two thousand) only + 10% HRA as admissible per month for the first year and Rs. 23,000/- (Rupees twenty three thousand) only + 10% HRA as admissible per month for the second year.</p>

<p>Age: Candidate preferably below the age of 40 years who have obtained a doctorate (Ph.D.) degree from a recognized University.</p>

<p>Upper age limit may be relaxed up to 5 years in the case of candidates belonging SC/ST/OBC/Women and physically challenged.</p>

<p>Position: One (01) Project Assistant.</p>

<p>Educational Qualification: B.Sc./B.Tech./B.E./B.Pharma in any branch with minimum 55% mark in the qualifying examinations and minimum 50 % mark in 10th and 10+2 Science examinations.</p>

<p>Remuneration: Rs. 8,000/- (Rupees eight thousand) only per month (consolidated). Age: Candidate should not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/OBC/Women/Physically Challenged.</p>

<p>Duration: One year or till completion of the project, whichever is earlier. N.B. No TA/DA will be paid to the candidates for attending the interview.</p>

<p>For further information contact – Dr. Suvendra Kumar Ray, Associate Professor Email: suven@tezu.ernet.in Department of Molecular Biology and Biotechnology Tezpur University Sd/- Dean, Research &amp; Development Tezpur University</p>

<p>Advertisement: http://www.tezu.ernet.in/ProjectWalkin/Advt-SKR2-5342-A.pdf</p>
]]></description>
</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/21095/ra-walk-in-interview-actrec</guid>
  <pubDate>Mon, 09 Feb 2015 01:06:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA WALK-IN-INTERVIEW @ ACTREC]]></title>
  <description><![CDATA[
<p>No. ACTREC/Advt./ 7 /2015</p>

<p>Title of the Project<br />Research Associate<br />(One position)<br />DBTs Biotechnology/Bioinformatics training centre<br />PI Dr. Ashok Varma	</p>

<p>Duration of the Project Six Months from the date of appointment, can be extended further for six month.</p>

<p>Date &amp; Time: 17th February, 2015 at 10.00 a.m.</p>

<p>Venue: Meeting Room, 3rd floor, Khanolkar Shodhika, ACTREC</p>

<p>Essential Qualifications and Experience:</p>

<p>Ph.D. Degree in Basic Sciences from recognized University. Research experience in Bioinformatics or on gene cloning, protein purification, and crystallization.</p>

<p>*M.Sc. degree obtained after a one year course will not be considered.</p>

<p>Selected candidate will have to join at the earliest.</p>

<p>Consolidated Salary: Rs.28,600/- p.m. {Rs.22,000/- + 30% HRA}</p>

<p>The work progress of the candidate will be monitored and extension after 6 months will depend on satisfactory progress of the work.</p>

<p>Candidates fulfilling these requirements should pre-register by sending their application in the prescribed format with recent CV and contact details of 2 referees by e-mail to ‘program.office@actrec.gov.in’ latest by 17.00 hrs on 12-02-2015.<br />The interviews would be held on 17th February, 2015 and will be only for the pre-registered candidates. Candidates should report between 09.30 to 10.00 a.m. in Steno Pool, 3rd floor, Khanolkar Shodhika, ACTREC, Kharghar, Navi Mumbai.<br />No T.A./D.A. will be admissible for attending the interview.</p>

<p>At the time of Interview the candidate should bring original certificates along with CV with contact details of 2 referees and submit the photocopies (attested) of the certificates, with a recent passport size photograph.</p>

<p>All correspondence should be strictly made only to ‘program.office@actrec.gov.in’ as indicated.</p>

<p>Advertisement: www.actrec.gov.in/data%20files/2015/AV-RA-DBT-28-1-15.docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21242/summer-intern-research-bioinformatics</guid>
  <pubDate>Mon, 16 Feb 2015 12:26:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Summer Intern - Research Bioinformatics]]></title>
  <description><![CDATA[
<p>Be proficient in LINUX, know perl or python, understand biology and Next Generation Sequencing.<br />The intern will port Agile Assay Design pipelines into Galaxy.<br />The intern will also learn to develope his/her own bioinformatics pipelines for PCR or NGS data analysis.</p>

<p>Who you are<br />You’re someone who wants to influence your own development. You’re looking for a company where you have the opportunity to pursue your interests across functions and geographies. Where a job title is not considered the final definition of who you are, but the starting point.</p>

<p>Qualifications:<br />Major: Bioinformatcis or biology major who is interested and wants to learn Biocomputing, At least 2 years of college.<br />Basic knowledge of LINUX and programming, e.g., perl, python, XML.</p>

<p>More at http://www.roche.com/careers/jobs/jobsearch/job.htm?id=E-00437679&amp;locale=en&amp;title=Summer%20Intern%20-%20Research%20Bioinformatics</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21436/jrf-bioinformatics-iisr-kozhikode</guid>
  <pubDate>Tue, 24 Feb 2015 08:44:17 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ IISR, Kozhikode]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics Jobs recruitment in Indian Institute of Spices Research on temporary basis</p>

<p>Name of the Scheme : Distributed Information Sub Centre – DISC</p>

<p>Qualifications :  M.Sc/ B Tech in Bioinformatics with NET/GATE or M Tech in Bioinformatics</p>

<p>Number of posts : One</p>

<p>Emoluments : Rs. 25,000/-</p>

<p>Upper age limit : 35 years for Men &amp; 40 years for Women as on date of Interview<br />How to apply</p>

<p>Date of Interview : 12-03-2015 at 10.00 AM. All relevant certificates (in original) and bio data, 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.</p>

<p>More at http://spices.res.in/index.php?option=com_content&amp;view=article&amp;id=263</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</guid>
	<pubDate>Thu, 31 Jan 2019 05:12:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</link>
	<title><![CDATA[nQuire: A statistical framework for ploidy estimation using NGS short-read data]]></title>
	<description><![CDATA[<p>nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.</p>
<p>For more background see also the publication at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2128-z">BMC Bioinformatics</a>.</p>
<p>https://github.com/clwgg/nQuire</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuire" rel="nofollow">https://github.com/clwgg/nQuire</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>