<?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=500</link>
	<atom:link href="https://bioinformaticsonline.com/related/34916?offset=500" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/7088/gabi</guid>
  <pubDate>Fri, 06 Dec 2013 16:43:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[GABi]]></title>
  <description><![CDATA[
<p>GABi Research<br />The major researching fields defined as the GABi scope are described next:<br />    Sequence Analysis<br />    Protein Structure Prediction<br />    Comparative Genomics<br />    Functional Analysis of Residues on Protein Families<br />    Gene/Protein Networks<br />    Genome structure &amp; base composition<br />    Highthroughput data analysis from NGS</p>

<p>Lab Page http://gabi.cidbio.org/index/</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/researchlabs/view/7214/lapti-lab</guid>
  <pubDate>Thu, 12 Dec 2013 18:19:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[LAPTI Lab]]></title>
  <description><![CDATA[
<p>The main theme of our research is the understanding of how genetic information is decoded from DNA into RNA and proteins. Someone may find this topic a little strange and argue that we already know how this is happening.</p>

<p>Translational recoding. </p>

<p>RNA editing. </p>

<p>Evolution of the genetic code and translation.</p>

<p>More at http://lapti.ucc.ie/research.html</p>

<p>Lab page http://lapti.ucc.ie/index.html</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7362/junior-research-fellow-jrf-project-fellow-kalasalingam-university</guid>
  <pubDate>Thu, 19 Dec 2013 13:23:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF) / Project Fellow @ Kalasalingam University]]></title>
  <description><![CDATA[
<p>Applications are invited from interested candidates for the post of one Junior Research Fellow / Project Fellow on a purely temporary basis in a time bound research project (3 years) sponsored by Science and Engineering Research Board, Government of India, New Delhi.</p>

<p>Name of the fellowship: Junior Research Fellow (JRF) / Project Fellow</p>

<p>Title of the project: Genome-wide Mapping of Murine Specific Dengue T-cell Epitopes: Computational Prediction, Identification and use as Candidate Vaccines</p>

<p>Duration: 3 years</p>

<p>Fellowship: Rs. 18,000 for first 2 years and Rs. 20,000 for 3rdyear (for M.Tech. candidates)</p>

<p>Rs. 16,000 for first 2 years and Rs. 18,000 for 3rdyear (for M.Sc. candidates with NET qualification)</p>

<p>Rs. 8,000 for first 2 years and Rs. 10,000 for 3rdyear (for M.Sc. candidates without NET qualification)</p>

<p>Qualifications: M.Tech. in Biotechnology / M.Sc. in any branch of Life Sciences</p>

<p>Desirable Experience: Minimum of two years research experience in any of the following areas: Immunology / Microbiology / Gene Manipulation / Bioinformatics</p>

<p>Interested and eligible candidates may apply with their resume along with relevant documents and a passport size photograph to the Principal Investigator by post (or e-mail) on or before December 31, 2013. Only short listed candidates will be called for written test and/or interview. Selected candidate may register for PhD in Kalasalingam University. No TA/DA will be paid for attending interview.</p>

<p>Dr. K. Sundar<br />Principal Investigator (SERB Project)<br />Department of Biotechnology<br />Kalasalingam University<br />Krishnankoil – 626126, Tamil Nadu<br />sundarkr@klu.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36514/evidentialgene-tr2aacds-mrna-transcript-assembly-software</guid>
	<pubDate>Tue, 08 May 2018 04:39:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36514/evidentialgene-tr2aacds-mrna-transcript-assembly-software</link>
	<title><![CDATA[EvidentialGene: tr2aacds, mRNA Transcript Assembly Software]]></title>
	<description><![CDATA[<p><span>EvidentialGene is a genome informatics project, "Evidence Directed Gene Construction for Eukaryotes", to construct high quality, accurate gene sets for animals and plants, developed by Don Gilbert at Indiana University, see</span><br><a href="http://arthropods.eugenes.org/EvidentialGene/" target="_blank">http://arthropods.eugenes.org/EvidentialGene/<span></span></a><br><br><span>Construction refers to the combination of classical gene prediction, and more recent gene assembly (de-novo and genome-assisted) methods. The basic Evigene methods involve using available best-of-breed gene prediction and assembly software, combining all evidence for genes, from expressed sequences, genome assembly sequences, related species protein sequences, and any other, to annotate and score gene constructions. Over-produced constructions are classified by gene evidence for best qualities per "locus", including genome-aligned and gene-transcript aligned (genome-free) locus identification. All software developed for EvidentialGene is publicly available. See project wiki/blog for notes.</span></p>
<p><span>Download&nbsp;</span></p>
<p>http://arthropods.eugenes.org/EvidentialGene/trassembly.html</p>
<p>https://sourceforge.net/p/evidentialgene/blog/</p><p>Address of the bookmark: <a href="http://arthropods.eugenes.org/EvidentialGene/trassembly.html" rel="nofollow">http://arthropods.eugenes.org/EvidentialGene/trassembly.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7567/asst-professor-jaipur-national-university</guid>
  <pubDate>Fri, 27 Dec 2013 19:54:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor @ JAIPUR NATIONAL UNIVERSITY]]></title>
  <description><![CDATA[
<p>JAIPUR NATIONAL UNIVERSITY</p>

<p>Established by Government of Rajasthan</p>

<p>Approved by UGC under Sec 2(f) of UGC Act 1956</p>

<p>ADVERTISEMENT FOR FACULTY POSITION AT JAIPUR NATIONAL UNIVERSITY,JAIPUR</p>

<p>Jaipur National University, Jaipur is a premier centre of learning, providing various integrated and interdisciplinary programmes of study and research in the country. With the opening of the School of Distance Education &amp; Learning, JNU has taken education to the doorsteps of those aspirants who, for some reason, could not be a part of regular stream of education. In this era of competition &amp; ambition for excellence, it has become imperative to have quality education &amp; an alert mind coupled with the right attitude to carry onself, and for this, JNU happens to be the most sought after destination.</p>

<p>School Of Life Sciences: Bioinformatics, Chemistry</p>

<p>Total no of Post: 04</p>

<p>Education:</p>

<p>PG – M.Sc /M.Tech Bioinformatics</p>

<p>PG – M.Sc /M.Tech Chemistry</p>

<p>Experience:</p>

<p>Candidate with 1-2 years of teaching experience in college/ University will be preffered. Freshers may also apply.</p>

<p>Compensation: Compensation will not be a problem for the right candidate</p>

<p>HOW TO APPLY:</p>

<p>SEND THE UPDATED RESUME THROUGH MAIL OR POST AT</p>

<p>dsbhatia5@yahoo.com</p>

<p>contact no: 7568246839</p>

<p>Website: http://www.jnujaipur.ac.in</p>

<p>Please mail your resume to Prof.D.S.Bhatia</p>

<p>Email Address: dsbhatia5@yahoo.com</p>

<p>Ph:, +917568246839</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</guid>
	<pubDate>Thu, 09 Aug 2018 17:41:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</link>
	<title><![CDATA[mmgenome: Tools for extracting individual genomes from metagneomes]]></title>
	<description><![CDATA[<p>The mmgenome toolbox enables reproducible extraction of individual genomes from metagenomes. It builds on the&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">multi-metagenome</a>&nbsp;concept, but wraps most of the process of extracting genomes in simple R functions. Thereby making the whole process of binning easy and at the same time reproducible through the Rmarkdown format.</p>
<p>The mmgenome R package also facilitates effortless integration with additional data sources and hence should not be seen as "yet another binning method", but rather a package to integrate different binning strategies.</p>
<p>All functions in the mmgenome R package has associated documentation, check it out in R by e.g.&nbsp;<code>?mmplot</code>.</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/mmgenome" rel="nofollow">https://github.com/MadsAlbertsen/mmgenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</guid>
	<pubDate>Tue, 08 Nov 2022 03:39:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</link>
	<title><![CDATA[Tools for RNA classification]]></title>
	<description><![CDATA[<p><span>barrnap</span>&nbsp;-&nbsp;<a href="https://github.com/tseemann/barrnap" target="_blank">https://github.com/tseemann/barrnap</a></p><p><span>CPAT</span>&nbsp;-&nbsp;<a href="https://github.com/liguowang/cpat" target="_blank">https://github.com/liguowang/cpat</a>,&nbsp;<a href="http://lilab.research.bcm.edu/" target="_blank">http://lilab.research.bcm.edu/</a>&nbsp;(web server)</p><p><span>CPC2</span>&nbsp;-&nbsp;<a href="https://github.com/gao-lab/CPC2_standalone" target="_blank">https://github.com/gao-lab/CPC2_standalone</a>,&nbsp;<a href="http://cpc2.gao-lab.org/" target="_blank">http://cpc2.gao-lab.org/</a>&nbsp;(web server)</p><p><span>Infernal</span>&nbsp;-&nbsp;<a href="http://eddylab.org/infernal/" target="_blank">http://eddylab.org/infernal/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/infernal" target="_blank">https://github.com/EddyRivasLab/infernal</a></p><p><span>NCBI RefSeq</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/refseq/" target="_blank">https://www.ncbi.nlm.nih.gov/refseq/</a></p><p><span>Rfam</span>&nbsp;-&nbsp;<a href="http://rfam.xfam.org/" target="_blank">http://rfam.xfam.org/</a>,&nbsp;<a href="https://docs.rfam.org/en/latest/index.html" target="_blank">https://docs.rfam.org/en/latest/index.html</a></p><p><span>SILVA</span>&nbsp;-&nbsp;<a href="https://www.arb-silva.de/" target="_blank">https://www.arb-silva.de/</a></p><p><span>RNAmmer</span>&nbsp;-&nbsp;<a href="http://www.cbs.dtu.dk/services/RNAmmer/" target="_blank">http://www.cbs.dtu.dk/services/RNAmmer/</a>&nbsp;(web server, standalone download link)</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>