<?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/30680?offset=480</link>
	<atom:link href="https://bioinformaticsonline.com/related/30680?offset=480" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12111/internship-program-with-arraygen-technolgies</guid>
  <pubDate>Sun, 22 Jun 2014 23:18:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship program with ArrayGen Technolgies]]></title>
  <description><![CDATA[
<p>Internship Program for Bioinformatics / Biotechnology Professionals Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>

<p>Interested candidates may email their resume along with a cover letter to careers@arraygen.com</p>

<p>Official website: http://www.arraygen.com/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12566/jrf-at-national-research-centre-on-plant-biotechnology</guid>
  <pubDate>Fri, 04 Jul 2014 13:36:02 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF at NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY]]></title>
  <description><![CDATA[
<p>NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY</p>

<p>New Delhi-110012</p>

<p>Walk in interview</p>

<p>Eligible candidates may appear for Walk-in interview for the temporary positions of JRF/SRF/ RA, in ICAR, DBT funded research projects. Positions are purely temporary in nature and are co-terminus with the projects. The initial appointment will be for maximum one year, which can be extended on the basis of assessment of the candidate performance and need in the project work (PI-Dr. N. K. Singh, National Professor).</p>

<p>Name of the</p>

<p>PI (Project)<br />	</p>

<p>Name of</p>

<p>Position<br />	</p>

<p>Number of</p>

<p>positions<br />	</p>

<p>Emoluments</p>

<p>Fixed per</p>

<p>month (Rs.)<br />	</p>

<p>Essential</p>

<p>Qualifications</p>

<p>DBT-“Physical Mapping and Sample sequencing of Wheat Chromosome 2A- International Wheat Genome Sequencing Consortium (India)”.</p>

<p>(Up to Nov,2014)</p>

<p>DBT- Identification and functional analysis of genes related to yield and biotic stresses (Up to Oct,2014)</p>

<p>NPTC-Central Facility<br />	</p>

<p>RA (Master)</p>

<p>JRF/SRF</p>

<p>Research Associate: One</p>

<p>Essential: MCA or M. Tech. (Bioinformatics and computer Science with 2 years experience in Database Management with</p>

<p>MySQL, Linux)</p>

<p>Desirable: Proficiency in handling of large biological databases</p>

<p>Age limit: Max. Age 35 years (Age of relaxation of 5 years for SC/ST&amp; woman. and 3 years for OBC). The interview will be held on 08 July, 2014 at 11 am at room no. 39, NRCPB, LBS Building, Pusa Campus, New Delhi-110012. The candidates must bring original certificates and four copies of biodata, and recent passport size photograph. No TA/DA would be given for the appearance in interview. Only the candidates having essential qualifications would be entertained for the interviews.</p>

<p>Advertisement:</p>

<p>www.nrcpb.org/sites/default/files/news%20paper%20advirtisment..docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43364/ragtag-a-collection-of-software-tools-for-scaffolding-and-improving-modern-genome-assemblies</guid>
	<pubDate>Sat, 11 Sep 2021 00:28:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43364/ragtag-a-collection-of-software-tools-for-scaffolding-and-improving-modern-genome-assemblies</link>
	<title><![CDATA[RagTag: a collection of software tools for scaffolding and improving modern genome assemblies]]></title>
	<description><![CDATA[<p>RagTag is a collection of software tools for scaffolding and improving modern genome assemblies. Tasks include:</p>
<ul>
<li>Homology-based misassembly&nbsp;<a href="https://github.com/malonge/RagTag/wiki/correct">correction</a></li>
<li>Homology-based assembly&nbsp;<a href="https://github.com/malonge/RagTag/wiki/scaffold">scaffolding</a>&nbsp;and&nbsp;<a href="https://github.com/malonge/RagTag/wiki/patch">patching</a></li>
<li>Scaffold&nbsp;<a href="https://github.com/malonge/RagTag/wiki/merge">merging</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/malonge/RagTag" rel="nofollow">https://github.com/malonge/RagTag</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12988/guest-lecturer-molecular-biology-bioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 13:34:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Guest Lecturer - Molecular Biology &amp; Bioinformatics]]></title>
  <description><![CDATA[
<p>Adv. No. F.TU/ACA/GT-APP/01/14 Date: 07.07.2014</p>

<p>Faculty of Science</p>

<p>Essential Qualifications:</p>

<p>(i) Good academic record having at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s Degree level in a relevant subject, from an Indian University, or an equivalent degree from an accredited foreign University.</p>

<p>(II) Besides fulfilling the above qualifications, the candidates must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET.</p>

<p>(III) Notwithstanding anything contained in sub-clauses (i) and (ii) of clause 4.4.1 of UGC regulations 2010, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/ SLET/ SET for engagement of guest Teacher.</p>

<p>(IV) NET/ SLET/ SET shall also not be required for such Master’s Degree Programmes in discipline for which NET/ SLET/ SET is not conducted.</p>

<p>Application form along with detailed instructions can be downloaded from Tripura University website: www.tripurauniv.in. The duly filled in application forms complete in all respects may be sent so as to reach the Office of the Deputy Registrar Academic Branch, Tripura University, Suryamaninagar - 799022, Tripura on or before 31st July, 2014. The Candidates who responded against advertisement No. TU.REG/N-Advt./02/10 dated 20.02.2014 need not apply again.</p>

<p>For more info visit: http://www.tripurauniv.in/images/universitymedia/EmploymentNotification/Guest%20Teacher%20Advt.%20website_09072014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</guid>
	<pubDate>Wed, 20 Aug 2014 21:57:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</link>
	<title><![CDATA[The 8000 years old Tibetian gene mutation !!!]]></title>
	<description><![CDATA[<p>A new study has provided insight into how gene mutation around 8,000 years ago helped Tibetans' to survive in the thin air on the Tibetan Plateau, where an average elevation is of 14,800 feet.<br /><br />A study led by University of Utah scientists is the first to find a genetic cause for the adaptation, a single DNA base pair change that dates back 8,000 years and demonstrate how it contributes to the Tibetans' ability to live in low oxygen conditions.</p><p>About 8,000 years ago, the gene EGLN1 changed by a single DNA base pair. Today, a relatively short time later on the scale of human history, 88 percent of Tibetans have the genetic variation, and it was virtually absent from closely related lowland Asians. The findings indicate the genetic variation endows its carriers with an advantage.<br /><br />In those without the adaptation, low oxygen caused their blood to become thick with oxygen-carrying red blood cells, an attempt to feed starved tissues, which could cause long-term complications such as heart failure. The researchers found that the newly identified genetic variation protected Tibetans by decreasing the over-response to low oxygen.</p><p>Reference: http://www.nature.com/nature/journal/v512/n7513/abs/nature13408.html</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12936/assistant-professor-medical-bioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 05:00:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor - Medical Bioinformatics]]></title>
  <description><![CDATA[
<p>Advt. No : ME-I/A-IV/03/14</p>

<p>No.of Posts:01 (SC)</p>

<p>Pay Scale:</p>

<p>Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.</p>

<p>Qualifications:</p>

<p>Area of Specialization:-</p>

<p>Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology</p>

<p>1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.</p>

<p>2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/</p>

<p>Immunology/Structural Biology etc</p>

<p>Experience:</p>

<p>1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical</p>

<p>Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.</p>

<p>2. Minimum two publication with atleast one in international journal and atleast one as first author</p>

<p>Desirable:-</p>

<p>Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)</p>

<p>Send your applications to O/O, Deputy Registrar, Recruitment &amp; Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014</p>

<p>For more details,please visit website:http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/13025/the-5-reasons-to-mistakes-at-bioinformatics-work</guid>
	<pubDate>Thu, 24 Jul 2014 02:51:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/13025/the-5-reasons-to-mistakes-at-bioinformatics-work</link>
	<title><![CDATA[The 5 reasons to mistakes at bioinformatics work !!!]]></title>
	<description><![CDATA[<p>When you're just starting out with biological programming, it's easy to run into complex problems that make you wonder how anyone has ever managed to write a program. There are some problems that trip up nearly every bioinformatician--everything from getting started understanding the biological problems to dealing with program design. Some random mistakes are so prominent that even experienced biological programmers do it. The 8 years in bioinformatics and my few random observations, most of them are snarky. These reasons will always take longer than expected and compel you to postpone your project deadline.</p><p><strong>1.Stupid for biologist:</strong> Biology is so complex that it will make bioinformatician feel stupid. There are no any universal fixed rules; it can surprise you any time. So be nice to biologists who ask questions and resolve your biological puzzles. Sometime you will have no idea what the hell you were doing either.<br /><br /><strong>2.Puzzling why:</strong> Do not hesitate to ask question. Especially. at the beginning of project you will have to ask a lot of questions. Instead of puzzling it out at end check out and clear your doubt even for a single error. It may can leads to wrong conclusion.<br /><br /><strong>3.Running marathon:</strong> The most of the biological software&rsquo;s documentation is always incomplete. In other word they are no more than 95 percent complete. Sometime a single problem can halt your entire project for months. Compilation and running the pipelines in tedious because almost all are interdependent and need proper configuration. I face the same kind of problem with Evolver :( &hellip; <br /><br /><strong>4.Folders missing:</strong> The pipelines generate lots of data, and we keep them in several folders for future use. But sometime we delete them by mistake and move to recovery&hellip;<br /><br /><strong>5.Digging deeper:</strong> Digging deeper is fruitful, but some time it can be catastrophic. You may get frustrated or direction less. So keep a biologist with you for rescue &hellip;. Sometime an expert computer programmer to handle your server. Remember, the server will always go down when you need it the most.<br /><br />The most common frustrating&nbsp; common line: Why do we do this again?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>