<?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/32379?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/32379?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</guid>
	<pubDate>Fri, 19 Oct 2018 09:36:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37965/kobas-a-web-server-for-geneprotein-functional-annotation-and-functional-gene-set-enrichment</link>
	<title><![CDATA[KOBAS: a web server for gene/protein functional annotation and functional gene set enrichment]]></title>
	<description><![CDATA[<p><span>KOBAS 3.0 is a web server for gene/protein functional annotation (</span><a href="http://kobas.cbi.pku.edu.cn/annotate.php">Annotate</a><span>&nbsp;module) and functional gene set enrichment(Enrichment module). For Annotate module, it accepts gene list as input, including IDs or sequences, and generates annotations for each gene based on multiple databases about pathways, diseases, and Gene Ontology. For Enrichment module, it can accept either gene list or gene expression data as input, and generates enriched gene sets, corresponding name, p-value or a probability of enrichment and enrichment score based on results of multiple methods.</span></p><p>Address of the bookmark: <a href="http://kobas.cbi.pku.edu.cn/" rel="nofollow">http://kobas.cbi.pku.edu.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</guid>
	<pubDate>Thu, 16 Jun 2016 18:57:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</link>
	<title><![CDATA[clusterProfiler]]></title>
	<description><![CDATA[<p>statistical analysis and visulization of functional profiles for genes and gene clusters<br><br>Bioconductor version: Release (3.3)<br><br>This package implements methods to analyze and visualize functional profiles (GO and KEGG) of gene and gene clusters.<br><br>Author: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt; with contributions from Li-Gen Wang and Giovanni Dall'Olio.<br><br>Maintainer: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt;<br><br>Citation (from within R, enter citation("clusterProfiler")):<br><br>Yu G, Wang L, Han Y and He Q (2012). &ldquo;clusterProfiler: an R package for comparing biological themes among gene clusters.&rdquo; OMICS: A Journal of Integrative Biology, 16(5), pp. 284-287.<br>Installation<br><br>To install this package, start R and enter:<br><br>## try http:// if https:// URLs are not supported<br>source("https://bioconductor.org/biocLite.R")<br>biocLite("clusterProfiler")</p>
<p>https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</guid>
	<pubDate>Wed, 12 Feb 2020 12:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</link>
	<title><![CDATA[netGO: R-Shiny package for network-integrated pathway enrichment analysis]]></title>
	<description><![CDATA[<p>netGO is an R/Shiny package for network-integrated pathway enrichment analysis.<br>netGO provides user-interactive visualization of enrichment analysis results and related networks.</p>
<p>Currently, netGO supports analysis for four species (<em><a href="https://github.com/unistbig/netGO-Data/tree/master/Human">Human</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Mouse">Mouse</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Arabidopsis">Arabidopsis thaliana</a>,and&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Yeast">Yeast</a></em>)<br>These data are available from&nbsp;<a href="https://github.com/unistbig/netGO-Data">netGO-Data</a>&nbsp;repository.</p>
<p><a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635</a></p><p>Address of the bookmark: <a href="https://github.com/unistbig/netGO" rel="nofollow">https://github.com/unistbig/netGO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</guid>
	<pubDate>Thu, 01 Sep 2016 08:02:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</link>
	<title><![CDATA[BRAKER: pipeline for fully automated prediction of protein coding genes with GeneMark-ES/ET and AUGUSTUS in novel eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Gene finding in eukaryotic genomes is notoriously difficult to automate. The task is to design a work flow with a minimal set of tools that would reach state-of-the-art performance across a wide range of species. GeneMark-ET is a gene prediction tool that incorporates RNA-Seq data into unsupervised training and subsequently generates ab initio gene predictions. AUGUSTUS is a gene finder that usually requires supervised training and uses information from RNA-Seq reads in the prediction step. Complementary strengths of GeneMark-ET and AUGUSTUS provided motivation for designing a new combined tool for automatic gene prediction.</span></p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/26559507</p><p>Address of the bookmark: <a href="http://bioinf.uni-greifswald.de/bioinf/braker/" rel="nofollow">http://bioinf.uni-greifswald.de/bioinf/braker/</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/40235/bioinformatics-web-development-course</guid>
	<pubDate>Wed, 06 Nov 2019 20:42:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40235/bioinformatics-web-development-course</link>
	<title><![CDATA[Bioinformatics web development course]]></title>
	<description><![CDATA[<p>This web development course, targeted at Biology and Bioinformatics students, aims at teaching from scratch all the skills needed to setup a fully working Linux web server and to develop and deploy web applications for Bioinformatics.</p>
<p>No previous programming knowledge is assumed. By following this tutorial you will learn the fundamental concepts of programming by using scripting languages: variables, types, arrays, cycles, conditional statements, functions, objects, regular expressions, files reading and manipulation et-cetera.</p><p>Address of the bookmark: <a href="http://www.cellbiol.com/bioinformatics_web_development/introduction/" rel="nofollow">http://www.cellbiol.com/bioinformatics_web_development/introduction/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27238/slurm</guid>
	<pubDate>Wed, 04 May 2016 05:13:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27238/slurm</link>
	<title><![CDATA[SLURM]]></title>
	<description><![CDATA[<p><a href="http://www.schedmd.com/">SLURM</a> workload manager software, a free open-source workload manager designed specifically to satisfy the demanding needs of high performance computing.</p>
<p>This page is a <em>HOWTO</em> guide for setting up a <a href="http://www.schedmd.com/">SLURM</a> installation, currently focused on a CentOS 7 Linux OS. Please send feedback to Ole.H.Nielsen /at/ fysik.dtu.dk.</p>
<p>See the <a href="http://www.schedmd.com/">SLURM</a> homepage (also <a href="https://computing.llnl.gov/linux/slurm/">https://computing.llnl.gov/linux/slurm/</a>).</p><p>Address of the bookmark: <a href="https://wiki.fysik.dtu.dk/niflheim/SLURM" rel="nofollow">https://wiki.fysik.dtu.dk/niflheim/SLURM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27477/cytoscape</guid>
	<pubDate>Mon, 23 May 2016 02:32:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27477/cytoscape</link>
	<title><![CDATA[Cytoscape]]></title>
	<description><![CDATA[<p>Cytoscape is an <a href="http://www.cytoscape.org/download.php">open source</a> software platform for visualizing complex networks and integrating these with any type of attribute data. A lot of <a href="http://apps.cytoscape.org/"><em>Apps</em></a> are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.</p><p>Address of the bookmark: <a href="http://www.cytoscape.org/" rel="nofollow">http://www.cytoscape.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>