<?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/38041?offset=240</link>
	<atom:link href="https://bioinformaticsonline.com/related/38041?offset=240" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/35125/eugene-v-koonin-lab</guid>
  <pubDate>Tue, 09 Jan 2018 05:01:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Eugene V. Koonin Lab]]></title>
  <description><![CDATA[
<p>Interested in understanding the evolution of life. To obtain glimpses of such understanding, we employ existing and new methods of computational biology to perform research in several major areas.</p>

<p>https://www.ncbi.nlm.nih.gov/research/groups/koonin/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</guid>
	<pubDate>Tue, 06 Mar 2018 05:02:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</link>
	<title><![CDATA[REGEN: Ancestral Genome Reconstruction for Bacteria]]></title>
	<description><![CDATA[<p><span>REGEN infers evolutionary events, including gene creation and deletion and replicon fission and fusion. The reconstruction can be performed by either a maximum parsimony or a maximum likelihood method. Gene content reconstruction is based on the concept of neighboring gene pairs. REGEN was designed to be used with any set of genomes that are sufficiently related, which will usually be the case for bacteria within the same taxonomic order.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.mdpi.com/2073-4425/3/3/423" rel="nofollow">http://www.mdpi.com/2073-4425/3/3/423</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</guid>
	<pubDate>Fri, 04 May 2018 19:18:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</link>
	<title><![CDATA[The MARVEL assembler]]></title>
	<description><![CDATA[<p><span>MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads.</span></p>
<p>The assembly process can be summarized as follows:</p>
<ol>
<li>overlap</li>
<li>patch reads</li>
<li>overlap (again)</li>
<li>scrubbing</li>
<li>assembly graph construction and touring</li>
<li>optional read correction</li>
<li>fasta file creation</li>
</ol><p>Address of the bookmark: <a href="https://github.com/schloi/MARVEL" rel="nofollow">https://github.com/schloi/MARVEL</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</guid>
	<pubDate>Mon, 09 Jul 2018 05:20:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</link>
	<title><![CDATA[ASAR: Advanced metagenomic Sequence Analysis in R]]></title>
	<description><![CDATA[<p><span>An interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.</span></p>
<p><span><span>To read the manual, please click the link&nbsp;</span><a href="https://askarbek-orakov.github.io/ASAR/">https://askarbek-orakov.github.io/ASAR/</a></span></p><p>Address of the bookmark: <a href="https://github.com/Askarbek-orakov/ASAR" rel="nofollow">https://github.com/Askarbek-orakov/ASAR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</guid>
	<pubDate>Wed, 24 Oct 2018 23:35:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37984/baum-%E2%80%93-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus</link>
	<title><![CDATA[BAUM – Improving Genome Assembly by Adaptive Unique Mapping and Local Overlap-Layout-Consensus]]></title>
	<description><![CDATA[<p><span>BAUM, breaks the whole genome into regions by adaptive unique mapping; then the local OLC is used to assemble each region in parallel. BAUM can: (1) perform reference-assisted assembly based on the genome of a close species; (2) or improve the results of existing assemblies that are obtained based on short or long sequencing reads.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/" rel="nofollow">http://www.zhanyuwang.xin/wordpress/index.php/2017/07/21/baum-improving-genome-assembly-by-adaptive-unique-mapping-and-local-overlap-layout-consensus/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</guid>
	<pubDate>Thu, 29 Nov 2018 08:52:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</link>
	<title><![CDATA[SIMBA: a Genome Assembly Project Management System]]></title>
	<description><![CDATA[<p><span>SIMBA</span><span>, SImple Manager for Bacterial Assemblies, is a Web interface for managing assembly projects of bacterial genomes. SIMBA was created to assist bioinformaticians to assemble bacterial genomes sequenced with NextGeneration Sequencing (NGS) platforms quickly, easily and effectively. SIMBA also is open source tool, i.e., can be freely downloaded, shared and modified.</span></p><p>Address of the bookmark: <a href="http://ufmg-simba.sourceforge.net/" rel="nofollow">http://ufmg-simba.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38668/gvolante-completeness-assessment-of-genometranscriptome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:03:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38668/gvolante-completeness-assessment-of-genometranscriptome-sequences</link>
	<title><![CDATA[gVolante: Completeness Assessment of Genome/Transcriptome Sequences]]></title>
	<description><![CDATA[<p><span>A brand-new web server, gVolante, which provides an online tool for (i) on-demand completeness assessment of sequence sets by means of the previously developed pipelines CEGMA and BUSCO and (ii) browsing pre-computed completeness scores for publicly available data in its database section</span></p><p>Address of the bookmark: <a href="https://gvolante.riken.jp/analysis.html" rel="nofollow">https://gvolante.riken.jp/analysis.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/39217/caulobacter-ethensis-20-computer-generated-genome-of-a-living-organism</guid>
	<pubDate>Wed, 03 Apr 2019 08:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39217/caulobacter-ethensis-20-computer-generated-genome-of-a-living-organism</link>
	<title><![CDATA[Caulobacter ethensis - 2.0 : Computer-generated Genome of a Living Organism]]></title>
	<description><![CDATA[<div><span>All the genome sequences of organisms known throughout the world are stored in a database belonging to the National Center for Biotechnology Information in the United States. As of today, the database has an additional entry:&nbsp;<em><strong><span>Caulobacter ethensis</span></strong></em><span><strong><span>-2.0</span></strong>.&nbsp;</span></span></div><div><span><span>&nbsp;</span></span></div><div><span><span>It is the&nbsp;<strong>world's first fully computer-generated genome of a living organism</strong>, developed by scientists at ETH Zurich.&nbsp;</span></span></div><div><span><span>&nbsp;</span></span></div><div><span><span>However, it must be emphasised that although the genome for&nbsp;</span><em>C. ethensis</em>-2.0 was physically produced in the form of a very large DNA molecule, a corresponding organism does not yet exist.</span></div><div><span>&nbsp;</span></div><div><span><strong>Source</strong>:&nbsp;<a href="https://www.sciencedaily.com/releases/2019/04/190401171343.htm?utm_source=feedburner&amp;utm_medium=email&amp;utm_campaign=Feed%3A+sciencedaily%2Fmost_popular+%28Most+Popular+News+--+ScienceDaily%29">https://www.sciencedaily.com/releases/2019/04/190401171343.htm</a></span></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</guid>
	<pubDate>Tue, 06 Aug 2019 21:37:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39821/gvolante-completeness-assessment-of-genometranscriptome-sequences</link>
	<title><![CDATA[gVolante: Completeness Assessment of Genome/Transcriptome Sequences]]></title>
	<description><![CDATA[<p><strong>gVolante</strong><span>&nbsp;provides an online interface for completeness assessment of user&rsquo;s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and transcriptome assemblies.</span></p>
<p><img src="https://gvolante.riken.jp/images/assessment.png" width="937" height="545" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://gvolante.riken.jp/" rel="nofollow">https://gvolante.riken.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>