<?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/43698?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/43698?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</guid>
	<pubDate>Wed, 22 Jun 2016 05:41:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27961/nearhgt</link>
	<title><![CDATA[NearHGT]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the transfer of genetic material between organisms, is crucial for genetic innovation and the evolution of genome architecture. Existing HGT detection algorithms rely on a strong phylogenetic signal distinguishing the transferred sequence from ancestral (vertically derived) genes in its recipient genome. Detecting HGT between closely related species or strains is challenging, as the phylogenetic signal is usually weak and the nucleotide composition is normally nearly identical. Nevertheless, there is a great importance in detecting HGT between congeneric species or strains, especially in clinical microbiology, where understanding the emergence of new virulent and drug-resistant strains is crucial, and often time-sensitive.</p>
<p>We developed a novel, self-contained technique named&nbsp;<em>Near HGT</em>, based on the&nbsp;<em>synteny index</em>, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the&nbsp;<em>constant relative mutability</em>&nbsp;(CRM). Using CRM, the algorithm assigns a confidence score based on &ldquo;unusual&rdquo; sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three&nbsp;<em>E. coli</em>&nbsp;strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.</p>
<p>When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.</p>
<p><strong>Availability:</strong><span>&nbsp;The method is publicly available at</span><a href="http://research.haifa.ac.il/~ssagi/software/nearHGT.zip">http://research.haifa.ac.il/~ssagi/software/nearHGT.zip</a></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35106/alien-hunter-prediction-of-putative-horizontal-gene-transfer-hgt-events</guid>
	<pubDate>Sun, 07 Jan 2018 19:11:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35106/alien-hunter-prediction-of-putative-horizontal-gene-transfer-hgt-events</link>
	<title><![CDATA[Alien_Hunter : prediction of putative Horizontal Gene Transfer (HGT) events]]></title>
	<description><![CDATA[<p>Alien_hunter is an application for the prediction of putative Horizontal Gene Transfer (HGT) events with the implementation of Interpolated Variable Order Motifs (IVOMs).</p>
<p>An IVOM approach exploits compositional biases using variable order motif distributions and captures more reliably the local composition of a sequence compared to fixed-order methods. Optionally the predictions can be parsed into a 2-state 2nd order Hidden Markov Model (HMM), in a change-point detection framework, to optimize the localization of the boundaries of the predicted regions. The predictions (embl format) can be automatically loaded into the freely available Artemis genome viewer.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/alien-hunter" rel="nofollow">http://www.sanger.ac.uk/science/tools/alien-hunter</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37954/biogps-spotlight-on-the-gene-expression-atlas</guid>
	<pubDate>Thu, 18 Oct 2018 12:15:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37954/biogps-spotlight-on-the-gene-expression-atlas</link>
	<title><![CDATA[BioGPS: Spotlight on the Gene Expression Atlas]]></title>
	<description><![CDATA[<p>BioGPS opened 2016 with a publication in Nucleic Acids Research, right after the New Year holiday. Throughout the year, new designs for the site were being created, reviewed, adjusted, reviewed, adjusted, and more review/adjustments in anticipation of a site redesign for 2017. A Plugin registration Blitz was held in March and April; followed by a Plugin Review Blitz in May. The BioGPS spotlight series was also restarted, with spotlights on BGEE, Intermine, and other Intermine-related plugins.</p>
<p>There were ~910,000 requests made to BioGPS in 2016. Requests to BioGPS peaked in March and at the lowest in December.</p><p>Address of the bookmark: <a href="http://biogps.org/" rel="nofollow">http://biogps.org/</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/43877/crowdgo-machine-learning-and-semantic-similarity-guided-consensus-gene-ontology-annotation</guid>
	<pubDate>Thu, 26 May 2022 00:59:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43877/crowdgo-machine-learning-and-semantic-similarity-guided-consensus-gene-ontology-annotation</link>
	<title><![CDATA[CrowdGO: Machine learning and semantic similarity guided consensus Gene Ontology annotation]]></title>
	<description><![CDATA[<p dir="auto">CrowdGO is a protein Gene Ontology predictor using a meta approach, analyzing the predictions of other tools in order to get an improved precision and recall.</p>
<p dir="auto">Please note that the CrowdGO snakemake workflow is currently only tested on Ubuntu. It should work on OSX, but please report any errors to <a href="mailto:maarten.reijnders@unil.ch">maarten.reijnders@unil.ch</a> or create an issue.</p>
<p>https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1010075</p><p>Address of the bookmark: <a href="https://gitlab.com/mreijnders/crowdgo" rel="nofollow">https://gitlab.com/mreijnders/crowdgo</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<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/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</guid>
	<pubDate>Sat, 02 Jun 2018 07:38:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</link>
	<title><![CDATA[GLEAN: an unsupervised learning system to integrate disparate sources of gene structure evidence]]></title>
	<description><![CDATA[<p><span>GLEAN is an unsupervised learning system to integrate disparate sources of gene structure evidence (gene model predictions, EST/protein genomic sequence alignments, SAGE/peptide tags, etc) to produce a consensus gene prediction, without prior training.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/glean-gene/" rel="nofollow">https://sourceforge.net/projects/glean-gene/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38541/geneoverlap-an-r-package-to-test-and-visualize-gene-overlaps</guid>
	<pubDate>Thu, 27 Dec 2018 19:45:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38541/geneoverlap-an-r-package-to-test-and-visualize-gene-overlaps</link>
	<title><![CDATA[GeneOverlap: An R package to test and visualize gene overlaps]]></title>
	<description><![CDATA[<p>Overlapping gene lists can reveal biological meanings and may lead to novel hypotheses. For example, histone modification is an important cellular mechanism that can pack and re-pack chromatin. By making the chromatin structure more dense or loose, the gene expression can be turned on or off. Tri-methylation on lysine 4 of histone H3 (H3K4me3) is associated with gene activation and its genome-wide enrichment can be mapped by using ChIP-seq experiments. Because of its activating role, if we overlap the genes that are bound by H3K4me3 with the genes that are highly expressed, we should expect a positive association. Similary, we can perform such kind of overlapping between the gene lists of different histone modifications with that of various expression groups and establish each histone modification&rsquo;s role in gene regulation.</p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/vignettes/GeneOverlap/inst/doc/GeneOverlap.pdf" rel="nofollow">https://bioconductor.org/packages/release/bioc/vignettes/GeneOverlap/inst/doc/GeneOverlap.pdf</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>

</channel>
</rss>