<?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/35106?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/35106?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38462/egad-ultra-fast-functional-analysis-of-gene-networks</guid>
	<pubDate>Fri, 14 Dec 2018 04:10:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38462/egad-ultra-fast-functional-analysis-of-gene-networks</link>
	<title><![CDATA[EGAD: Ultra-fast functional analysis of gene networks]]></title>
	<description><![CDATA[<p><span>With the EGAD (Extending &lsquo;Guilt-by-Association&rsquo; by Degree) package, we present a series of highly efficient tools to calculate functional properties in networks based on the guilt-by-association principle. These allow rapid controlled comparisons and analyses. Two of the core features are: a function prediction algorithm which is fully vectorized (neighbor_voting), allowing network characterization across even thousands of functional groups to be accomplished in minutes in cross-validation and an analytic determination of the optimal prior to guess candidates genes across multiple functional sets (calculate_multifunc, auc_multifunc).</span></p><p>Address of the bookmark: <a href="https://github.com/sarbal/EGAD" rel="nofollow">https://github.com/sarbal/EGAD</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41814/gggenes-a-ggplot2-extension-for-drawing-gene-arrow-maps</guid>
	<pubDate>Tue, 02 Jun 2020 11:43:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41814/gggenes-a-ggplot2-extension-for-drawing-gene-arrow-maps</link>
	<title><![CDATA[gggenes: a ggplot2 extension for drawing gene arrow maps.]]></title>
	<description><![CDATA[<p>Install the stable version of gggenes from CRAN:</p>
<p><code><a href="https://www.rdocumentation.org/packages/utils/topics/install.packages">install.packages("gggenes")</a></code></p>
<p>If you want the development version, install it from GitHub:</p>
<p><code><a href="https://www.rdocumentation.org/packages/devtools/topics/reexports">devtools::install_github("wilkox/gggenes")</a></code></p>
<p>More at&nbsp;<a href="https://github.com/wilkox/gggenes">https://github.com/wilkox/gggenes</a></p><p>Address of the bookmark: <a href="http://wilkox.org/gggenes" rel="nofollow">http://wilkox.org/gggenes</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</guid>
	<pubDate>Wed, 13 Jan 2021 19:29:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</link>
	<title><![CDATA[MetaEuk - sensitive, high-throughput gene discovery and annotation for large-scale eukaryotic metagenomics]]></title>
	<description><![CDATA[<p><span>MetaEuk is a modular toolkit designed for large-scale gene discovery and annotation in eukaryotic metagenomic contigs. Metaeuk combines the fast and sensitive homology search capabilities of&nbsp;</span><a href="https://github.com/soedinglab/MMseqs2">MMseqs2</a><span>&nbsp;with a dynamic programming procedure to recover optimal exons sets. It reduces redundancies in multiple discoveries of the same gene and resolves conflicting gene predictions on the same strand. MetaEuk is GPL-licensed open source software that is implemented in C++ and available for Linux and macOS. The software is designed to run on multiple cores.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/metaeuk" rel="nofollow">https://github.com/soedinglab/metaeuk</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/42326/edanchin-lab</guid>
  <pubDate>Thu, 19 Nov 2020 08:00:07 -0600</pubDate>
  <link></link>
  <title><![CDATA[Edanchin Lab]]></title>
  <description><![CDATA[
<p>My main topics of interest are:</p>

<p>The impact of non tree-like evolution such as horizontal gene transfers and hybridization on species biology<br />Evolution and adaptation of animals in the absence of sexual reproduction and the underlying mechanisms<br />Genomic signatures of adaptation to a parasitic life-style</p>

<p>More at https://edanchin.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27475/polyphen-2-prediction-of-functional-effects-of-human-nssnps</guid>
	<pubDate>Mon, 23 May 2016 02:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27475/polyphen-2-prediction-of-functional-effects-of-human-nssnps</link>
	<title><![CDATA[PolyPhen-2: Prediction of functional effects of human nsSNPs]]></title>
	<description><![CDATA[<p><strong>PolyPhen-2</strong> (<strong>Poly</strong>morphism <strong>Phen</strong>otyping v<strong>2</strong>) is a tool which predicts possible impact of an amino acid substitution on the structure and function of a human protein using straightforward physical and comparative considerations.</p><p>Address of the bookmark: <a href="http://genetics.bwh.harvard.edu/pph2/" rel="nofollow">http://genetics.bwh.harvard.edu/pph2/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</guid>
	<pubDate>Wed, 25 Apr 2018 04:35:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</link>
	<title><![CDATA[Binding Site Prediction in Protein !]]></title>
	<description><![CDATA[<p><span>The interaction between proteins and other molecules is fundamental to all biological functions. In this section we include tools that can assist in prediction of interaction sites on protein surface and tools for predicting the structure of the intermolecular complex formed between two or more molecules (docking).</span></p><h4>Pockets Identification</h4><p><a href="http://sts.bioengr.uic.edu/castp/" target="_blank">CASTp</a></p><div style="text-align: justify;">Automatic Identification of pockets and cavities in proteins structure, and quantitation of their volumes using Delaunay triangulation. Available also as PyMOL plugin</div><p><a href="http://www.bioinformatics.leeds.ac.uk/pocketfinder/" target="_blank">Pocket-Finder</a></p><div style="text-align: justify;">Automatic identification of pockets and cavities in proteins structure, and quantitation of their volumes.</div><p><a href="http://gecco.org.chemie.uni-frankfurt.de/pocketpicker/index.html" target="_blank">PocketPicker</a></p><div style="text-align: justify;">Grid-based technique for the analysis of protein pockets. PocketPicker available as a plugin for&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/pymol.htm">PyMOL</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><h4>Binding Site Prediction</h4>
<p><a href="http://consurf.tau.ac.il/" target="_blank">ConSurf</a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification of functional regions in proteins by surface-mapping of phylogenetic information</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www-cryst.bioc.cam.ac.uk/~crescendo/crescendo.php" target="_blank">CRESCENDO</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification protein interaction sites. It uses sequence conservation patterns in homologous proteins to distinguish between residues that are conserved due to structural restraints from those due to functional restraints.&nbsp;&nbsp;</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><strong>Ligand Binding Sites</strong></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www.sbg.bio.ic.ac.uk/~3dligandsite/" target="_blank">3DLigandSite</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">The server utilizes protein-structure prediction to provide structural models of the binding site. Ligands bound to structures are superimposed onto the model and use to predict the binding site.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">F<a href="http://cssb.biology.gatech.edu/skolnick/files/FINDSITE/" target="_blank">INDSITE</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">A threading-based method for ligand-binding site prediction and functional annotation based on binding-site similarity across superimposed groups of threading templates.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">
<p><a href="http://scoppi.biotec.tu-dresden.de/pocket/" target="_blank">LIGSITE<sup>csc</sup></a></p>
<div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Prediction of binding site by pocket identification using the Connolly surface and degree of conservation</div>
<p><a href="http://metapocket.eml.org/" target="_blank"></a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://metapocket.eml.org/" target="_blank">metaPocket</a>A meta server for ligand-binding site prediction. metaPocket use&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#ligsite">LIGSITE<sup>csc</sup></a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pass">PASS</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#qsite">Q-SiteFinder</a>&nbsp;and&nbsp;<a href="http://www.biochem.ucl.ac.uk/~roman/surfnet/surfnet.html" target="_blank">SURFNET</a></div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</guid>
	<pubDate>Mon, 10 Sep 2018 13:21:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</link>
	<title><![CDATA[STRUM: structure-based prediction of protein stability changes upon single-point mutation]]></title>
	<description><![CDATA[<p><span>STRUM is a method for predicting the fold stability change (&Delta;&Delta;G) of protein molecules upon single-point nsSNP mutations. STRUM adopts a gradient boosting regression approch to train the Gibbs free-energy changes on a variety of features at different levels of sequence and structure properties. The unique characteristics of STRUM is the combination of sequence profiles with low-resolution structure models from protein structure prediction, which helps enhance the robustness and accuracy of the method and make it applicable to various protein seqences, including those without experimental structures&nbsp;</span></p><p>Address of the bookmark: <a href="https://zhanglab.ccmb.med.umich.edu/STRUM/" rel="nofollow">https://zhanglab.ccmb.med.umich.edu/STRUM/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34386/slidesort-bpr</guid>
	<pubDate>Mon, 20 Nov 2017 09:19:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34386/slidesort-bpr</link>
	<title><![CDATA[SLIDESORT-BPR]]></title>
	<description><![CDATA[<p>Chromosomal rearrangement events are caused by abnormal breaking and rejoining of DNA molecules. They are responsible for many of the cancer related diseases. Detecting the DNA breaking and repairing mechanism, therefore, may offer vital clues about the pathologic causes and diagnostic/therapeutic target of these diseases. But this effort also poses considerable challenges, because the structural variations and the genomes are different from one person to another. Intermediate comparison via reference genome could lead to the loss information. Unlike the current methods which make use the reference genome, we developed a method to detect the breakpoint reads directly from observing the differences between two (or more) NGS short reads samples. Slidesort-BPR is a command line tool implemented in C++.</p><p>Address of the bookmark: <a href="https://github.com/ewijaya/slidesort-bpr" rel="nofollow">https://github.com/ewijaya/slidesort-bpr</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23924/embl-postdoc-position-in-bacterial-gene-gain-loss</guid>
  <pubDate>Thu, 20 Aug 2015 14:09:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[EMBL Postdoc position in Bacterial Gene Gain Loss]]></title>
  <description><![CDATA[
<p>A post-doctoral fellowship is available in the research groups of Nick Goldman (EBI) and John Welch (Genetics Department, Cambridge University) under the EMBL-EBI / Cambridge Computational Biomedical Postdoctoral Fellowship scheme.</p>

<p>The project is on bacterial gene gain and loss and emerging pathogenicity, and is described in full here: https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015 . The EMBL-EBI / Cambridge Computational Biomedical Postdoctoral (“EBPOD”) </p>

<p>The closing date for applications is 3 September 2015. Nick Goldman EMBL-European Bioinformatics Institute Nick Goldman </p>

<p>More at https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015</p>
]]></description>
</item>

</channel>
</rss>