<?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/27076?offset=1100</link>
	<atom:link href="https://bioinformaticsonline.com/related/27076?offset=1100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/32227/postdoctoral-research-position-in-bioinformatics-in-milan</guid>
  <pubDate>Thu, 20 Apr 2017 12:53:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Research Position in Bioinformatics in Milan]]></title>
  <description><![CDATA[
<p>The lab of Immunobiology of Neurological Disorders has a main interest in the biological processes associated with multiple sclerosis, an inflammatory disorder of the central nervous system. The projects of interest for this application involve research on translational bioinformatics in complex human neurological disorders.</p>

<p>You have a  PhD in Computational Science, Bioinformatics,  or equivalent, and expertise in analysis and modeling of human RNA-seq data, statistics, data mining and machine learning. Excellent communication skills in English (written and oral) is a must. Flexibility and willingness to work across multiple projects and technologies in a rapidly evolving scientific context is required.<br />Salary will depend on qualification and experience. Starting date: immediate.</p>

<p>Interested candidates should send to farina.cinthia@hsr.it:</p>

<p>1. CV (please show evidences of relevant titles, projects, courses, references, etc.)           <br />2. One page with a list of research topics (i.e. ongoing projects)     <br />3. earliest availability</p>

<p>4. 2-3 contact names</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/31258/bioinformatics-walk-in-interview-at-tezpur-university</guid>
  <pubDate>Thu, 02 Mar 2017 04:24:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics walk-in-interview at Tezpur University]]></title>
  <description><![CDATA[
<p>A walk-in-interview will be held on 09 March, 2017, 11.15 a.m. at the office of the Head, Department of Computer Science and Engineering, Tezpur University for one (01) temporary position of Junior Research Fellow (JRF) in the DBT, Govt. of India sponsored project entitled “Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics” under Dr. Siddhartha Sankar Satapathy (ssankar@tezu.ernet.in), Associate Professor, Department of Computer Science and Engineering, Tezpur University.<br /> <br />Interested candidates may appear before the interview board with original documents from 10th standard onwards and photocopies of mark sheets, certificates, testimonials, caste certificate (if applicable), experience certificate certificates of NET/GATE/BET or similar examination qualifications, any other testimonials and a copy of recent curriculum vitae (CV) on the day of interview.<br /> <br />Essential qualification: M.Tech. in CSE/IT (With specialization in Computational Biology/Bioinformatics) or M.Sc. in Bioinformatics/Biosciences/Molecular Biology Biotechnology preferably with NET/GATE/BET.<br /> <br />Candidates should have minimum 55 % mark both in 10th and 10+2 Science examinations and mathematics at 10+2 Science.<br /> <br />Desirable: Preference will be given to the candidates having experience in computational analysis of genome sequences or similar projects.<br /> <br />Remuneration: Rs. 25,000/- (Rupees twenty five thousand) only + HRA as admissible per month for the 1st two years and Rs. 28,000/- (Rupees twenty eight thousand) only + HRA as admissible per month for the 3rd year for SRF and applicable to the candidate having post graduate degree in Basic Science with NET/GATE/BET qualification or post graduate degree in professional course. Rs. 12,000/- (Rupees twelve thousand) only + HRA as admissible per month for the 1st two years and Rs. 14,000/- (Rupees fourteen thousand) only + HRA as admissible per month for the 3 rd year for SRF, for the candidate without NET/GATE/BET qualification. HRA will not be provided if campus accommodation is availed.<br /> <br />Age: Candidate shall not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/ OBC/Women/Differently abled.<br /> <br />Duration: Three (03) years or till completion of the project or until further order, whichever is earlier.<br /> <br />N.B. No TA/DA will be paid to the candidates for attending the interview. For further details please contact: Dr. S. S. Satapathy Associate Professor Department of Computer Science and Engineering Tezpur University, Napaam-784028 Email: ssankar@tezu.ernet.in Contact no.: +91-9435979648<br /> <br />More Info:  www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-SSS-20-295-188-A.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</guid>
	<pubDate>Sun, 26 Mar 2017 15:41:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31881/gbtools-interactive-visualization-of-metagenome-bins-in-r</link>
	<title><![CDATA[gbtools: Interactive Visualization of Metagenome Bins in R]]></title>
	<description><![CDATA[<p><span>We have developed gbtools, a software package that allows users to visualize metagenomic assemblies by plotting coverage (sequencing depth) and GC values of contigs, and also to annotate the plots with taxonomic information. Different sets of annotations, including taxonomic assignments from conserved marker genes or SSU rRNA genes, can be imported simultaneously; users can choose which annotations to plot. Bins can be manually defined from plots, or be imported from third-party binning tools and overlaid onto plots, such that results from different methods can be compared side-by-side. gbtools reports summary statistics of bins including marker gene completeness, and allows the user to add or subtract bins with each other.&nbsp;</span></p>
<p><span>Tool at&nbsp;https://github.com/kbseah/genome-bin-tools</span></p><p>Address of the bookmark: <a href="http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full" rel="nofollow">http://journal.frontiersin.org/article/10.3389/fmicb.2015.01451/full</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32048/json</guid>
	<pubDate>Tue, 04 Apr 2017 08:02:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32048/json</link>
	<title><![CDATA[JSON]]></title>
	<description><![CDATA[<p><strong>JSON</strong>&nbsp;(JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the&nbsp;<a href="http://javascript.crockford.com/">JavaScript Programming Language</a>,&nbsp;<a href="http://www.ecma-international.org/publications/files/ecma-st/ECMA-262.pdf">Standard ECMA-262 3rd Edition - December 1999</a>. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.</p>
<p>JSON is built on two structures:</p>
<ul>
<li>A collection of name/value pairs. In various languages, this is realized as an&nbsp;<em>object</em>, record, struct, dictionary, hash table, keyed list, or associative array.</li>
<li>An ordered list of values. In most languages, this is realized as an&nbsp;<em>array</em>, vector, list, or sequence.</li>
</ul>
<p>These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.</p><p>Address of the bookmark: <a href="http://json.org/" rel="nofollow">http://json.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32152/upsetr-shiny-app</guid>
	<pubDate>Fri, 14 Apr 2017 06:19:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32152/upsetr-shiny-app</link>
	<title><![CDATA[UpSetR Shiny App!]]></title>
	<description><![CDATA[<p>UpSetR generates static&nbsp;<a href="http://vcg.github.io/upset/?dataset=0&amp;duration=1000&amp;orderBy=subsetSize&amp;grouping=groupByIntersectionSize&amp;selection=">UpSet plots</a>. The UpSet technique visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes.</p>
<h4>To begin, input your data using one of the three input styles.</h4>
<ol>
<li>"File" takes a correctly formatted.csv file.</li>
<li>"List" takes up to 6 different lists that contain unique elements, similar to that used in the web applications BioVenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2164-9-488.pdf">(Hulsen et al., 2008)</a>&nbsp;and jvenn&nbsp;<a href="http://www.biomedcentral.com/content/pdf/1471-2105-15-293.pdf">(Bardou et al., 2014)</a></li>
<li>"Expression" takes the input used by the venneuler R package&nbsp;<a href="https://cran.r-project.org/web/packages/venneuler/venneuler.pdf">(Wilkinson, 2015)</a></li>
</ol><p>Address of the bookmark: <a href="https://gehlenborglab.shinyapps.io/upsetr/" rel="nofollow">https://gehlenborglab.shinyapps.io/upsetr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/32374/ra-bioinformatics-at-jnu-new-delhi-india</guid>
  <pubDate>Thu, 27 Apr 2017 03:29:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at JNU, New Delhi, INDIA]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi-110067, INDIA</p>

<p>Date: April 24th. 2017	Last Date: May 6th 2017<br />PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project jointly running with IIIT-Hyderabad &amp; JNU, entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh, School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067.<br />NB: For all the posts, preference will be given to candidates with a good knowledge of Python and/or R in UNIX platform , knowledge of JAVA will also get a special consideration.</p>

<p>1.	RA / Research Associate (Metabolic engineering/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA</p>

<p>Vacancy: 1</p>

<p>Essential Qualifications: PhD in Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/Analysis of Network Biology/Chemoinformatics/Computational Biology related Software development. Published paper in the field is a must to prove the experience. Special consideration will be given if have experience in Industry, teaching &amp; product development.</p>

<p>Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , collaborating with industry , preparing and filing reports etc. Will be expected to communicate with user groups and coordinate with LIMS group in Hyderabad and the Cheminformatics group in Delhi.</p>

<p>2.	Project SRF (Network model building/Systems biology integration)</p>

<p>Salary*: Rs.18000/- + HRA</p>

<p>Vacancy: 1</p>

<p>Essential Qualifications: M.Tech in Computational Biology with project experience or Masters / B.Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Mathematical Model building using Computational Biology tools &amp; related Database / Network analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal whereas for M.Tech, the degree obtained in computational biology is a must.</p>

<p>Desired Skills: Will be expected to manage ongoing research activities in LIMS, interact with LIMS group, build network model using data compiled by experimentalist, prepare and file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32948/simba-a-web-tool-for-managing-bacterial-genome-assembly-generated-by-ion-pgm-sequencing-technology</guid>
	<pubDate>Tue, 23 May 2017 05:28:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32948/simba-a-web-tool-for-managing-bacterial-genome-assembly-generated-by-ion-pgm-sequencing-technology</link>
	<title><![CDATA[SIMBA: a web tool for managing bacterial genome assembly generated by Ion PGM sequencing technology]]></title>
	<description><![CDATA[<p><span>SIMBA</span><span>, SImple Manager for Bacterial Assemblies, is a Web interface for managing assembly projects of bacterial genomes. SIMBA was created to assist bioinformaticians to assemble bacterial genomes sequenced with NextGeneration Sequencing (NGS) platforms quickly, easily and effectively. SIMBA also is open source tool, i.e., can be freely downloaded, shared and modified.</span></p>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1344-7</p><p>Address of the bookmark: <a href="http://ufmg-simba.sourceforge.net/" rel="nofollow">http://ufmg-simba.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</guid>
	<pubDate>Fri, 05 May 2017 05:58:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</link>
	<title><![CDATA[CLA: Contig-Layout-Authenticator]]></title>
	<description><![CDATA[<p><span>To improve upon the shortcomings associated with the construction of draft genomes with Illumina paired-end sequencing, we developed Contig-Layout-Authenticator (CLA). The CLA pipeline can scaffold reference-sorted contigs based on paired reads, resulting in better assembled genomes. Moreover, CLA also hints at probable misassemblies and contaminations, for the users to cross-check before constructing the consensus draft. The CLA pipeline was designed and trained extensively on various bacterial genome datasets for the ordering and scaffolding of large repetitive contigs. The tool has been validated and compared favorably with other widely-used scaffolding and ordering tools using both simulated and real sequence datasets. CLA is a user friendly tool that requires a single command line input to generate ordered scaffolds.</span></p>
<p><span>Script&nbsp;https://sourceforge.net/projects/c-l-authenticator/files/</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32631/barrnap-bacterial-ribosomal-rna-predictor</guid>
	<pubDate>Fri, 12 May 2017 09:24:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32631/barrnap-bacterial-ribosomal-rna-predictor</link>
	<title><![CDATA[Barrnap: Bacterial ribosomal RNA predictor]]></title>
	<description><![CDATA[<p>Barrnap predicts the location of ribosomal RNA genes in genomes. It supports bacteria (5S,23S,16S), archaea (5S,5.8S,23S,16S), mitochondria (12S,16S) and eukaryotes (5S,5.8S,28S,18S).</p>
<p>It takes FASTA DNA sequence as input, and write GFF3 as output. It uses the new NHMMER tool that comes with HMMER 3.1 for HMM searching in RNA:DNA style. NHMMER binaries for 64-bit Linux and Mac OS X are included and will be auto-detected. Multithreading is supported and one can expect roughly linear speed-ups with more CPUs.&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/tseemann/barrnap" rel="nofollow">https://github.com/tseemann/barrnap</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>