<?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/31881?offset=1200</link>
	<atom:link href="https://bioinformaticsonline.com/related/31881?offset=1200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</guid>
	<pubDate>Thu, 24 May 2018 02:53:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</link>
	<title><![CDATA[%MinMax: A versatile tool for calculating and comparing synonymous codon usage and its impact on protein folding.]]></title>
	<description><![CDATA[%MM calculates whether a given gene sequence encodes amino acids using the most common codons possible, the least common codons possible, or (most typically) some combination of these extremes. See our PLoS ONE paper for more details on how the %MinMax algorithm works. 

%MinMax results are averaged over an 18-codon sliding window; hence the result for "codon window = 1" is the average codon usage for codons 1-18, codon window 2 = codons 2-19, etc.<p>Address of the bookmark: <a href="http://www.codons.org/" rel="nofollow">http://www.codons.org/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23384/research-scientist-at-dupont</guid>
  <pubDate>Fri, 17 Jul 2015 20:36:17 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist at DuPONT]]></title>
  <description><![CDATA[
<p>Research Scientist<br />Hyderabad, Telangana<br />Job Description</p>

<p>Job Description</p>

<p>The Global Trait Discovery Informatics (GTDI) group located at the DuPont Knowledge Centre (DKC), Hyderabad, India is currently seeking applications for a highly motivated computational biologist. The GTDI group contributes to research programs in plant biotechnology at the DKC as well as across research centers located in DuPont Pioneer, Johnston, Iowa and at the DuPont Experimental Station in Wilmington, Delaware.</p>

<p>We are looking for candidates who have experience in analysis of high-throughput -omics datasets. The researcher will be primarily responsible for analyzing diverse -omics datatypes, such as transcriptomics, proteomics and metabolomics and actively contribute towards building streamlined solutions.</p>

<p>The candidate will be part of a diverse team of experimental biologists, computational biologists and software developers. A critical aspect of this position involves working with global teams across multiple locations and will require effective project coordination and communication skills. This is an exciting opportunity for candidates with strong data driven skills, who want to work at the interface of computational and experimental biology and contribute towards scientific discovery.</p>

<p>Responsibilities</p>

<p>·Integrate and analyze multiple datatypes in the context of experimental observations with a goal towards formulating testable hypothesis.</p>

<p>·Understanding the research questions from experimental biologists and formulate relevant in silico analyses.</p>

<p>·Establish and implement systematic analysis workflows starting from processing of raw data to biological interpretation.</p>

<p>·Critically analyze a wide variety of experimental data with a view to solving the underlying research questions.</p>

<p>·Identify and generate datasets for scientific testing and evaluation of algorithms.</p>

<p>Qualifications</p>

<p>PhD in computational biology, bioinformatics, population genetics, complex systems, computer sciences or any relevant physical or mathematical sciences, with experience in analyzing diverse -omics datasets.</p>

<p>Job Qualifications</p>

<p>Qualifications</p>

<p>PhD in computational biology, bioinformatics, population genetics, complex systems, computer sciences or any relevant physical or mathematical sciences, with experience in analyzing diverse -omics datasets.</p>

<p>More at http://careers.dupont.com/jobsearch/job-details/research-scientist/006077W-01/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</guid>
	<pubDate>Mon, 04 Jun 2018 03:45:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</link>
	<title><![CDATA[“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files]]></title>
	<description><![CDATA[One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.

Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon
Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files
Compute summary statistics for each TE family (number of TE copies, genome coverage...)
Ambiguous cases such as nested TE can be assembled into copies automatically or manually
Allow for working with a TE user-defined library
Allow for working with only a user-chosen set of TE families


http://doua.prabi.fr/software/one-code-to-find-them-all<p>Address of the bookmark: <a href="http://doua.prabi.fr/software/one-code-to-find-them-all" rel="nofollow">http://doua.prabi.fr/software/one-code-to-find-them-all</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23247/ra-at-csir-urdip</guid>
  <pubDate>Fri, 10 Jul 2015 18:34:03 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at CSIR-URDIP]]></title>
  <description><![CDATA[
<p>CSIR - UNIT FOR RESEARCH AND DEVELOPMENT OF INFORMATION PRODUCTS (CSIR- URDIP)</p>

<p>Adv. No. URDIP/ 15/2015</p>

<p>Opportunity for young Bioinformatics Professionals to make a career in the area of Intellectual Property</p>

<p>CSIR has set up a Unit for Research and Development of Information Products (CSIRURDIP) at Pune to work in the area of scientific informatics. One of the major focus areas of research work at CSIR-URDIP is PATENT INFORMATICS. With the increasing applications of Bioinformatics in the areas of life sciences industry such as Agriculture and Health Care (Diagnostics and Drugs), the output of research in these area is being protected by different forms of Intellectual Property rights. Realizing the importance of IP in the Bioinformatics field, Department of Biotechnology (DBT) has sanctioned a project on “Development, Facilitation and Harvesting of Bioinformatics related Intellectual Property” at CSIR-URDIP.</p>

<p>The project will involve application of Patent Informatics tools and techniques to Bioinformatics (including creation of patent landscapes, preparation of techno-legal reports of patentability, freedom to operate studies) to help protect IPRs and develop and conduct training programmes on IPRs related to Bioinformatics.</p>

<p>CSIR-URDIP invites applications from young Bioinformatics professionals to work on this emerging area which offers challenging opportunities and attractive career possibilities in future.</p>

<p>Position I: Research Associate</p>

<p>No of Positions: One</p>

<p>Consolidated amount Payable: = Rs 26,400.00</p>

<p>Qualification: PhD in Bioinformatics. In exceptional cases, candidature of M. Tech. candidates with First class in Bioinformatics with three years of relevant work experience will also be considered.</p>

<p>Job requirement: The prospective candidate will be expected to identify patents/scientific literature in field of Bioinformatics, evaluate them Vis a Vis other patents in fields and come up landscape / FTO / Patentability reports.</p>

<p>Age Limit: 35 years. </p>

<p>The candidates meeting the above criteria may appear for walk in interview at their cost on Monday 13th July 2015 at 02:00 p.m. with the CV and supporting documents (original plus copies) at the following address: CSIR Unit or Research and Development of Information Products (URDIP), "Tapovan" S.No. 113 &amp; 114, Near NCL Colony Baner Side Gate, NCL Estate, Pashan Road, Pune-411008, Maharashtra, India</p>

<p>Advertisement: www.urdip.res.in/download/DBT_RA_Advt_July%202015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23277/project-fellow-at-ihbt-palampur-himachal-pradesh</guid>
  <pubDate>Sun, 12 Jul 2015 07:54:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow at IHBT - Palampur, Himachal Pradesh]]></title>
  <description><![CDATA[
<p>The Institute is working relentlessly on developing technologies for sustainable utilization of Himalayan bioresources, and in the area of tea, floriculture, bamboos and medicinal and aromatic plants. Looking at the mission of the Institute,the quantum of work undertaken and milestones achieved it was rightly conceived to rename the Institute from CSIR Complex Palampur to Institute of Himalayan Bioresource Technology at a high level meeting. Finally the Institute received its new name Institute of Himalayan Bioresource Technology (IHBT) in 1997 by then Prime Minister Shri H.D. Deve Gowda. Till date this is the only kind of National R&amp;D laboratory in the state of Himachal.</p>

<p>Detail Of Institute of Himalayan Bioresource Technology (IHBT) Project Fellow Recruitment:</p>

<p>No.of Posts: 02</p>

<p>Qualification : 1st Class B. Tech. in Bioinformatics/ Computational Biology Or M.Sc. in Bioinformatics/ Computational Biology with 55% marks OR M.Tech. in Bioinformatics/ Computational Biology with 55% marks.</p>

<p>Age : 28 years as on 10.06.2015</p>

<p>Pay Scale: Rs.12,000/- P.M/Rs.14,000/- P.M.</p>

<p>Age : 35 years,(Up to 40 years for members of SC/STs).</p>

<p>Selection Procedure For Institute of Himalayan Bioresource Technology (IHBT) – Project Fellow Post:</p>

<p>Written Test on 10/06/2015.</p>

<p>Shortlisted candidates will undertake face to face interview.</p>

<p>Dates are yet to be announced for the final selection</p>

<p>Walkin Procedure For Project Fellow vacancy in Institute of Himalayan Bioresource Technology (IHBT):</p>

<p>Eligible candidates may appear for Walk-in-Interview on Date : 10.06.2015, Time 9:00 A.M. Venue : CSIR- IHBT Palampur (H.P.) alongwith an application on prescribed format. Candidates must also bring with them original certificates of testimonials at the time of the appearing for interview failing which he/she will not be allowed to appear for interview.</p>

<p>Important Dates To Remember :<br />Walk in date for this job : 10/06/2015</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23369/assistant-professor-professor-at-central-university-of-south-bihar</guid>
  <pubDate>Thu, 16 Jul 2015 22:36:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor/ Professor at Central University of South Bihar]]></title>
  <description><![CDATA[
<p>Central University of South Bihar</p>

<p>(Established under Central Universities Act, 2009)</p>

<p>BIT Campus, PO: B.V. College,</p>

<p>Patna – 800 014 (Bihar)</p>

<p>Employment Notice No. CUSB / 27 / Faculty / 2015</p>

<p>Appointment for Faculty Positions Applications in the prescribed form are invited from the eligible candidates for the following posts shown against the subjects to be filled up on regular/contract/re-employment after superannuation basis:</p>

<p>1 Bioinformatics - 03 Posts</p>

<p>2 Biotechnology – 02 Posts</p>

<p>12 Life Science – 04 Posts</p>

<p>The duly filled in application form, complete in all respect along with fee must be sent only by Speed post/Registered post/Courier to The Registrar, Central University of South Bihar, BIT Campus, P.O. : B.V. College, Patna-800014.</p>

<p>Last Date of Receiving Application 10th August, 2015</p>

<p>Advertisement:</p>

<p>http://cub.ac.in/index.php?option=com_content&amp;view=article&amp;id=31&amp;Itemid=157</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</guid>
	<pubDate>Sun, 23 Sep 2018 05:12:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</link>
	<title><![CDATA[rHAT: a seed-and-extension-based noisy long read alignment tool]]></title>
	<description><![CDATA[<p><span>rHAT is a seed-and-extension-based noisy long read alignment tool. It is suitable for aligning 3rd generation sequencing reads which are in large read length with relatively high error rate, especially Pacbio's Single Molecule Read-time (SMRT) sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/dfguan/rHAT" rel="nofollow">https://github.com/dfguan/rHAT</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23672/jrf-in-bioinformatics-rajiv-gandhi-centre-for-biotechnology-rgcb-thiruvananthapuram</guid>
  <pubDate>Sat, 08 Aug 2015 01:22:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ Rajiv Gandhi Centre for Biotechnology (RGCB), Thiruvananthapuram]]></title>
  <description><![CDATA[
<p>Rajiv Gandhi Centre for Biotechnology (RGCB), Thiruvananthapuram<br />Job Code: 060815(10)Y</p>

<p>Jr Research Fellow Posts At Rajiv Gandhi Centre for Biotechnology<br />Rajiv Gandhi Centre for Biotechnology (RGCB) invites applications to recruit on vacant posts of Junior Research Fellow (JRF). Applications against these Government Jobs can be submitted on or before 15 August 2015.</p>

<p>Rajiv Gandhi Centre for Biotechnology Vacancy 2015 Details<br />Name of the post – Junior Research Fellow (JRF)<br />Total vacancies –</p>

<p>Age Limit: Below 28 years as on 15-08-2015.</p>

<p>Qualification(s): Masters Degree in Life Sciences/Biotechnology/Bioinformatics.</p>

<p>How to Apply: Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Rajiv Gandhi Centre for Biotechnology Thycaud PO, Poojappura, Thiruvananthapuram – 695014, Kerala. </p>

<p>More at http://rgcb.res.in/temporary-position-available-10/</p>
]]></description>
</item>

</channel>
</rss>