<?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/26363?offset=440</link>
	<atom:link href="https://bioinformaticsonline.com/related/26363?offset=440" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28618/jrf-bioinformatics-at-dpu-india</guid>
  <pubDate>Fri, 05 Aug 2016 03:06:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at DPU, India]]></title>
  <description><![CDATA[
<p>Advertisement for position of “JRF (Junior Research Fellow)” on DST research project “Molecular modeling and docking studies on Deguelin and its derivatives with cell cycle arrest, apoptosis and anti-angiogenesis pathway proteins in cancer cell signaling pathway”</p>

<p>Applications are invited on plain paper from eligible candidates along with biodata and copies of certificates in support of age, qualification and experience for the following position:</p>

<p>Particulars Description</p>

<p>1. Position &amp; No. JRF (Junior Research Fellow) 01</p>

<p>2. Title of the Project Molecular modeling and docking studies on Deguelin and its derivatives with cell cycle arrest, apoptosis and anti-angiogenesis pathway proteins in cancer cell signaling pathway</p>

<p>3. Tenure 3 years</p>

<p>4. Investigator Dr. K. V.Swamy</p>

<p>5. Institute Dr. D. Y. Patil Biotechnology and Bioinformatics Institute, Tathawade, Pune 411033.</p>

<p>5. Qualifications/Eligibility</p>

<p>Essential: NET (National Eligibility Test) qualified M. Sc Bioinformatics/ M. Tech Bioinformatics/M. Sc Biotechnology/M. Tech Biotechnology or Graduate degree in Professional course with NET qualification or Post graduation degree in professional course</p>

<p>The following examinations conducted by various Central Government Departments/Agencies are considered as National Eligibility Test (NET).</p>

<p>1. CSIR-UGC-LS <br />2. GATE (Graduate Aptitude Test in Engineering) <br />3. JAM (Joint Admission Test) <br />4. GPAT (Graduate Pharmacy Aptitude Test) <br />5. BET(Biotechnology Eligibility Test) <br />6. BINC(Bioinformatics National Consortium) <br />7. JEST( Joint Entrance Screening Test) <br />8. JGEEBILS(Joint Graduate Entrance Examination for Biology &amp; Interdisciplinary Life Sciences) <br />9. NBHM Ph.D scholarship Screening Test <br />10. ICMR- JRF Entrance Examination <br />11. AICE (ICAR-All India competitive Examination ) <br />(For all above examinations valid score considered at the time of interview)</p>

<p>Desirable: Knowledge and skills in Bioinformatics tools/ softwares</p>

<p>6. Monthly Emoluments Rs.25,000/ (As per DST-SERB rules)</p>

<p>7. Last date for submission of prescribed application 20/08/2016</p>

<p>Kindly send your applications to “Dr. K. V. Swamy, Asst.Professor, Dr. D. Y. Patil Biotechnology &amp; Bioinformatics Institute, Survey No. 87/88, Mumbai-Pune Express Way, Tathawade, Pune - 411033, Maharashtra, India”. Highlight the envelope with “Application for post of JRF (Junior Research Fellow)”.</p>

<p>Note: No TA/DA will be paid for attending the interview.</p>

<p>Advertisement: http://careers.dpu.edu.in/Biotech.aspx</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42490/bioinformatics-scientist-%E2%80%93-icmr-computational-genomics-centre</guid>
  <pubDate>Sat, 26 Dec 2020 10:18:29 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist – ICMR Computational Genomics Centre]]></title>
  <description><![CDATA[
<p>ICMR invites online applications, from Indian Citizens, up to 8th January 2020 till 5:30 PM to fill up the following post to be filled purely on a temporary basis under “ICMR Computational Genomics Centre” under Dr. Harpreet Singh, Head, Division of Biomedical Informatics (BMI), ICMR HQRS, New Delhi 110029.<br />The Terms &amp; Conditions for the post are as follows:</p>

<p>a) Scientist-B – UR (2 posts-Bioinformatics) on consolidated salary of Rs.48,000/- pm + HRA</p>

<p>b) Scientist C – UR (1 post -Bioinformatics) on consolidated salary of Rs. 51,000 pm+ HRA</p>

<p>c) Scientist B- UR (2 post-Statistics) on a consolidated salary of Rs.48,000/- pm +HRA</p>

<p>d) Computer Programmer 1 post UR &amp; 1 post SC on a consolidated salary of Rs. 32,500/- pm</p>

<p>e) Research Assistant -UR 1 post on a consolidated salary of Rs. 31,000/- pm</p>

<p>More at https://projectjobs.icmr.org.in/sccbioinformatics/uploads/recruitment/Adv_BMI_24122020.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29235/valet</guid>
	<pubDate>Thu, 22 Sep 2016 04:27:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29235/valet</link>
	<title><![CDATA[valet]]></title>
	<description><![CDATA[<div>
<div>
<div>VALET is a pipeline for performing&nbsp;<em>de novo</em>&nbsp;validation of metagenomic assemblies. VALET checks a number of properties that should hold true for a correct assembly (e.g., mate-pairs are aligned at the correct distance from each other in the assembly, the depth of coverage is fairly uniform along contigs, etc.). The violations of these invariants are reported allowing one to pinpoint areas that were potentially mis-assembled, or to compare the quality of different assemblies. For comparing multiple assemblies of the same data-sets, VALET also reports an overall estimate of the likelihood a particular assembly is correct.</div>
</div>
</div>
<div>
<div>Home Page:&nbsp;</div>
<div>
<div><a href="https://github.com/jgluck/VALET">VALET code repository</a></div>
</div>
</div><p>Address of the bookmark: <a href="https://www.cbcb.umd.edu/software/valet" rel="nofollow">https://www.cbcb.umd.edu/software/valet</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</guid>
	<pubDate>Thu, 18 Aug 2016 09:57:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</link>
	<title><![CDATA[RepeatModeler]]></title>
	<description><![CDATA[<p><span>RepeatModeler is a de-novo repeat family identification and modeling package. At the heart of RepeatModeler are two de-novo repeat finding programs ( RECON and RepeatScout ) which employ complementary computational methods for identifying repeat element boundaries and family relationships from sequence data. RepeatModeler assists in automating the runs of RECON and RepeatScout given a genomic database and uses the output to build, refine and classify consensus models of putative interspersed repeats.</span></p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RepeatModeler.html" rel="nofollow">http://www.repeatmasker.org/RepeatModeler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29208/srf-bioinformatics-job-position-in-national-institute-of-plant-genome-research-nipgr</guid>
  <pubDate>Mon, 19 Sep 2016 05:43:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics job position in National Institute of Plant Genome Research (NIPGR)]]></title>
  <description><![CDATA[
<p>SRF Bioinformatics job position in National Institute of Plant Genome Research (NIPGR)<br />Title : “Transcriptome and small RNA diversity analysis of developing seed contrasting rice varieties” <br />Qualification : Candidates having M.Sc./M.Tech. degree or equivalent (with minimum 60% marks) in Bioinformatics with a minimum of two years of post M.Sc./M.Tech research experience are eligible to apply.<br />No. of Post : 01<br />How to apply<br />Application should reach to Dr. Pinky Agarwal, Staff Scientist, National Institute of Plant Genome Research (NIPGR) Aruna Asaf Ali Marg, P.O. Box NO. 10531, New Delhi - 110067 on or before 30/09/2016</p>

<p>More at http://www.nipgr.res.in/careers/vacancies_latest.php#</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</guid>
	<pubDate>Fri, 26 Aug 2016 06:00:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</link>
	<title><![CDATA[GeneValidator - Identify problems with predicted genes]]></title>
	<description><![CDATA[<p>GeneValidator helps in identifing problems with gene predictions and provide useful information extracted from analysing orthologs in BLAST databases. The results produced can be used by biocurators and researchers who need accurate gene predictions.</p>
<p>If you would like to use GeneValidator on a few sequences, see our online&nbsp;<a href="http://genevalidator.sbcs.qmul.ac.uk/">GeneValidator Web App</a>&nbsp;-<a href="http://genevalidator.sbcs.qmul.ac.uk/">http://genevalidator.sbcs.qmul.ac.uk</a>.</p>
<p>If you use GeneValidator in your work, please cite us as follows:</p>
<blockquote>
<p><a href="http://bioinformatics.oxfordjournals.org/content/early/2016/02/26/bioinformatics.btw015">Dragan M<span>&Dagger;</span>, Moghul MI<span>&Dagger;</span>, Priyam A, Bustos C &amp; Wurm Y. 2016. GeneValidator: identify problems with protein-coding gene predictions.&nbsp;<em>Bioinformatics</em>, doi: 10.1093/bioinformatics/btw015</a>.</p>
<p>&nbsp;</p>
</blockquote>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/wurmlab/genevalidator" rel="nofollow">https://github.com/wurmlab/genevalidator</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28926/scientist-at-advanced-centre-for-treatment-research-and-education-in-cancer-navi-mumbai-maharashtra</guid>
  <pubDate>Tue, 30 Aug 2016 04:16:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Scientist at Advanced Centre for Treatment, Research and Education in Cancer - Navi Mumbai, Maharashtra]]></title>
  <description><![CDATA[
<p>Scientist <br />Advanced Centre for Treatment, Research and Education in Cancer - Navi Mumbai, Maharashtra<br />Scientist (One position) <br />Project: Bioinformatics centre DBT- Sub-DIC at ACTREC <br />Funding agency: DBT Grant No.232 </p>

<p>Duration of the Project: Six Months from the date of appointment can be extended further for six months <br />Essential Qualification and Experience: 1st Class Masters Degree in Bioinformatics or Life Sciences equivalent degree from a recognized University with 4 years R&amp;D experience in Bioinformatics or relevant subjects from recognized institutes. <br />OR <br />Ph.D. degree in Bioinformatics or Life Sciences from recognized University. <br />M.Sc. degree obtained after a one year course will not be considered. <br />Experience: Research/teaching experience in Bioinformatics or relevant subjects form recognized Institute(s). </p>

<p>More at http://www.actrec.gov.in/data%20files/Vacancies/2016/AV-scin-stud-trainee-6-Sept-16.docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</guid>
	<pubDate>Thu, 01 Sep 2016 11:47:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</link>
	<title><![CDATA[R-chie]]></title>
	<description><![CDATA[<p><strong>R-chie</strong><span>&nbsp;allows you to make arc diagrams of RNA secondary structures, allowing for easy comparison and overlap of two structures, rank and display basepairs in colour and to also visualize corresponding multiple sequence alignments and co-variation information.</span><br><strong>R4RNA</strong><span>&nbsp;is the R package powering R-chie, available for&nbsp;</span><a href="http://www.e-rna.org/r-chie/download.cgi">download</a><span>&nbsp;and local use for more customized figures and scripting.</span></p>
<p>http://www.e-rna.org/r-chie/plot.cgi?eg=single</p><p>Address of the bookmark: <a href="http://www.e-rna.org/r-chie/plot.cgi?eg=single" rel="nofollow">http://www.e-rna.org/r-chie/plot.cgi?eg=single</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:12:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</link>
	<title><![CDATA[Assembly tutorial PPT]]></title>
	<description><![CDATA[<p>Saved Cornell University assembly workshop PPT.</p><p>Reference:&nbsp;</p><p>http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29108" length="1617402" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</guid>
	<pubDate>Fri, 09 Sep 2016 05:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</link>
	<title><![CDATA[OPERA : Optimal Paired-End Read Assembler]]></title>
	<description><![CDATA[<p>OPERA (Optimal Paired-End Read Assembler) is a sequence assembly program (<a href="http://en.wikipedia.org/wiki/Sequence_assembly">http://en.wikipedia.org/wiki/Sequence_assembly</a>). It uses information from paired-end/mate-pair/long reads to order and orient the intermediate contigs/scaffolds assembled in a genome assembly project, in a process known as Scaffolding. OPERA is based on an exact algorithm that is guaranteed to minimize the discordance of scaffolds with the information provided by the paired-end/mate-pair/long reads (for further details see Gao et al, 2011).</p>
<p>Note that since the original publication, we have made significant changes to OPERA (v1.0 onwards) including refinements to its basic algorithm (to reduce local errors, improve efficiency etc.) and incorporated features that are important for scaffolding large genomes (multi-library support, better repeat-handling etc.), in addition to other scalability and usability improvements (bam and gzip support, smaller memory footprint). We therefore encourage you to download and use our latest version: OPERA-LG. In our benchmarks, it has significantly improved corrected N50 and reduced the number of scaffolding errors. Furthermore, our latest release contains the wrapper script OPERA-long-read that enables scaffolding with long-reads from third-generation sequencing technologies (PacBio or Oxford Nanopore). The manuscript describing the new features and algorithms is available at&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y">Genome Biology</a>. We look forward to getting your feedback to improve it further.</p><p>Address of the bookmark: <a href="https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/" rel="nofollow">https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>