<?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/35571?offset=210</link>
	<atom:link href="https://bioinformaticsonline.com/related/35571?offset=210" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/32719/download-assemblies-from-ncbi</guid>
	<pubDate>Mon, 15 May 2017 06:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/32719/download-assemblies-from-ncbi</link>
	<title><![CDATA[Download assemblies from NCBI]]></title>
	<description><![CDATA[<p>A new &ldquo;Download assemblies&rdquo; button is now available in the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/assembly" target="_blank">Assembly</a>&nbsp;database. This makes it easy to download data for multiple genomes without having to write scripts.</p><p>For example, you can run a search in Assembly and use check boxes (see left side of screenshot below) to refine the set of genome assemblies of interest. Then, just open the &ldquo;Download assemblies&rdquo; menu, choose the source database (<a href="https://www.ncbi.nlm.nih.gov/genbank/" target="_blank">GenBank</a>&nbsp;or&nbsp;<a href="https://www.ncbi.nlm.nih.gov/refseq/" target="_blank">RefSeq</a>), choose the file type, and start the download. An archive file will be saved to your computer that can be expanded into a folder containing your selected genome data files.</p><p><img src="https://ncbiinsights.files.wordpress.com/2017/05/download_button.jpg?w=584" alt="image" width="584" height="444" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>More at&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2017/05/08/genome-data-download-made-easy/</p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</guid>
	<pubDate>Thu, 28 Dec 2017 09:43:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</link>
	<title><![CDATA[Rectangle Graph for Repeat Resolution in Genome Assembly]]></title>
	<description><![CDATA[<p>Ultimate tool for resolving repeats in genome assemblies.</p>
<p>Though the specific implementation of the idea of the rectangle graph approach is already included into the&nbsp;<a href="http://bioinf.spbau.ru/spades">current SPAdes distribution</a>, we're also releasing the Rectangle Graph Module (RGM) as the separate code which can be run independently of SPAdes. Although RGM differs from the current implementation of the rectangle graph approach in SPAdes, in the future we plan to integrate RGM in SPAdes. RGM can be run with other genome assemblers if they use the graph format as SPAdes files.</p>
<p>For more details see: Nikolay Vyahhi, Son K. Pham, Pavel Pevzner.&nbsp;<a href="http://www.springerlink.com/content/e617788h25u36440/">From de Bruijn Graphs to Rectangle Graphs for Genome Assembly</a>,&nbsp;<em>Lecture Notes in Bioinformatics</em>&nbsp;7534 (2012), pp. 249-261.</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/en/rectangles" rel="nofollow">http://bioinf.spbau.ru/en/rectangles</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</guid>
	<pubDate>Mon, 11 Jun 2018 05:43:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</link>
	<title><![CDATA[GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments]]></title>
	<description><![CDATA[GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap closure. We demonstrate with sequencing data from various organisms that the gap-closing accuracy of GMcloser is 3–100-fold higher than those of other available tools, with similar efficiency.

https://academic.oup.com/bioinformatics/article/31/23/3733/209212<p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/23/3733/209212" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/23/3733/209212</a></p>]]></description>
	<dc:creator>Shruti Paniwala</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/40573/de-novo-genome-assembly-for-illumina-data</guid>
	<pubDate>Mon, 20 Jan 2020 05:13:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40573/de-novo-genome-assembly-for-illumina-data</link>
	<title><![CDATA[De novo Genome Assembly for Illumina Data]]></title>
	<description><![CDATA[<p>Written and maintained by <a href="mailto:simon.gladman@unimelb.edu.au">Simon Gladman</a> - Melbourne Bioinformatics (formerly VLSCI)</p>
<p>Protocol Overview / Introduction</p>
<p>In this protocol we discuss and outline the process of de novo assembly for small to medium sized genomes.</p>
<p>https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</p><p>Address of the bookmark: <a href="https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/" rel="nofollow">https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43315/genome-assembly-workshop-2020</guid>
	<pubDate>Wed, 25 Aug 2021 04:30:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43315/genome-assembly-workshop-2020</link>
	<title><![CDATA[Genome Assembly Workshop 2020]]></title>
	<description><![CDATA[<p><span>Our team offers custom bioinformatics services to academic and private organizations. We have a strong academic background with a focus on cutting edge, open source software. We replicate standard analysis pipelines (best practices) when appropriate, and/or develop novel applications and pipelines when needed, however we always emphasize biological interpretation of the data.</span></p>
<p><span>More at&nbsp;https://ucdavis-bioinformatics-training.github.io/</span></p><p>Address of the bookmark: <a href="https://ucdavis-bioinformatics-training.github.io/2020-Genome_Assembly_Workshop/snakemake/snakemake_intro" rel="nofollow">https://ucdavis-bioinformatics-training.github.io/2020-Genome_Assembly_Workshop/snakemake/snakemake_intro</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44223/ale-assembly-likelihood-estimator</guid>
	<pubDate>Wed, 08 Mar 2023 01:39:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44223/ale-assembly-likelihood-estimator</link>
	<title><![CDATA[ALE: Assembly Likelihood Estimator]]></title>
	<description><![CDATA[<p>Just import the assembly, bam and ALE scores. You can convert the .ale file to a set of .wig files with ale2wiggle.py and IGV can read those directly.&nbsp; Depending on your genome size you may want to convert the .wig files to the BigWig format.</p><p>Address of the bookmark: <a href="https://github.com/sc932/ALE" rel="nofollow">https://github.com/sc932/ALE</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</guid>
	<pubDate>Tue, 14 Nov 2017 10:26:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</link>
	<title><![CDATA[DFAST: a flexible prokaryotic genome annotation pipeline for faster genome publication]]></title>
	<description><![CDATA[<p>We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its first launch in 2016. Here, we present a newly implemented background annotation engine for DFAST, which is also available as a standalone command-line program. The new engine can annotate a typical-sized bacterial genome within 10 minutes, with rich information such as pseudogenes, translation exceptions, and orthologous gene assignment between given reference genomes. In addition, the modular framework of DFAST allows users to customize the annotation workflow easily and will also facilitate extensions for new functions and incorporation of new tools in the future.</p>
<div>Availability and Implementation</div>
<p>The software is implemented in Python 3 and runs in both Python 2.7 and 3.4&ndash; on Macintosh and Linux systems. It is freely available at&nbsp;<a href="https://github.com/nigyta/dfast_core/" target="">https://github.com/nigyta/dfast_core/</a>&nbsp;under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at&nbsp;<a href="https://dfast.nig.ac.jp/" target="">https://dfast.nig.ac.jp/</a>.</p><p>Address of the bookmark: <a href="https://dfast.nig.ac.jp/" rel="nofollow">https://dfast.nig.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Tue, 12 Jun 2018 08:14:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[P_RNA_scaffolder, a fast and accurate tool using paired-end RNA-sequencing reads to scaffold genomes. This tool aims to improve the completeness of both protein-coding and non-coding genes. After this tool was applied to scaffolding human contigs, the structures of both protein-coding genes and circular RNAs were almost completely recovered and equivalent to those in a complete genome, especially for long proteins and long circular RNAs.<p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>