<?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/32631?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/32631?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26850/wellcome-trustdbt-india-alliance-margdarshi-fellowships-2016</guid>
  <pubDate>Tue, 29 Mar 2016 17:47:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Wellcome Trust/DBT India Alliance Margdarshi Fellowships 2016]]></title>
  <description><![CDATA[
<p>The Wellcome Trust/DBT India Alliance invites application for the Margdarshi Fellowship scheme. The scheme provides a unique opportunity for visionary biomedical scientists to lead and nucleate a cutting edge research program in India in collaboration with Indian Host Institution(s). The potential candidates and the Host Institution are encouraged to make a synergistic effort towards establishing a centre of excellence that aims to improve the existing scientific breadth and utilizes the experience of the lead applicant for developing new research platforms. In addition to this, under this programme two eligible Indian institutions may also come together towards creating a new program under the leadership of a visionary scientist.</p>

<p>Eligibility</p>

<p>Interested applicants must</p>

<p>Have around 10 years of experience as independent investigator, and can be of any age or nationality<br />Have Sponsor(s) at not-for-profit Host Institution(s) in India, who is willing to extend the desired commitment and resources for program implementation<br />Provisions</p>

<p>The 5 year Fellowship provides</p>

<p>Generous personal support for the Fellow<br />Salary support for personnel, which may include Assistant Professors<br />Large quantum of funds for equipment, animals and consumables<br />Funds to attend scientific gatherings, for collaborative visits and to organize meetings<br />Overheads for the Host Institution<br />Process</p>

<p>A joint online application is invited from the Applicant and the Sponsor(s). The details of the scheme and the funding mechanism are available on the website at http://wellcomedbt.org/fellowshiptype/margdarshi-fellowships.</p>

<p>Application form can be accessed at https://fellowships.wellcomedbt.org/Login.aspx</p>

<p>Sponsored applications due by 2 May 2016</p>

<p>Send your inquiries to margdarshi@wellcomedbt.org</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26927/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 06 Apr 2016 19:06:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26927/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>More at&nbsp;http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26915/phd-programme-in-computational-biology</guid>
  <pubDate>Wed, 06 Apr 2016 11:47:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[Ph.D. Programme in Computational Biology]]></title>
  <description><![CDATA[
<p>Ph.D. Programme in Computational Biology</p>

<p>For students interested in frontier research at the interface of biology, computation, physics and applied mathematics</p>

<p>IMSc is a leader in India in fundamental research in theoretical physics, mathematics and theoretical computer science, with several members actively pursuing research in interdisciplinary areas including computational biology.   In 2013 IMSc started a unique Ph.D. programme in this subject, training students to apply cutting-edge computational and mathematical techniques to problems in modern biology, in collaboration with leading biology departments and institutions in India and abroad.  <br />IMSc  is an autonomous national research institute under the Department of Atomic Energy, Government of India, and a constituent institution of the Homi Bhabha National Institute (HBNI), Mumbai (a deemed university).   Ph.D. degrees will be awarded by HBNI.<br />STRUCTURE OF PROGRAMME<br />Before embarking on their research, students have three semesters of coursework, which consists of seven core courses, to be carried out at IMSc; elective courses, which may be taken at IMSc or at other institutions by mutual consent; and lab rotations, at collaborating labs in other institutions. The core coursework covers essentials of modern biology, essential techniques from physics, mathematics, statistics and computer science, physics of proteins and biomolecules, biological sequence analysis and algorithms, and systems biology. Elective coursework covers various topics in greater depth. Following the coursework and a comprehensive examination, students will embark on research leading to a Ph.D. degree.<br />Selected candidates will be research fellows at IMSc and will receive fellowships, housing or house rent allowance, and contingency grants.</p>

<p>More at http://www.imsc.res.in/graduate_programme_0</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26955/jrf-bioinformatics-at-nipgr</guid>
  <pubDate>Thu, 14 Apr 2016 13:12:42 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at NIPGR]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics job position in National Institute of Plant Genome Research (NIPGR)</p>

<p>Title : “Short-Term Research Fellowship”</p>

<p>Qualification : Candidates having M.Sc./M.Tech degree (with minimum of 60% marks overall) or equivalent in Bioinformatics/Biotechnology or any other related field, are eligible to apply. Candidate having prior experience in the area of next-generation sequencing data analysis, bioinformatics, molecular analysis of plant genes, and structural data analysis will be preferred.</p>

<p>No.of Post : 01<br />How to apply</p>

<p>Application should sent to Dr. Gitanjali Yadav, Staff Scientist-IV, National Institute of Plant Genome Research (NIPGR), Aruna Asaf Ali Marg, P.O. Box NO. 10531, New Delhi - 110067 on or before 26th April 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/26999/discovar</guid>
	<pubDate>Mon, 18 Apr 2016 11:59:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26999/discovar</link>
	<title><![CDATA[DISCOVAR]]></title>
	<description><![CDATA[<p><strong>DISCOVAR</strong> is a new variant caller and <strong>DISCOVAR <em>de novo</em></strong> a new genome assembler, both designed for state-of-the-art data. Their inputs are chosen to optimize quality while keeping costs low. Currently it takes as input Illumina reads of length 250 or longer &mdash; produced on MiSeq or HiSeq 2500 &mdash; and from a single PCR-free library. These data enable a level of completeness and continuity that was not previously possible.</p>
<p><strong>DISCOVAR</strong> can call variants on a region by region basis, potentially tiling an entire large genome. DISCOVAR variant calling is under active development and transitioning to VCF.</p>
<p><strong>DISCOVAR <em>de novo</em></strong> can generate <em>de novo</em> assemblies for both large and small genomes. It currently does not call variants.</p>
<p>More at https://www.broadinstitute.org/software/discovar/blog/?page_id=14</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/discovar/blog/" rel="nofollow">https://www.broadinstitute.org/software/discovar/blog/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/31523/research-associate-bioinformatics-recruitment-in-national-bureau-of-plant-genetic-resources</guid>
  <pubDate>Fri, 10 Mar 2017 06:50:51 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics recruitment in National Bureau of Plant Genetic Resources]]></title>
  <description><![CDATA[
<p>Name of Project  : Indo-UK Centre for improvement of Nitrogen use efficiency in wheat Dr. Soma S. Marla, Pr. Scientist (Bioinformatics), Division of Genomic Resources, ICAR, NBPGR, ND. </p>

<p>No. of Post : 01</p>

<p>Qualification : A doctoral (Ph.D). Degree in Bioinformatics OR 1. Masters degree in Bioinformatics or Computer Sciences having 1st division or 60% marks or equivalent overall grade point with at least two years of research experience as evidenced from Fellowship/ Associate ship. 2. NET or equivalent national level examination qualification is essential for the candidates with 3+2 years (B.Sc.+ M.Sc) pattern. Desirable: Demonstrated experience &amp; skills in database design, management, UNIX OS, HPC environment inbased NGS data analysis. Experience substantiated by publications of high quality will be preferred.</p>

<p>Emoluments : Rs. 40,000 (Ph.D)/ Rs + 30 % HRA; 38,000 (Masters) Degree + 30 % HRA.<br />Hiring Process : Walk - In<br />Job Role: Research/JRF/SRF</p>

<p>Candidates should appear by 10.00 AM on 16.03.2016 for registration with relevant documents in the room B4, Bioinformatics Lab, ICAR.NBPGR. old campus, Inderpuri, New Delhi.</p>

<p>The candidates who wish to attend the walk-in interview are requested to bring with them five copies of the CV (one copy with photograph) as per the format given below. Also, the candidates should bring the original documents such as DOB, degree certificates, marks sheets, publications, thesis, experience certificate etc. for verification.</p>

<p>http://www.nbpgr.ernet.in/Downloadfile.aspx?EntryId=7284</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</guid>
	<pubDate>Tue, 26 Apr 2016 12:18:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</link>
	<title><![CDATA[Smash: An alignment-free method to find and visualise rearrangements between pairs of DNA sequences]]></title>
	<description><![CDATA[<p><strong>Smash is a completely alignment-free method/tool to find and visualise genomic rearrangements</strong><span>. The detection is based on&nbsp;</span><strong>conditional exclusive compression</strong><span>, namely using a FCM (Markov model), of high context order (typically 20). For visualisation, Smash outputs a&nbsp;</span><strong>SVG image</strong><span>, with an&nbsp;</span><strong>ideogram</strong><span>output architecture, where the patterns are represented with several&nbsp;</span><strong>HSV values</strong><span>&nbsp;(only value varies). The method can perform both in small- and large-scale. Nevertheless is more directed to large-scale since that the main aim of the research is to&nbsp;</span><strong>know where the large-scale [chromosomal by chromosome] of several primates was equal/different, having at a glance a map of the entire genomes</strong><span>.</span></p><p>Address of the bookmark: <a href="http://bioinformatics.ua.pt/software/smash/" rel="nofollow">http://bioinformatics.ua.pt/software/smash/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</guid>
	<pubDate>Tue, 03 May 2016 05:31:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</link>
	<title><![CDATA[Painless package development for R]]></title>
	<description><![CDATA[<p>Devtools makes package development a breeze: it works with R&rsquo;s existing conventions for code structure, adding efficient tools to support the cycle of package development. With devtools, developing a package becomes so easy that it will be your default layout whenever you&rsquo;re writing a significant amount of code.</p>
<p>Before you get started be sure to check out:</p>
<ul>
<li><a href="https://groups.google.com/forum/#%21forum/rdevtools" title="Google devtools Group">devtools Google Group &ndash;&nbsp;https://groups.google.com/forum/#!forum/rdevtools</a></li>
<li><a href="http://adv-r.had.co.nz/" title="Hadley W Online Book">book on &ldquo;Advanced R programming&rdquo; &ndash;&nbsp;http://adv-r.had.co.nz/</a></li>
<li><a href="https://github.com/hadley/devtools" title="devtools GitHub">GitHub repository &ndash;&nbsp;https://github.com/hadley/devtools</a></li>
</ul>
<h3 id="getting_started">&nbsp;</h3><p>Address of the bookmark: <a href="https://www.rstudio.com/products/rpackages/devtools/" rel="nofollow">https://www.rstudio.com/products/rpackages/devtools/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>