<?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/43670?offset=1180</link>
	<atom:link href="https://bioinformaticsonline.com/related/43670?offset=1180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/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/22786/ra-at-university-of-delhi</guid>
  <pubDate>Wed, 17 Jun 2015 20:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Delhi]]></title>
  <description><![CDATA[
<p>Research Scientist Jobs opportunity in University of Delhi on temporary basis</p>

<p>Qualifications : Ph. D.</p>

<p>Desirable : Experience on DNA Markers, plant genome mapping and bioinformatics</p>

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

<p>Department : Genetics</p>

<p>Salary : Rs. 60,000/-<br />How to apply</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room. Applicants are requested to bring all related documents, in original and a set of photocopy, for verification. Date and time of the interview : 25.06.2015 at 10:30 AM.</p>

<p>Click Here for Job Details http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</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/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</guid>
	<pubDate>Tue, 23 Jun 2015 10:39:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</link>
	<title><![CDATA[At what age did you gain passion in Bioinformatics?]]></title>
	<description><![CDATA[<p>Most of the bioinformatician were biologist ( yeah ... not all ;), and at later stage they gain a passion in Bioinformatics and learn it. When did you get inclined towards computational analysis of biological data?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Fri, 24 Jan 2020 06:04:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p><span>gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser. </span></p>
<p><span>gapFinisher can fill gaps in draft genomes quickly and reliably.</span></p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22965/ra-bioinformatics-at-bharathidasan-university</guid>
  <pubDate>Sun, 28 Jun 2015 12:21:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Bharathidasan University]]></title>
  <description><![CDATA[
<p>National Facility for Marine Cyanobacteria <br />Department of Marine Biotechnology <br />Bharathidasan University <br />Tiruchirappalli -620024, Tamil Nadu </p>

<p>Applications are invited from individuals who have high motivation to do research for the below mentioned position, </p>

<p>1. Research Associate - 1 No. <br />in the DBT sponsored project under the supervision of Dr. D. Prabaharan, Principal Investigator, National Facility for Marine Cyanobacteria, Dept. of Marine Biotechnology, Bharathidasan University, Tiruchirappalli-24. </p>

<p>Title of the Project: “Establishment of National Repository for Micro algae &amp; Cyanobacteria” funded by Department of Biotechnology, Govt. of India </p>

<p>Qualification </p>

<p>1. Research Associate – 1 No. Rs. 36,000/38,000/40,000 per month for I, II and III year + 20% HRA </p>

<p>Essential : Doctoral degree in relevant subject from recognized University/ Institutes <br />Desirable: Research experience in molecular biology and bioinformatics </p>

<p>Interested candidates can send their complete CV in plain paper with a passport size photograph, with details of Marks secured in all subjects from plus two stage (with proof, full postal address, sex, date of birth, community etc., along with additional qualification or experiences and two address of references whom could be contacted (One of whom should be PG teacher/guide). Application should reach the Principal Investigator on or before 30.06.2015 by Email (nfmcbic@yahoo.com)/Registered post/ Speed post, with subject subscribed as “Application for Research Associate /Technical Assistant /Lab attendant”. Qualifying candidates will be short listed and communicated with date of interview. No TA and DA will be given for attending the interview. Addressfor Communication Dr. D. Prabaharan Principal Investigator National Facility for Marine Cyanobacteria Bharathidasan University Tiruchirappalli-620024, Tamil Nadu.</p>

<p>Advertisement: http://www.bdu.ac.in/adv/NFMC_Project_Positions.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</guid>
	<pubDate>Tue, 08 Nov 2022 03:40:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43999/tools-for-differential-expression-analysis</link>
	<title><![CDATA[Tools for Differential expression analysis]]></title>
	<description><![CDATA[<p><span>apeglm</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/apeglm.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/apeglm.html</a></p><p><span>ashr</span>&nbsp;-&nbsp;<a href="https://github.com/stephens999/ashr" target="_blank">https://github.com/stephens999/ashr</a>,&nbsp;<a href="https://cran.r-project.org/web/packages/ashr/index.html" target="_blank">https://cran.r-project.org/web/packages/ashr/index.html</a></p><p><span>consensusDE</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/consensusDE.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/consensusDE.html</a></p><p><span>DESeq2</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/DESeq2.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/DESeq2.html</a></p><p><span>edgeR</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/edgeR.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/edgeR.html</a></p><p><span>limma</span>&nbsp;-&nbsp;<a href="https://kasperdanielhansen.github.io/genbioconductor/html/limma.html" target="_blank">https://kasperdanielhansen.github.io/genbioconductor/html/limma.html</a>&nbsp;&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/limma.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/limma.html</a></p><p><span>MetaCycle</span>&nbsp;-&nbsp;<a href="https://cran.r-project.org/web/packages/MetaCycle/index.html" target="_blank">https://cran.r-project.org/web/packages/MetaCycle/index.html</a>,&nbsp;<a href="https://github.com/gangwug/MetaCycle" target="_blank">https://github.com/gangwug/MetaCycle</a></p><p><span>RUVSeq</span>&nbsp;-&nbsp;<a href="https://bioconductor.org/packages/release/bioc/html/RUVSeq.html" target="_blank">https://bioconductor.org/packages/release/bioc/html/RUVSeq.html</a></p><p><span>SARTools</span>&nbsp;-&nbsp;<a href="https://github.com/PF2-pasteur-fr/SARTools" target="_blank">https://github.com/PF2-pasteur-fr/SARTools</a></p><p><span>tximport</span>&nbsp;-&nbsp;<a href="https://github.com/mikelove/tximport" target="_blank">https://github.com/mikelove/tximport</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/23149/raphael-lab</guid>
  <pubDate>Sat, 04 Jul 2015 19:05:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Raphael Lab]]></title>
  <description><![CDATA[
<p>Raphael Lab research is focused on Bioinformatics and Computational Biology.</p>

<p>Current research interests include next-generation DNA sequencing, structural variation, genome rearrangements in cancer and evolution, and network analysis of somatic mutations in cancer. Earlier research included topics in comparative genomics, multiple sequence alignment, and motif finding.</p>

<p>More athttp://compbio.cs.brown.edu/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42972/list-of-bioinformatics-workflow-management-tools</guid>
	<pubDate>Sat, 20 Mar 2021 00:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42972/list-of-bioinformatics-workflow-management-tools</link>
	<title><![CDATA[List of bioinformatics workflow management tools !]]></title>
	<description><![CDATA[<h3>Here are list of&nbsp;Workflow Managers</h3><ul>
<li><span><a href="https://github.com/pcingola/BigDataScript">BigDataScript</a></span>&nbsp;&ndash; A cross-system scripting language for working with big data pipelines in computer systems of different sizes and capabilities. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/25189778">paper-2014</a>&nbsp;|&nbsp;<a href="https://pcingola.github.io/BigDataScript">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/ssadedin/bpipe">Bpipe</a></span>&nbsp;&ndash; A small language for defining pipeline stages and linking them together to make pipelines. [&nbsp;<a href="http://docs.bpipe.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/common-workflow-language/common-workflow-language">Common Workflow Language</a></span>&nbsp;&ndash; a specification for describing analysis workflows and tools that are portable and scalable across a variety of software and hardware environments, from workstations to cluster, cloud, and high performance computing (HPC) environments. [&nbsp;<a href="http://www.commonwl.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/broadinstitute/cromwell">Cromwell</a></span>&nbsp;&ndash; A Workflow Management System geared towards scientific workflows. [&nbsp;<a href="https://cromwell.readthedocs.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/galaxyproject">Galaxy</a></span>&nbsp;&ndash; a popular open-source, web-based platform for data intensive biomedical research. Has several features, from data analysis to workflow management to visualization tools. [&nbsp;<a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6030816">paper-2018</a>&nbsp;|&nbsp;<a href="https://galaxyproject.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a>&nbsp;(recommended)</span>&nbsp;&ndash; A fluent DSL modelled around the UNIX pipe concept, that simplifies writing parallel and scalable pipelines in a portable manner. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29412134">paper-2018</a>&nbsp;|&nbsp;<a href="http://nextflow.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/cgat-developers/ruffus">Ruffus</a></span>&nbsp;&ndash; Computation Pipeline library for python widely used in science and bioinformatics. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/20847218">paper-2010</a>&nbsp;|&nbsp;<a href="http://www.ruffus.org.uk/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/SeqWare/seqware">SeqWare</a></span>&nbsp;&ndash; Hadoop Oozie-based workflow system focused on genomics data analysis in cloud environments. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/21210981">paper-2010</a>&nbsp;|&nbsp;<a href="https://seqware.github.io/">web</a>&nbsp;]</li>
<li><span><a href="https://bitbucket.org/snakemake">Snakemake</a></span>&nbsp;&ndash; A workflow management system in Python that aims to reduce the complexity of creating workflows by providing a fast and comfortable execution environment. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29788404">paper-2018</a>&nbsp;|&nbsp;<a href="https://snakemake.readthedocs.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/broadinstitute/wdl">Workflow Descriptor Language</a></span>&nbsp;&ndash; Workflow standard developed by the Broad. [&nbsp;<a href="https://software.broadinstitute.org/wdl">web</a>&nbsp;]</li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>