<?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?</link>
	<atom:link href="https://bioinformaticsonline.com/related/32379?" 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/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/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/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/news/view/13226/you-and-your-friend-have-similar-dna</guid>
	<pubDate>Sun, 27 Jul 2014 20:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</link>
	<title><![CDATA[You and your friend have similar DNA !!!]]></title>
	<description><![CDATA[<p>New research out of Massachusetts claims that people often choose friends that are similar to them in genetics and they are more accurate than you might suppose. A study published on PNAS&nbsp;http://www.pnas.org/content/111/Supplement_3/10796.full found that people are apt to pick friends who are genetically similar to themselves - so much so that friends tend to be as alike at the genetic level as a person's fourth cousin.</p><div style="text-align: center;"><img src="http://i.kinja-img.com/gawker-media/image/upload/s--CwLwHa43--/18fbmlokxcmqcjpg.jpg" alt="image" width="300" height="271" style="border: 0px; border: 0px;"></div><p>Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes &mdash; a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population.&nbsp;</p><p>The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.</p><p>Reference:</p><p>http://www.pnas.org/content/111/Supplement_3/10796.full</p><p>Image : http://i.kinja-img.com</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</guid>
	<pubDate>Thu, 18 Aug 2016 04:05:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</link>
	<title><![CDATA[A5-miseq]]></title>
	<description><![CDATA[<p><span><span>_A5-miseq_ is a pipeline for assembling DNA sequence data generated on the Illumina sequencing platform. This README will take you through the steps necessary for running _A5-miseq_. </span></span></p>
<p><span>Point to note:</span></p>
<p><span>There are many situations where A5-miseq is not the right tool for the job. In order to produce accurate results, A5-miseq requires Illumina data with certain characteristics. A5-miseq will likely not work well with Illumina reads shorter than around 80nt, or reads where the base qualities are low in all or most reads before 60nt. A5-miseq assumes it is assembling homozygous haploid genomes. Use a different assembler for metagenomes and heterozygous diploid or polyploid organisms. Use a different assembler if a tool like FastQC reports your data quality is dubious. You have been warned! Datasets consisting solely of unpaired reads are not currently supported.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ngopt/" rel="nofollow">https://sourceforge.net/projects/ngopt/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>