<?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/34744?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/34744?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5209/anders-krogh-lab</guid>
  <pubDate>Mon, 30 Sep 2013 19:07:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Anders Krogh Lab]]></title>
  <description><![CDATA[
<p>In a lot of my work in bioinformatics, I have been using hidden Markov models (HMMs). As a postdoc with David Haussler at UCSC we developed the so-called profile HMMs (refs). Since then I have applied HMMs to membrane proteins (refs) and gene identification (refs) and have worked on methods for such things as discriminative estimation of HMMs (refs) and alternative decoding algorithms etc. (refs).</p>

<p>Now my main interests are in gene regulation, where we work on promoter analysis; non-coding RNA, where miRNAs and structure prediction are the main areas; and protein structure, where the group is working on methods for structure prediction from sequence. To read more about these topics, please see the research pages. </p>

<p>Lab page @ http://wiki.binf.ku.dk/User:Krogh</p>
]]></description>
</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/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</guid>
	<pubDate>Fri, 25 Apr 2014 19:31:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</link>
	<title><![CDATA[“On” and “Off” the neuron !!!]]></title>
	<description><![CDATA[<p><span>Optogenetics is a recent innovation in neuroscience that gives researchers the ability to control the activity of neurons with light. With this powerful tool, researchers are teasing apart the biological basis of memory, behavior, and disease (see &ldquo;<a href="http://www.technologyreview.com/news/517226/scientists-make-mice-remember-things-that-didnt-happen/"><span>Scientists Make Mice &lsquo;Remember&rsquo; Things That Didn&rsquo;t Happen</span></a>&rdquo; and &ldquo;<a href="http://www.technologyreview.com/news/423254/an-on-off-switch-for-anxiety/"><span>An On-Off Switch for Anxiety</span></a>,&rdquo;). But for the first several years of this technology&rsquo;s existence, the proteins that scientists added to neurons to make them react to light were only good at activating neurons. That limited researchers&rsquo; ability to understand neuronal circuits, sets of interconnected neurons that are thought to control behavior and, when misfiring, to underlie many brain conditions. Problems can arise from any imbalance in circuit activity, whether too much or too little.&nbsp;</span></p><p><span>Now, two research groups have engineered new optogenetic proteins that can be used to efficiently silence neurons.&nbsp;<span><span>One of the two new proteins comes from the lab of<span>&nbsp;</span><a href="http://www.stanford.edu/group/dlab/about_pi.html" target="_blank">Karl Deisseroth</a>, a psychiatrist and neuroscientist at Stanford University who helped develop optogenetics as a research tool.&nbsp;His group&rsquo;s new &ldquo;off&rdquo; switch for neurons was created by changing 10 of the 333 amino acids in an existing optogenetic protein, which itself had been engineered by combining natural proteins from<span>&nbsp;</span></span></span><a href="http://genome.jgi-psf.org/Chlre3/Chlre3.home.html" target="_blank"><span>green algae</span></a><span><span>. That advance&nbsp;</span><span>&ldquo;creates a powerful tool that allows neuroscientists to apply a brake in any specific circuit with millisecond precision,&rdquo; said Thomas&nbsp;Insel, director of the National Institute of Mental Health, in a released statement.&nbsp;</span><a href="http://www.sciencemag.org/content/344/6182/409" target="_blank"><span>The other new silencing protein</span></a>, developed by scientists at the H</span><span>umboldt University of Berlin and collaborators, was created by changing amino acids in the same existing optogenetic protein.&nbsp;</span></span></p><p><span><span>Some researchers are also looking to optogenetics as a potential treatment for patients with a variety of conditions (see &ldquo;</span></span><span><a href="http://www.technologyreview.com/news/524771/for-mice-and-maybe-men-pain-is-gone-in-a-flash/"><span>For Mice, and Maybe Men, Pain Is Gone in a Flash</span></a><span><span>,&rdquo; and &ldquo;</span></span><a href="http://www.technologyreview.com/news/506981/flipping-on-the-lights-to-halt-seizures/"><span>Flipping on the Lights to Halt Seizures</span></a><span><span>&rdquo;) but there are huge challenges to overcome. The method requires genetic modification of cells to make them light-sensitive. It also requires implanted light sources for all but the shallowest of nerve endings. <br /></span></span></span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</guid>
	<pubDate>Thu, 07 Aug 2014 18:08:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</link>
	<title><![CDATA[MEGADOCK 4.0]]></title>
	<description><![CDATA[<p>An ultra&ndash;high-performance protein&ndash;protein docking software for heterogeneous supercomputers</p>
<p id="p-4"><strong>Summary:</strong> The application of protein&ndash;protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of over 97% strong scaling.</p>
<p id="p-5"><strong>Availability and Implementation:</strong> MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: <a href="http://www.bi.cs.titech.ac.jp/megadock">http://www.bi.cs.titech.ac.jp/megadock</a>.</p>
<p id="p-6"><strong>Contact:</strong> <a href="mailto:akiyama@cs.titech.ac.jp">akiyama@cs.titech.ac.jp</a></p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short</a></p>]]></description>
	<dc:creator>Suleman Khan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19087/dcgor</guid>
	<pubDate>Sat, 08 Nov 2014 14:54:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19087/dcgor</link>
	<title><![CDATA[dcGOR]]></title>
	<description><![CDATA[<p>An R package for analysing ontologies and protein domain annotations has been published in PLoS Computational Biology (http://dx.doi.org/10.1371/journal.pcbi.1003929). The package is distributed as part of CRAN (http://cran.r-project.org/package=dcGOR), and also at GitHub for version control.<br /><br />The dedicated website is available in http://supfam.org/dcGOR, from which several demos are also provided:<br /><br />1. Analysing SCOP domains: http://supfam.org/dcGOR/demo-Fang.html<br /><br />2. Analysing Pfam domains: http://supfam.org/dcGOR/demo-Basu.html<br /><br />3. Analysing InterPro domains: http://supfam.org/dcGOR/demo-Customisation.html<br /><br />&nbsp;</p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</guid>
	<pubDate>Thu, 01 Mar 2018 06:20:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</link>
	<title><![CDATA[Protein Subcellular Localization Prediction]]></title>
	<description><![CDATA[<p>Assigning subcellular localization to a protein is an important step towards elucidating its interaction partners, function, and potential role(s) in the cellular machinery. Computational tools offer an attractive complement to time-consuming and laborious experimental methods.</p>
<p>http://abi.inf.uni-tuebingen.de/Services/YLoc/webloc.cgi</p><p>Address of the bookmark: <a href="https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization" rel="nofollow">https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/pages/view/37317/interview-puzzles-for-bioinformatician</guid>
	<pubDate>Tue, 17 Jul 2018 05:26:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37317/interview-puzzles-for-bioinformatician</link>
	<title><![CDATA[Interview Puzzles for Bioinformatician !]]></title>
	<description><![CDATA[<p>These are some of the most famous Interview Puzzles being asked in top tech companies.<br /><br />Here is a list of Top 25 puzzles which have been asked in top Tech Interview.</p><ol>
<li><span><a href="http://puzzlefry.com/puzzles/2-eggs-and-100-floor-google-classic-question/" target="_blank">2 Eggs and 100 Floor Classic Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-coins-puzzle/" target="_blank">Five pirates and gold coin Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-puzzle/" target="_blank">Six pirates and Gold Coin puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/probability-of-having-boy/" target="_blank">Probability of having boy</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/random-airplane-seats/" target="_blank">Random Airplane Seats</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/inverted-cards-puzzle/" target="_blank">Inverted playing card puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/flipping-coins/" target="_blank">Flipping Coins Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/three-hat-colors/" target="_blank">Three hat colors Microsoft Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/25-horses-5-tracks-puzzle/" target="_blank">25 horses 5 tracks Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/gold-bar-puzzle-2/" target="_blank">Gold Bar Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/crossing-the-bridge-puzzle/" target="_blank">Crossing the Bridge Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/interview-questions/" target="_blank">Will you accept the bet?</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/the-line-of-persons-with-hats/" target="_blank">The Puzzle of 100 Hats</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/how-many-days/" target="_blank">Man fell in Well Puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/minimum-number-of-weigths/" target="_blank">Minimum Number of Weigths</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/one-bulb-with-3-switches/" target="_blank">One Bulb with 3 Switches</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/find-the-minimum-number-of-aircraft/" target="_blank">Find the minimum number of aircraft</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/burning-ropes-to-measure-time/" target="_blank">Burning ropes to measure time</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/connect-3-houses-with-3-wells/" target="_blank">Connect 3 houses with 3 wells</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/measure-9-minutes-from-2-hourglasses-puzzle/" target="_blank">Measure 9 minutes from 2 hourglasses puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/ant-and-triangle-problem/" target="_blank">Ant and Triangle Problem</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/the-man-in-the-elevator/" target="_blank">The Man in the Elevator</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/find-the-survivor/" target="_blank">Find the survivor</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/free-the-prisoners-puzzle/" target="_blank">Free the prisoners puzzle</a></span></li>
<li><span><a href="http://puzzlefry.com/puzzles/great-strategy-can-only-save-life/" target="_blank">GREAT STRATEGY CAN ONLY SAVE LIFE</a></span></li>
</ol><p><br /><span>Specially for Microsoft Interview Puzzles, you may refer,</span><br /><span><a href="http://puzzlefry.com/2015/08/top-15-famous-microsoft-interview-puzzles/" target="_blank">Top 15 Microsoft Interview Puzzles</a></span><br /><span><a href="http://puzzlefry.com/qa-tag/microsoft-interview-puzzles/" target="_blank">Microsoft Interview Puzzles</a></span><br /><br /><span>Other MOST COMMON Interview Puzzles-</span><br /><span><a href="http://puzzlefry.com/2015/08/top-25-tech-interview-puzzles-with-answers/" target="_blank">Top 25 Tech Interview&nbsp;</a></span><span><a href="http://puzzlefry.com/2015/08/top-25-tech-interview-puzzles-with-answers/" target="_blank">Logical Puzzles</a></span><br /><br /><span>Each of the puzzles got repeated a number of times in interviews&nbsp;</span><span>even for top tech companies&nbsp;</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</guid>
	<pubDate>Fri, 17 Apr 2020 06:47:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</link>
	<title><![CDATA[SAMHAR-COVID19 Hackathon]]></title>
	<description><![CDATA[<p>Centre for Development of Advanced Computing (C-DAC) under the aegis of the National Supercomputing Mission (NSM), a Ministry of Electronics &amp; Information Technology (MeitY) and Department of Science &amp; Technology (DST) initiative, in association with NVIDIA &amp; OpenACC, announces the&nbsp;SAMHAR-COVID19 Hackathon.</p><p>Pandemic outbreak such as Coronavirus outbreak can create huge challenges for the Government and Public Health Officials to gather information quickly and coordinate a response. In such a situation, Artificial Intelligence (AI) can play a huge role in predicting, minimizing and stalling its spread of the virus.</p><p>C-DAC has embarked on a program&nbsp;SAMHAR-COVID19&nbsp;(Supercomputing using&nbsp;AI,&nbsp;ML,&nbsp;Healthcare&nbsp;Analytics based&nbsp;Research for combating COVID19). This opportunity will provide researchers to find solutions for Identifying, Tracking and Forecasting outbreaks of COVID19 and Facilitating Drug Discovery as well.</p><div><div><div><ul>
<li><span>Participants can update submissions multiple times till the Registration End date.</span></li>
<li><span>Each entry can be submitted by a Team comprising of minimum 3 and maximum 5 members (Including the Team Lead).</span></li>
<li><span>Participants will have to share the complete work activities with C-DAC. And C-DAC will have right to use the submitted application/solution for SAMHAR-COVID19 programs.</span></li>
<li><span>The Award will be given to the&nbsp;<span>Selected/Winning Entry</span>&nbsp;irrespective of the number of members in the Team (members may choose to distribute the amount among themselves).</span></li>
<li><span>The decision of the&nbsp;<span>Eminent Jury</span>&nbsp;on the&nbsp;<span>I<span>3</span>&nbsp;Award</span>&nbsp;will be final and binding.</span></li>
<li><span>Award can be for the Team/Company/Institution, as submitted in the Application and cannot be changed later.</span></li>
<li><span>Submissions will be considered void if they are in whole or part ill-eligible, incomplete, damaged, altered, counterfeit, obtained through fraud or late submission.</span></li>
<li></li>
</ul></div></div></div><p>More at&nbsp;<a href="https://samhar-covid19hackathon.cdac.in/">https://samhar-covid19hackathon.cdac.in/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>