<?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/29683?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/29683?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14050/assistant-professor-in-bioinformatics-at-indian-institute-of-technology-delhi</guid>
  <pubDate>Fri, 15 Aug 2014 06:16:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Indian Institute of Technology Delhi]]></title>
  <description><![CDATA[
<p>Indian Institute of Technology Delhi Hauz Khas ,New Delhi – 110016</p>

<p>ROLLING ADVERTISEMENT NO. 01/2014(E-1)<br />ADVERTISEMENT FOR THE POSITIONS OF ASSISTANT PROFESSOR CANDIDATES CAN APPLY ANY TIME DURING THE YEAR.</p>

<p>IIT Delhi invites applications from qualified Indian Nationals, Persons of Indian Origin (PIOs) and Overseas Citizens of India (OCIs) for the following positions in the various Departments/Centres/Schools (in the fields<br />mentioned alongwith them):<br />Post Pay Band Assistant Professor and Assistant Professor (on Contract) Rs.15600-39100 (PB-3) (Minimum pay of Rs.30000/-)+ AGP Rs.8000/-</p>

<p>The following norms will be followed for fixing the basic pay + AGP for Assistant Professors appointed on<br />contract with Ph.D but experience of 3 years or less:-<br />Type Qualification &amp; Experience on the date of joining<br />Assistant Professor (Contract) PB3 (Rs. 15,600-39,100).</p>

<p>MINIMUM QUALIFICATIONS AND EXPERIENCE:<br />Ph.D. with First class at the preceding degree or equivalent in the appropriate branch with very good academic record throughout. A minimum of three years industrial/research/teaching experience, excluding however, the experience gained while Pursuing Ph. D. The candidates should preferably be below<br />35 years of age for male and 38 years for female ( to be relaxed by 5 years in case of persons with physical disability, SC/ST and 3 years in case of OBC-NCL).</p>

<p>Qualified persons include:<br />(a) Indian Nationals,<br />(b) Foreign Nationals who are “Persons of Indian Origin” (PIO) or Overseas<br />Citizens of India (OCI), in whose case, if selected, permission will be sought from Govt. of India<br />before he/she can join IIT Delhi, or<br />(c) Other Foreign Nationals, in whose case, if selected, appointment will be on a contract basis for up to 5 (five) years subject to permission from the Govt. of India before he/she can join IIT Delhi.<br />(d) Institute specifically encourages applicants from SC/ST/OBC category as well as persons<br />with disability to apply for these positions. </p>

<p>AMAR NATH &amp; SHASHI KHOSLA SCHOOL OF INFORMATION TECHNOLOGY:<br />Computational Neuroscience, Medical Applications of Information Technologies, Computational &amp; Systems Biology, Machine to Machine (M2M) Technologies, Embedded Systems &amp; Sensors, Computer Security.<br />KUSUMA SCHOOL OF BIOLOGICAL SCIENCES:<br />In-silico Biology Applications, Systems Biology, Infection Biology, Neurodegeneration. </p>

<p>More at http://www.iitd.ac.in/sites/default/files/jobs/faculty/spl-areas-rolling-advt.pdf</p>

<p>http://www.iitd.ac.in/content/faculty-positions</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</guid>
	<pubDate>Fri, 17 Oct 2014 02:16:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18384/big-genomic-data-on-google-cloud-platform</link>
	<title><![CDATA[Big genomic data on Google Cloud Platform]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/ExNxi_X4qug" frameborder="0" allowfullscreen></iframe>As the cost of DNA sequencing has dropped, the volume of data produced has risen into the petabytes. Google is working with the genomics community to define a standard API for working with big genomic data sets in the cloud. Building on Google Cloud Platform, we show how to store, process, explore and share genomic data using technologies like BigQuery, AppEngine MapReduce, R and more.]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18579/cluster-innovation-center-university-of-delhi</guid>
  <pubDate>Wed, 22 Oct 2014 10:39:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[CLUSTER INNOVATION CENTER @ UNIVERSITY OF DELHI]]></title>
  <description><![CDATA[
<p>Applications for Pre-selection of  candidates under ‘Institutions Mode’ for DST-ISPIRE Faculty in  Computational Biology/ Systems Biology/ Bioinformatics</p>

<p>Applications are invited for pre-selection  of candidates for Ministry of Science and Technology, Department of Science and Technology INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE in the area of computational Biology/Systems Biology/Bioinformatics.</p>

<p>Candidates having done their B.Tech/B.E.  and or M.Sc./M.Tech in Computer Science or Biotechnology and Ph.D. in Systems/ Computational Biology or Bioinformatics may apply in the following format prescribed by DST to the Director, Cluster Innovation Center, University Stadium, GC Narang Marg, University of Delhi, Delhi -11107. Detials of other qualification, age limits etc., please visit www.inspire-dst.gov.in.</p>

<p>Application on the prescribed format may be submitted by email to director@cic.du.ac.in before October 25, 2014. Selected candidates shall be called for an interview. The date, time and venue of the interview shall be informed by email/telephone. For more information about Cluster Innovation Center, please visit https://ducic.ac.in.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26993/lastz</guid>
	<pubDate>Mon, 18 Apr 2016 04:41:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26993/lastz</link>
	<title><![CDATA[LASTZ]]></title>
	<description><![CDATA[<p>LASTZ is a program for aligning DNA sequences, a pairwise aligner. Originally designed to handle sequences the size of human chromosomes and from different species, it is also useful for sequences produced by NGS sequencing technologies such as Roche 454.</p>
<p>More at http://www.bx.psu.edu/~rsharris/lastz/</p>
<p>Thesis: http://www.bx.psu.edu/~rsharris/rsharris_phd_thesis_2007.pdf</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~rsharris/lastz/" rel="nofollow">http://www.bx.psu.edu/~rsharris/lastz/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22393/narcis-fernandez-fuentes-lab</guid>
  <pubDate>Mon, 25 May 2015 07:30:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Narcis Fernandez-Fuentes Lab]]></title>
  <description><![CDATA[
<p>Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.</p>

<p>More at http://www.bioinsilico.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/25400/arraygen-next-generation-genome-browser-coming-soon</guid>
	<pubDate>Thu, 03 Dec 2015 05:52:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/25400/arraygen-next-generation-genome-browser-coming-soon</link>
	<title><![CDATA[ArrayGen Next Generation Genome Browser Coming Soon !!!]]></title>
	<description><![CDATA[<p>The ANG genome browser is a visualization tool, developed by ArrayGen Technologies. This is a fast and an efficient genome browser, built with Javafx and Java swing. ANG genome browser was built for latest next generation sequencing data analysis. It is platform independent and much simpler to use.</p><p>The main features are, it supports many standard file formats such as GFF, BED, GTF, FASTA, VCF, BAM and it can be integrated with other browsers or tools for analysis of genome.</p>]]></description>
	<dc:creator>ArrayGen Technologies</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26332/pilon</guid>
	<pubDate>Mon, 08 Feb 2016 15:56:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26332/pilon</link>
	<title><![CDATA[Pilon]]></title>
	<description><![CDATA[<p>Pilon is a software tool which can be used to:</p>
<ul>
<li>Automatically improve draft assemblies</li>
<li>Find variation among strains, including large event detection</li>
</ul>
<p>Pilon requires as input a FASTA file of the genome along with one or more BAM files of reads aligned to the input FASTA file. Pilon uses read alignment analysis to identify inconsistencies between the input genome and the evidence in the reads. It then attempts to make improvements to the input genome, including:</p>
<ul>
<li>Single base differences</li>
<li>Small indels</li>
<li>Larger indel or block substitution events</li>
<li>Gap filling</li>
<li>Identification of local misassemblies, including optional opening of new gaps</li>
</ul>
<p>More at https://github.com/broadinstitute/pilon/wiki</p><p>Address of the bookmark: <a href="https://github.com/broadinstitute/pilon/wiki" rel="nofollow">https://github.com/broadinstitute/pilon/wiki</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27046/desai-lab</guid>
  <pubDate>Thu, 21 Apr 2016 10:21:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Desai Lab]]></title>
  <description><![CDATA[
<p>Evolutionary Dynamics and Population Genetics</p>

<p>Natural selection and other evolutionary forces lead to particular patterns of evolutionary dynamics, and they leave characteristic signatures on the genetic variation within populations.  We use a combination of theory and experiments to study the dynamics and population genetics of natural selection in asexual populations such as microbes and viruses. </p>

<p>We use both theory and experiments to study evolutionary dynamics and population genetics, particularly in situations where natural selection is pervasive.</p>

<p>http://desailab.oeb.harvard.edu/home</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27331/andi</guid>
	<pubDate>Fri, 13 May 2016 05:16:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27331/andi</link>
	<title><![CDATA[Andi]]></title>
	<description><![CDATA[<p>This is the <code>andi</code> program for estimating the evolutionary distance between closely related genomes. These distances can be used to rapidly infer phylogenies for big sets of genomes. Because <code>andi</code> does not compute full alignments, it is so efficient that it scales even up to thousands of bacterial genomes.</p>
<p>This readme covers all necessary instructions for the impatient to get <code>andi</code> up and running. For extensive instructions please consult the <a href="https://github.com/EvolBioInf/andi/blob/master/andi-manual.pdf">manual</a>.</p>
<p>More at https://github.com/evolbioinf/andi/</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2015/01/13/bioinformatics.btu815.full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>