<?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/34916?offset=420</link>
	<atom:link href="https://bioinformaticsonline.com/related/34916?offset=420" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5947/jrf-national-jalma-institute-of-leprosy-and-other-mycobacterial-diseases</guid>
  <pubDate>Mon, 28 Oct 2013 10:42:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF @ NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES]]></title>
  <description><![CDATA[
<p>NATIONAL JALMA INSTITUTE OF LEPROSY AND OTHER MYCOBACTERIAL DISEASES</p>

<p>(INDIAN COUNCIL OF MEDICAL RESEARCH)</p>

<p>P.O BOX 101,<br />Dr. M. Miyazaki Marg,<br />Tajganj, Agra - 282001</p>

<p>Applications are invited for a walk-in interview to be held in the Seminar Hall of the on 15th November, 2013, 9:30 am for temporary positions of JRF, Lab Technician and Field attendant in a ICMR funded project entitled "Elucidating the strain differentiation and transmission dynamics of M. leprae through simple sequence repeats ISSR-PCR marker"</p>

<p>1. JRF (one Post)</p>

<p>    Essential qualification: Candidates with M.Sc/IVI.Tech or equivalent degree in any life science related subjects with UGC-CSIR/ICMR/DBT-Net qualified</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age. Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs. 6,000 + 20% HRA per Month</p>

<p>2. Lab Technician (One Post)</p>

<p>    Essential Qualification: 12th with DMLT/B.SCA4.SC in Life sciences</p>

<p>    Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.</p>

<p>    Age: Maximum 30 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>    Emoluments: Rs13,760/ Per Month</p>

<p>3. Field Attendant (One Post)</p>

<p>Essential Qualification: 10th Pass</p>

<p>Desirable Qualification: Experience in field work</p>

<p>Age: Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.</p>

<p>Emoluments: Rsl2,040l Per Month</p>

<p>Terms: posts are purely temporary. Appointment will be initially made for a period of one (01) year and may be extended further based on the performance of the candidate up to completion of the project.</p>

<p>Application &amp; Selection procedure: candidates have to appear in the walk-in-interview in person along with an application/CV on plain paper giving details of at educational qualificationq experience and submit photocopies of relevant documents at the time of interview. Selection will be based on the performance of the candidate in the interview' Candidates will not be sent any interview call letter separately. No TA/DA will be paid to the candidate for appearing in the interview. selection is not possible without appearing in the interview. All candidates must report by 9:00am on the date of interview. Advance copy of CV may be sent to m.sarathipartha@gmail.com</p>

<p>Advertisement: http://www.jalma-icmr.org.in/P_S_M_advertisment.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7815/post-doc-in-systems-genetics</guid>
  <pubDate>Wed, 08 Jan 2014 19:23:37 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc in Systems Genetics]]></title>
  <description><![CDATA[
<p>Gagneur lab at Gene Center, Ludwig-Maximilians-Universitaet, Munich, Germany</p>

<p>Deadline for applications : January 15, 2014.</p>

<p>Description :</p>

<p>We seek a talented and motivated post-doc to develop computational methods for inferring the molecular basis of genetic diseases by integration of personal omics data. Research topics include: identifying causal mutations of rare disease patients by meta-analysis; inferring disease-causing molecular pathways from genotype, human phenotypes, and omics profile of patient-derived cell lines; and causal inference from longitudinal omics studies of patients. The developed methods will be applied to analyze data from our medical collaborators.</p>

<p>Candidates must either hold a PhD in computational biology or bioinformatics, or hold a PhD in physics, statistics, or applied mathematics with practical experience with high-dimensional data analysis. Experience in quantitative genetics is a plus. Applicants must have a proven publication record and an interest for translational research.</p>

<p>The Gagneur lab is a young, lively and multidisciplinary group with a research focus on systems genetics and gene regulation. It is located at the Gene Center of the LMU (University of Munich), an interdisciplinary institution whose 16 independent research groups investigate the regulation of gene expression at all levels - from the underlying molecular mechanisms to the biological system. The institute is located on the biomedical research campus Munich-Grosshadern, offering a dynamic, interactive and internationally oriented research environment. The dynamism of Munich and the proximity of the Alps provide an excellent quality of life.</p>

<p>The salary is according to the TV-L (German academic salary scale).<br />Applications including a cover letter, CV, and references must be sent by January 15th 2014 to Julien Gagneur (gagneur@genzentrum.lmu.de)</p>

<p>About the lab: http://www.gagneur.genzentrum.lmu.de</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</guid>
	<pubDate>Wed, 04 Dec 2013 02:11:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/7032/computer-experts-in-biotechnology-laboratory</link>
	<title><![CDATA[Computer experts in biotechnology laboratory]]></title>
	<description><![CDATA[<p>Only bioinformatician can understand that <strong>multiplication</strong> and <strong>division</strong> are different but same thing :)</p><p><span>Disclaimer:</span>&nbsp;This cartoon is solely designed to create humour and fun, not to offend any computer experts.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/7032" length="35726" type="image/gif" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</guid>
	<pubDate>Thu, 14 Nov 2013 13:36:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/6380/hidden-markov-models-viterbi-algorithm-markov-chain-exploration-with-script</link>
	<title><![CDATA[Hidden Markov Models, Viterbi Algorithm, Markov Chain Exploration with script]]></title>
	<description><![CDATA[<p><strong>Hidden Markov Models, the Viterbi Algorithm, and CpG Islands (in VB6)</strong></p><p><strong>Problem :</strong></p><p>The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.<br /><br />CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.</p><p>Find step wise explanationand implementation steps at <a href="http://dna.cs.byu.edu/bio465/Labs/hmm.shtml">http://dna.cs.byu.edu/bio465/Labs/hmm.shtml</a></p><p>Source code with explanation <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/</a></p><p>Fore detail understanding of HMM read this excellent tutorial <a href="http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf">http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf</a></p><p>Viterbi Algo at <a href="http://en.wikipedia.org/wiki/Viterbi_path">http://en.wikipedia.org/wiki/Viterbi_path</a></p><p>For firther reading Wiki page <a href="http://en.wikipedia.org/wiki/Hidden_Markov_model">http://en.wikipedia.org/wiki/Hidden_Markov_model</a></p><p>On CpG island paper and for indepth understanding <a href="http://www.biomedcentral.com/1471-2164/12/S2/S10">http://www.biomedcentral.com/1471-2164/12/S2/S10</a></p><p>&nbsp;</p><p>If you are more interested in exploring&nbsp;Markov Chain Exploration and understand it with graphical version please visit <a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1</a></p><p>Reference:</p><p>1.<a href="http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&amp;lngWId=1">http://www.planet-source-code.com</a></p><p>2. <a href="http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/">http://www.tannerhelland.com</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34172/orthodotter-synteny-plots-oxford-grid</guid>
	<pubDate>Wed, 09 Aug 2017 07:16:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34172/orthodotter-synteny-plots-oxford-grid</link>
	<title><![CDATA[orthodotter: Synteny plots (oxford grid)]]></title>
	<description><![CDATA[<pre><code>orthodotter -h
--------------------------------------------------------------------------------
orthodotter - Plot orthologous genes on an oxford grid.
       -f &lt;file&gt;     : input file, containing orthologous genes, default is stdin
                       species chr-name start end species chr-name start end
       -toPlot &lt;arg&gt; : give the x and y sets and the color separated by double-dots,
                       for example set1:set2:red will plot set1 on x, set2 on y with
                       red points. Could give several -toPlot arguments.
                       To launch the clustering of dots, use extra-option 1=dist,min_nb_genes
                       where dist is the minimal distance (euclidian) between two points and min_nb_genes the minimal
                       number of genes in a cluster to be valid.
       -o &lt;file&gt;     : output file, default is stdout
       -x &lt;int&gt;      : resolution of x axis, default is 600
       -y &lt;int&gt;      : resolution on y axis, default is 600
       -r &lt;int&gt;      : radius of circle representing orthologous genes
       -format       : could be png, gif, jpg, pdf or ps. Default is png.
       -fg           : foreground color, default is black
       -bg           : background color, default is transparent
       -fSize &lt;int&gt;  : fontSize, default is 1
       -filter       : check chromosome names
       -h            : help
--------------------------------------------------------------------------------
orthodotter -f Vigne_Banane.ortho -toPlot Vigne:Banane:black:1=10,5 -x 1200 -y 1200 -bg white -o Vigne_vs_Banane.png &gt; Vigne_vs_Banane.clusters
--------------------------------------------------------------------------------</code></pre><p>Address of the bookmark: <a href="https://github.com/institut-de-genomique/orthodotter" rel="nofollow">https://github.com/institut-de-genomique/orthodotter</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6562/molecular-bioinformatics-lab-mbl</guid>
  <pubDate>Tue, 19 Nov 2013 18:23:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Molecular Bioinformatics Lab (MBL)]]></title>
  <description><![CDATA[
<p>The main subject of interest in our laboratory is the study of the relationship among sequence, structure, and function in proteins and nucleic acids. Our research can be divided in two major topics:</p>

<p>the study of the sequence-structure relationship<br />(application -&gt; structure prediction)<br />the study of the structure-function relationship<br />(application -&gt; function prediction)</p>

<p>Therefore, anything related to the configuration (sequence) and conformation (structure) in atomic systems of proteins and nucleic acids, and the interaction of these with other elements (function) is of our major interest.</p>

<p>Lab page @ http://melolab.org/mbl/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</guid>
	<pubDate>Fri, 06 Apr 2018 12:10:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36111/d3networktools-for-creating-d3-javascript-network-tree-dendrogram-and-sankey-graphs-from-r</link>
	<title><![CDATA[d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.]]></title>
	<description><![CDATA[<p><a href="http://bost.ocks.org/mike/">Mike Bostock</a><span>&rsquo;s&nbsp;</span><a href="http://d3js.org/">D3.js</a><span>&nbsp;is great for creating&nbsp;</span><a href="http://bl.ocks.org/mbostock/4062045">interactive network graphs</a><span>&nbsp;with JavaScript. The&nbsp;</span><a href="https://github.com/christophergandrud/d3Network">d3Network</a><span>&nbsp;package makes it easy to create these network graphs from&nbsp;</span><a href="http://www.r-project.org/">R</a><span>. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.</span></p><p>Address of the bookmark: <a href="http://christophergandrud.github.io/d3Network/" rel="nofollow">http://christophergandrud.github.io/d3Network/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6818/scientist-positions-gujarat-state-biotechnology-mission</guid>
  <pubDate>Mon, 25 Nov 2013 10:26:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist Positions @ Gujarat State Biotechnology Mission]]></title>
  <description><![CDATA[
<p>Gujarat State Biotechnology Mission invite applications [Online Only] under various projects* namely Gujarat Biodiversity Gene Bank (BioGene), Gujarat Institute of Genomics (GIG), Gujarat Institute of Bioinformatics [GIBS] and Gujarat Institute of Marine Biotechnology. Eligible candidates can Apply through online application portal.</p>

<p>1 Scientist E 3</p>

<p>50,000/-</p>

<p>M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject.</p>

<p>Minimum 8 Yrs. of experience after M.Sc. or 5 Yrs. of experience after Ph.D. in responsible position of work in R &amp; D in the area of genomics/ conservation biotechnology/bioinformatics/Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 40yrs.</p>

<p>2 Scientist B 6</p>

<p>30,000/-</p>

<p>M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject shall be preferred.</p>

<p>Minimum 3 Yrs. of experience after M.Sc. in responsible position of work in R &amp; D in the area of genomics/ conservation biotechnology/ bioinformatics /Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 35yrs.</p>

<p>The positions are purely on contractual basis for 11 months. Interested candidates can apply online in specified format available at "http://leogen.in/recruit/" The last date of applying is 24th December, 2013. Applications must be submitted online only. Applications submitted in any other format except online prescribed performa will be rejected. Candidates in service must apply through proper channel. Candidates will be required to provide original documents along with duly filled and signed application Performa, as and when called for interview.</p>

<p>For more details please visit the website URL : http://leogen.in/recruit</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</guid>
	<pubDate>Wed, 25 Apr 2018 05:15:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36398/tools-for-protein-protein-docking</link>
	<title><![CDATA[Tools for Protein-Protein Docking !]]></title>
	<description><![CDATA[<p>Predicting the structure of protein&ndash;protein complexes using docking approaches is a difficult problem whose major challenges include identifying correct solutions, and properly dealing with molecular flexibility and conformational changes. Following are the tools to predict&nbsp;<span>the structure of protein&ndash;protein complexes:</span></p><p><a href="http://www.sbg.bio.ic.ac.uk/docking/index.html" target="_blank">3D-Dock Suite</a></p><p>Global rigid search: FFTShape complementarity and electrostatics</p><p>Re-scoring and clustering. Refinement of interface side-chains</p><p><a href="http://www.sbg.bio.ic.ac.uk/~3dgarden/" target="_blank">3D-Garden</a></p><p>Global rigid search in ensamble</p><p>Shape complementarity and Lennard&ndash;Jones potential</p><p>Side chain and backbone dihedral refinement</p><p><a href="http://www.sdsc.edu/CCMS/DOT/" target="_blank">DOT</a></p><p>Global rigid search: FFTShape complementarity, electrostatics and VDWNone</p><p><a href="http://users.unimi.it/~ddl/escherng/index.htm" target="_blank">Escher NG</a></p><p>Global rigid searchShape complementarity, hydrogen bonds and electrostatic</p><p>Integrated in&nbsp;<a href="http://users.unimi.it/~ddl/vega/download.htm" target="_blank">VEGA</a></p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/gramm1" target="_blank">GRAMM</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potential</p><p>Clustering of conformations</p><p><a href="http://vakser.bioinformatics.ku.edu/resources/gramm/grammx/" target="_blank">GRAMM-X</a>&nbsp;</p><p>Global rigid search: FFT. smooth protein surface representation for soft docking</p><p>Shape complementarity and Lennard-Jones potentialminimization and re-scoring with multiple filters</p><p><a href="http://www.loria.fr/~ritchied/hex_server/" target="_blank">HEX</a></p><p>Global rigid search: Fourier correlation of spherical harmonics</p><p>Shape complementarity</p><p><a href="http://www.csd.abdn.ac.uk/hex/" target="_blank"></a><a href="http://haddock.chem.uu.nl/Haddock/haddock.php" target="_blank">HADDOCK</a></p><p>Global rigid searchElectrostatic ,VDW and desolvation energy termsMD simulated annealing refinement . Filtering based on external data.&nbsp;</p><p><a href="http://www.molsoft.com/docking.html">ICM</a></p><p>Global rigid search: Monte CarloEmpirical scoring function</p><p>Clustering and selection of conformations. Refinement of interface side-chains and re-scoring</p><p><a href="http://www.weizmann.ac.il/Chemical_Research_Support/molfit/" target="_blank">MolFit&nbsp;</a></p><p>Global rigid search: FFTShape complementarity</p><p>Clustering of good solutions, filtering using&nbsp;<em>a priori&nbsp;</em>information and small, local rigid rotations around selected conformations</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank">PatchDock</a></p><p>Global rigid searchShape complementarity and atomic desolvation energy</p><p>Clustering of conformations</p><p><a href="http://inb.bsc.es/gn6/PyDock" target="_blank">PyDock</a></p><p>Global rigid search:FFTShape complementarity</p><p>rescoring by binding electrostatics and desolvation energy</p><p><a href="http://bioinfo3d.cs.tau.ac.il/PatchDock/" target="_blank"></a><a href="http://rosettadock.graylab.jhu.edu/" target="_blank">RosettaDock</a></p><p>Local rigid search: Monte Carlo with low and high resolution structure representation levels</p><p>Different scoring parameters for the different resolutions&nbsp;</p><p><a href="http://zlab.bu.edu/zdock/" target="_blank">ZDOCK</a></p><p>Global rigid search: FFTShape complementarity, desolvation energy, and electrostatics.</p><p>Energy minimization and re-scoringFree for academics</p><p>&nbsp;</p><p>Point to note:</p><p>The proper treatment of flexibility in protein&ndash;protein docking is still an active field of research. You first should analyzed your proteins in order to define their conformational space and then choose the most suitable method for your docking problem.</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>