<?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/37965?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/37965?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33983/web-apollo-a-web-based-genomic-annotation-editing-platform</guid>
	<pubDate>Fri, 28 Jul 2017 04:48:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33983/web-apollo-a-web-based-genomic-annotation-editing-platform</link>
	<title><![CDATA[Web Apollo: a web-based genomic annotation editing platform]]></title>
	<description><![CDATA[<p><span>Web Apollo is the first instantaneous, collaborative genomic annotation editor available on the web. One of the natural consequences following from current advances in sequencing technology is that there are more and more researchers sequencing new genomes. These researchers require tools to describe the functional features of their newly sequenced genomes. With Web Apollo researchers can use any of the common browsers (for example, Chrome or Firefox) to jointly analyze and precisely describe the features of a genome in real time, whether they are in the same room or working from opposite sides of the world.</span></p><p>Address of the bookmark: <a href="http://genomearchitect.github.io/" rel="nofollow">http://genomearchitect.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41820/shinygo-v061-gene-ontology-enrichment-analysis-more</guid>
	<pubDate>Wed, 03 Jun 2020 08:00:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41820/shinygo-v061-gene-ontology-enrichment-analysis-more</link>
	<title><![CDATA[ShinyGO v0.61: Gene Ontology Enrichment Analysis + more]]></title>
	<description><![CDATA[<p>2/3/2020: Now published by&nbsp;<a href="https://doi.org/10.1093/bioinformatics/btz931" target="_blank">Bioinformatics.</a></p>
<p>11/3/2019: V 0.61, Improve graphical visualization (thanks to reviewers). Interactive networks and much more.</p>
<p>5/20/2019: V.0.60, Annotation database updated to Ensembl 96. New bacterial and fungal genomes based on STRING-db! Just paste your gene list to get enriched GO terms and othe pathways for over 315 plant and animal species, based on annotation from Ensembl (Release 96), Ensembl plants (R. 43) and Ensembl Metazoa (R. 43). An additional 2031 genomes (including bacteria and fungi) are annotated based on STRING-db (v.10). In addition, it also produces KEGG pathway diagrams with your genes highlighted, hierarchical clustering trees and networks summarizing overlapping terms/pathways, protein-protein interaction networks, gene characterristics plots, and enriched promoter motifs.&nbsp;</p><p>Address of the bookmark: <a href="http://bioinformatics.sdstate.edu/go/" rel="nofollow">http://bioinformatics.sdstate.edu/go/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</guid>
	<pubDate>Thu, 13 Aug 2020 10:06:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</link>
	<title><![CDATA[PyParanoid: a pipeline for rapid identification of homologous gene families in a set of genomes]]></title>
	<description><![CDATA[<p>PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends on performing a all-vs-all sequence comparison, usually using BLAST, to determine homology. However, these methods are computationally expensive, requiring&nbsp;O(n2)&nbsp;resources to identify RBHs. This is problematic, as the modern deluge of sequencing data means that comparative genomics analyses could be performed on datasets of thousands of strains.</p><p>Address of the bookmark: <a href="https://github.com/ryanmelnyk/PyParanoid" rel="nofollow">https://github.com/ryanmelnyk/PyParanoid</a></p>]]></description>
	<dc:creator>BioStar</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/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</guid>
	<pubDate>Sun, 02 Feb 2020 14:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40865/dminda2-an-integrated-web-server-for-dna-motif-identification-and-analyses</link>
	<title><![CDATA[DMINDA2: an integrated web server for DNA motif identification and analyses]]></title>
	<description><![CDATA[<p><span>DMINDA (</span><strong>D</strong><span>NA&nbsp;</span><strong>m</strong><span>otif&nbsp;</span><strong>i</strong><span>dentification a</span><strong>nd a</strong><span>nalyses) is an integrated web server for DNA motif identification and analyses</span></p>
<p><span>More at&nbsp;http://bmbl.sdstate.edu/DMINDA2/</span></p>
<p><span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4086085/</a></span></p><p>Address of the bookmark: <a href="http://bmbl.sdstate.edu/DMINDA2/" rel="nofollow">http://bmbl.sdstate.edu/DMINDA2/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/2518/genome-browsers</guid>
	<pubDate>Fri, 16 Aug 2013 19:04:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/2518/genome-browsers</link>
	<title><![CDATA[Genome Browsers]]></title>
	<description><![CDATA[<p>Genome Browser is the platform/database used for searching and retreiving sequences and annotation of genomes belong to various eukaryotes, prokaryotes, etc.</p><p>Following are the weblink for different available browsers:</p><p><a href="http://www.ensembl.org/index.html">http://www.ensembl.org/index.html</a></p><p><a href="http://ensemblgenomes.org/">http://ensemblgenomes.org/</a></p><p><a href="http://genome.ucsc.edu/">http://genome.ucsc.edu/</a></p><p><a href="http://www.ncbi.nlm.nih.gov/genome">http://www.ncbi.nlm.nih.gov/genome</a></p><p><a href="http://www.ebi.ac.uk/genomes/">http://www.ebi.ac.uk/genomes/</a></p><p><a href="http://flybase.org/">http://flybase.org/</a></p><p><a href="http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi">http://cmr.jcvi.org/tigr-scripts/CMR/CmrHomePage.cgi</a></p><p><a href="http://www.sanger.ac.uk/resources/databases/">http://www.sanger.ac.uk/resources/databases/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26303/maker</guid>
	<pubDate>Sun, 07 Feb 2016 15:59:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26303/maker</link>
	<title><![CDATA[MAKER]]></title>
	<description><![CDATA[<p>MAKER is a portable and easily configurable genome annotation pipeline.Its purpose is to allow smaller eukaryotic and prokaryotic genome projects to independently annotate their genomes and to create genome databases. MAKER identifies repeats, aligns ESTs and proteins to a genome, produces ab-initio gene predictions and automatically synthesizes these data into gene annotations having evidence-based quality values.</p>
<p>More at http://www.yandell-lab.org/software/maker.html</p><p>Address of the bookmark: <a href="http://www.yandell-lab.org/software/maker.html" rel="nofollow">http://www.yandell-lab.org/software/maker.html</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26375/ncbi-remap</guid>
	<pubDate>Thu, 11 Feb 2016 11:02:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26375/ncbi-remap</link>
	<title><![CDATA[NCBI Remap]]></title>
	<description><![CDATA[<p><span><span><strong>NCBI Remap</strong>. This tool is conceptually similar to liftOver in that in manages conversions between a pair of genome assemblies but it uses different methods to achieve these mappings. It is also available through a simple <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap">web interface</a> or you can use the <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap/docs/api">API for NCBI Remap</a>.</span></span></p>
<p><span><span>More at http://www.ncbi.nlm.nih.gov/genome/tools/remap</span></span></p>
<p><span><span>API http://www.ncbi.nlm.nih.gov/genome/tools/remap/docs/api</span></span></p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/genome/tools/remap" rel="nofollow">http://www.ncbi.nlm.nih.gov/genome/tools/remap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28870/genemania</guid>
	<pubDate>Mon, 22 Aug 2016 09:55:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28870/genemania</link>
	<title><![CDATA[GeneMANIA]]></title>
	<description><![CDATA[<p>Faster, more accurate algorithms function prediction "GeneMANIA (Multiple Association Network Integration Algorithm)" have however been developed in recent years and are publicly available on the web, indicating the future direction of function prediction.</p><p>Address of the bookmark: <a href="http://genemania.org/" rel="nofollow">http://genemania.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</guid>
	<pubDate>Fri, 05 May 2017 06:11:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</link>
	<title><![CDATA[Bacterial genome assembly !!]]></title>
	<description><![CDATA[<p>This tutorial will serve as an example of how to use free and open-source genome assembly and secondary scaffolding tools to generate high quality assemblies of&nbsp;bacterial sequence data. The bacterial sample used in this tutorial will be referred&nbsp;to simply&nbsp;as &ldquo;Species&rdquo; since it is&nbsp;live data. This data is paired-end data, meaning that there are forward and reverse reads, which we will designate as Sample_R1.fastq and Sample_R2.fastq, respectively.</p>
<p>https://github.com/jennomics/WorkflowPaper/blob/master/Genome%20Assembly%20and%20Annotation.md</p><p>Address of the bookmark: <a href="http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/" rel="nofollow">http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>