<?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/26906?offset=1360</link>
	<atom:link href="https://bioinformaticsonline.com/related/26906?offset=1360" 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/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28802/research-associate-bioinformatics-recruitment-in-icgeb-new-delhi</guid>
  <pubDate>Tue, 16 Aug 2016 03:38:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics recruitment in ICGEB, New Delhi]]></title>
  <description><![CDATA[
<p>Research Associate Bioinformatics recruitment in ICGEB, New Delhi </p>

<p>Project :“Genetic Transformation and Development of Elite Transgenic Maize (Zea mays L.) for Biotic and Abiotic Stresses Tolerance”.</p>

<p>Qualification: Ph.D. degree in:Biotechnology/Bioinformatics/Biochemistry/Plant Molecular Biology/Plant Physiology/Botany or any related area with evidence of prior experience in maize transformation.</p>

<p>Additional experience in plant transformation of any cereal crop would be preferable.</p>

<p>The appointment would initially be for one year.</p>

<p>How to apply<br />Interested applicants should send their detailed CV including brief synopsis regarding the previous research experience (along withcontact email address by email) to: Dr. Tanushri Kaul (tanushri@icgeb.res.in). Group Leader, Nutritional Improvement of Crops Group, International Centre for Genetic Engineering and Biotechnology, Aruna Asaf Ali Marg, New Delhi-110 067.</p>

<p>Closing date for applications: 22 August 2016.</p>

<p>More at http://www.icgeb.org/vacancies.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28851/senior-manager-bioinformatics-operations-at-rgcb-india</guid>
  <pubDate>Fri, 19 Aug 2016 04:37:17 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Manager (Bioinformatics Operations) at RGCB, India]]></title>
  <description><![CDATA[
<p>Senior Manager (Bioinformatics Operations) <br />Rajiv Gandhi Centre for Biotechnology (RGCB) - Thiruvananthapuram, Kerala <br />₹15,600 - ₹39,100 a month<br />Rajiv Gandhi Centre for Biotechnology (RGCB) invites applications for the following positions from Indian citizens with prescribed qualifications </p>

<p>Senior Manager (Bioinformatics Operations) <br />No. of posts: 01 (General) <br />Pay Scale: PB-3 15600-39100 + Grade Pay Rs.6600/- <br />Min. Qualification: PhD in Bioinformatics, , Life Sciences or Computer Science applied to biological questions. <br />A Min. 5 years of experience <br />Age limit: 40 years as on August 01, 2016</p>

<p>More at http://www.rgcb.res.in/positions.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</guid>
	<pubDate>Wed, 20 Jun 2018 02:45:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</link>
	<title><![CDATA[SWALO: Scaffolding with assembly likelihood optimization]]></title>
	<description><![CDATA[SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.<p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</guid>
	<pubDate>Fri, 20 Jul 2018 10:03:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37396/converting-a-vcf-into-a-fasta-given-some-reference</link>
	<title><![CDATA[Converting a VCF into a FASTA given some reference !]]></title>
	<description><![CDATA[<p>Samtools/BCFtools (Heng Li) provides a Perl script&nbsp;<a href="https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl"><code>vcfutils.pl</code></a>&nbsp;which does this, the function&nbsp;<code>vcf2fq</code>&nbsp;(lines 469-528)</p><p>This script has been modified by others to convert InDels as well, e.g.&nbsp;<a href="https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl">this</a>&nbsp;by David Eccles</p><pre><code><span>./</span><span>vcf2fq</span><span>.</span><span>pl </span><span>-</span><span>f </span><span>&lt;</span><span>input</span><span>.</span><span>fasta</span><span>&gt;</span><span> </span><span>&lt;</span><span>all</span><span>-</span><span>site</span><span>.</span><span>vcf</span><span>&gt;</span><span> </span><span>&gt;</span><span> </span><span>&lt;</span><span>output</span><span>.</span><span>fastq</span><span>&gt;</span></code></pre><p>https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl</p><p>https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</guid>
	<pubDate>Wed, 14 Nov 2018 04:45:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</link>
	<title><![CDATA[SKESA: strategic k-mer extension for scrupulous assemblies]]></title>
	<description><![CDATA[<p><span>SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit shows that SKESA produces assemblies that have high sequence quality and contiguity, handles low-level contamination in reads, is fast, and produces an identical assembly for the same input when assembled multiple times with the same or different compute resources. </span></p>
<p><span>Source code for SKESA is freely available at&nbsp;</span><span><a href="https://github.com/ncbi/SKESA/releases"><span>https://github.com/ncbi/SKESA/releases</span></a></span><span>.</span></p>
<p>Research Paper&nbsp;@ <a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-018-1540-z">Link</a></p>
<p><span><span>SKESA algorithm are as follows:</span><br></span></p>
<p><span><img src="https://media.springernature.com/lw785/springer-static/image/art%3A10.1186%2Fs13059-018-1540-z/MediaObjects/13059_2018_1540_Fig4_HTML.png" alt="image" width="785" height="984" style="border: 0px; border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/ncbi/SKESA/releases" rel="nofollow">https://github.com/ncbi/SKESA/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>