<?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/41592?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/41592?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</guid>
	<pubDate>Fri, 20 May 2016 19:08:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</link>
	<title><![CDATA[Hagfish - assess an assembly through creative use of coverage plots]]></title>
	<description><![CDATA[<p>Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of&nbsp;<em style="font-size: 12.8px;">de novo</em>&nbsp;genome assembly or identification of structural variation in a genome re-sequencing experiment.</p>
<p>Hagfish requires a reference sequence and a&nbsp;<span>paired end</span>&nbsp;re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.</p>
<p>Quick links:&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Install">Installation</a>,<a href="https://github.com/mfiers/hagfish/wiki/Operation">Operation</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/ReadMappers">Read mappers</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Scripts">Hagfish scripts</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Plots">Hagfish plots</a></p><p>Address of the bookmark: <a href="https://github.com/mfiers/hagfish" rel="nofollow">https://github.com/mfiers/hagfish</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Wed, 17 Apr 2019 19:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Breaking-Chimeric-Contigs">Chimeric contig correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding]]></title>
	<description><![CDATA[<p><span>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</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/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Sun, 27 Oct 2019 00:57:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40208/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Misassembly-Correction">Misassembly correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</guid>
	<pubDate>Mon, 04 Feb 2019 04:53:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</link>
	<title><![CDATA[wtdbg2: A fuzzy Bruijn graph approach to long noisy reads assembly]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output.&nbsp;</span></p>
<pre>./wtdbg2 -x rs -g 4.6m -t 16 -i reads.fa.gz -fo prefix
./wtpoa-cns -t 16 -i prefix.ctg.lay.gz -fo prefix.ctg.fa</pre><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</guid>
	<pubDate>Sat, 25 Nov 2017 08:57:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</link>
	<title><![CDATA[coursera genome assembly tutorial]]></title>
	<description><![CDATA[<p><span>Solutions to Coursera Genome Sequencing (Bioinformatics II)</span></p><p>Address of the bookmark: <a href="https://github.com/iansealy/coursera-assembly" rel="nofollow">https://github.com/iansealy/coursera-assembly</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>