<?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/42619?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/42619?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</guid>
	<pubDate>Tue, 14 Jul 2020 06:42:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</link>
	<title><![CDATA[ShadowCaster: a hybrid approach for the detection of horizontal gene transfer events in prokaryotes]]></title>
	<description><![CDATA[<p><span>ShadowCaster implements an evolutionary model to calculate Bayesian likelihoods for each &lsquo;alien genes&rsquo; with an unusual sequence composition according to the host genome background to detect HGT events in prokaryotes.</span></p>
<p><a href="https://www.mdpi.com/2073-4425/11/7/756/htm">https://www.mdpi.com/2073-4425/11/7/756/htm</a></p>
<p><a href="https://shadowcaster.readthedocs.io/en/latest/">https://shadowcaster.readthedocs.io/en/latest/</a></p>
<p><a href="https://github.com/dani2s/ShadowCaster_testData">https://github.com/dani2s/ShadowCaster_testData</a></p><p>Address of the bookmark: <a href="https://github.com/dani2s/ShadowCaster" rel="nofollow">https://github.com/dani2s/ShadowCaster</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</guid>
	<pubDate>Sat, 03 Jun 2023 19:19:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</link>
	<title><![CDATA[homologizer: Phylogenetic phasing of gene copies into polyploid subgenomes]]></title>
	<description><![CDATA[<p dir="auto">This tutorial describes the usage of&nbsp;<code>homologizer</code>&nbsp;to phase gene copies into polyploid subgenomes. The tutorial is an abbreviated version of a soon-to-be published paper in Methods in Molecular Biology. Please see that paper for many more details and practical considerations for running&nbsp;<code>homologizer</code>&nbsp;analyses. If you use&nbsp;<code>homologizer</code>, please cite the paper in which we first describe the method:</p>
<ul dir="auto">
<li>Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes.&nbsp;<em>bioRxiv</em>&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.10.22.351486v4">2020.10.22.351486v4</a></li>
</ul>
<p dir="auto"><code>homologizer</code>&nbsp;is implemented in&nbsp;<code>RevBayes</code>. Please see&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>&nbsp;to download and install&nbsp;<code>RevBayes</code>. For users without previous&nbsp;<code>RevBayes</code>&nbsp;experience, we recommend the tutorials at&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>.</p><p>Address of the bookmark: <a href="https://github.com/wf8/homologizer" rel="nofollow">https://github.com/wf8/homologizer</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/38649/ngs-platforms-launched-by-bgi%E2%80%99s-mgi-tech</guid>
	<pubDate>Thu, 10 Jan 2019 04:42:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/38649/ngs-platforms-launched-by-bgi%E2%80%99s-mgi-tech</link>
	<title><![CDATA[NGS Platforms launched by BGI’s MGI Tech]]></title>
	<description><![CDATA[<p>MGI Tech Co., Ltd. (MGI), a subsidiary of BGI Group, is committed to enabling effective and affordable healthcare solutions for all. Based on its proprietary technology, MGI produces sequencing devices, equipment, consumables and reagents to support life science research, medicine and healthcare. MGI's multi-omics platforms include genetic sequencing, mass spectrometry and medical imaging. Providing real-time, comprehensive, life-long solutions, its mission&nbsp;is to&nbsp;develop and promote advanced life science tools for future healthcare.</p><p>MGI, a subsidiary of global genomics leader BGI Group, announced pricing and its first early access customer for the new ultra high-throughput sequencer, MGISEQ-T7, saying it has driven down sequencing cost to&nbsp;$5&nbsp;per gigabyte, with exceptionally high accuracy. Such innovations are helping more people to realize the benefits of genomic information.</p><p>In October, MGI launched the MGISEQ-T7, a highly flexible production-scale platform that is the most powerful sequencer to date. It can produce as many as 60 whole human genomes in one day. The instrument sells for&nbsp;$1 million.</p><p>The T7 enables simultaneous but independent operation of up to four flow cells, which means different applications such as single-cell RNA sequencing, whole exome sequencing and whole genome sequencing can be run in different flow cells at the same time. This helps to reduce costs, allowing MGI to offer the most competitive sequencing price in the market.</p><p><span>Powered by DNBseq&trade;, MGISEQ delivers quality data with accuracy for SNP and Indel calling rate of 99.9% and 99%, respectively, along with decreased duplication rate down to less than 2 percent, and almost zero Index mis-assignment rate.</span></p><p><span><span>SOURCE MGI</span></span></p><p>https://www.bgi.com/global/company/news/bgis-mgi-tech-launches-two-new-ngs-platforms/</p><p>http://en.mgitech.cn/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</guid>
	<pubDate>Fri, 05 Jan 2018 04:12:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</link>
	<title><![CDATA[proovread : large-scale high-accuracy PacBio correction through iterative short read consensus]]></title>
	<description><![CDATA[<p>proovread : large-scale high-accuracy PacBio correction through iterative short read consensus</p>
<ul>
<li>outperforms PacBioToCA/LSC in terms of accuracy and contiguity/sensitivity (<a href="http://dx.doi.org/10.1093/bioinformatics/btu392">http://dx.doi.org/10.1093/bioinformatics/btu392</a>)</li>
<li>is easy to install/run/configure</li>
<li>supports various types of dat
<ul>
<li><strong>HiSeq/MiSeq&nbsp;</strong>(100-500bp)</li>
<li><strong>Unitigs</strong></li>
<li>454, ...</li>
</ul>
</li>
</ul>
<p>proovread maps high coverage data to pacbio reads (bwa mem, blasr, daligner) in multiple iterations.</p><p>Address of the bookmark: <a href="https://github.com/BioInf-Wuerzburg/proovread" rel="nofollow">https://github.com/BioInf-Wuerzburg/proovread</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4211/socbin-bioinformatics-2014</guid>
  <pubDate>Tue, 03 Sep 2013 18:50:20 -0500</pubDate>
  <link></link>
  <title><![CDATA[SocBiN Bioinformatics 2014]]></title>
  <description><![CDATA[
<p>14th annual conference in Bioinformatics</p>

<p>Date : June 10-13</p>

<p>Organizers: The Society for Bioinformatics in Northern European countries (SocBiN) and the Norwegian Bioinformatics Platform / ELIXIR.NO </p>

<p>Venue: Department of Informatics, University of Oslo, Norway</p>

<p>Topics:<br />Tools and technologies for integrative bioinformatics<br />Metagenomics<br />Comparative genomics and phylogeny<br />Post-ENCODE bioinformatics<br />Gene regulation<br />Cancer genomes<br />Marine genomics</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</guid>
	<pubDate>Wed, 14 Nov 2018 04:50:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</link>
	<title><![CDATA[MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph]]></title>
	<description><![CDATA[<p><span>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct&nbsp;</span><em>de Bruijn</em><span>&nbsp;graph (SdBG) to achieve low memory assembly. MEGAHIT can&nbsp;</span><span>optionally</span><span>&nbsp;utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.</span></p>
<p><span>https://academic.oup.com/bioinformatics/article/31/10/1674/177884</span></p><p>Address of the bookmark: <a href="https://github.com/voutcn/megahit" rel="nofollow">https://github.com/voutcn/megahit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</guid>
	<pubDate>Thu, 29 Apr 2021 23:39:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</link>
	<title><![CDATA[CoverM: Read coverage calculator for metagenomics]]></title>
	<description><![CDATA[<p>CoverM aims to be a configurable, easy to use and fast DNA read coverage and relative abundance calculator focused on metagenomics applications.</p>
<p>CoverM calculates coverage of genomes/MAGs&nbsp;<code>coverm genome</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-genome.html">help</a>) or individual contigs&nbsp;<code>coverm contig</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-contig.html">help</a>). Calculating coverage by read mapping, its input can either be BAM files sorted by reference, or raw reads and reference genomes in various formats.</p><p>Address of the bookmark: <a href="https://github.com/wwood/CoverM" rel="nofollow">https://github.com/wwood/CoverM</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4591/the-breitbart-lab</guid>
  <pubDate>Tue, 17 Sep 2013 18:19:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Breitbart lab]]></title>
  <description><![CDATA[
<p>Breitbart’s lab has created a new branch of biology called metagenomics in which one can sample and sequence genetic material collected from the environment.</p>

<p>Breitbart lab is located in the College of Marine Science at the University of South Florida. She is chosen as top "10 Brilliant" scientist by Popular Science magazine.<br />http://www.popsci.com/science/article/2013-09/mya-breitbart</p>

<p>Lab Link:<br />https://sites.google.com/site/breitbartgenomicslab/<br />http://www.marine.usf.edu/faculty/mya-breitbart.shtml</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</guid>
	<pubDate>Mon, 06 Mar 2017 04:03:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</link>
	<title><![CDATA[MaxBin: software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm.]]></title>
	<description><![CDATA[<p><span>MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page.</span><br><br><span>Users can use MEGAN or similar software on MaxBin bins to find the taxonomy of each bin after the binning process is finished.</span></p>
<p>https://academic.oup.com/bioinformatics/article/32/4/605/1744462/MaxBin-2-0-an-automated-binning-algorithm-to<br><br><span>The most recent version of MaxBin is 2.2, which supports the analysis of coassemblies of multiple samples. It is available at this JBEI downloads sites as well as&nbsp;</span><a href="https://sourceforge.net/projects/maxbin/" target="_blank">MaxBin</a><span>&nbsp;and&nbsp;</span><a href="https://sourceforge.net/projects/maxbin2/" target="_blank">MaxBin 2.0</a><span>&nbsp;sourceforge sites.</span></p><p>Address of the bookmark: <a href="http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html" rel="nofollow">http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>