<?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/43090?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/43090?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</guid>
	<pubDate>Tue, 29 May 2018 07:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</link>
	<title><![CDATA[Porechop:  tool for finding and removing adapters from Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Porechop is a tool for finding and removing adapters from <a href="https://nanoporetech.com/">Oxford Nanopore</a> reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.</p>
<p>Porechop also supports demultiplexing of Nanopore reads that were barcoded with the <a href="https://store.nanoporetech.com/native-barcoding-kit-1d.html">Native Barcoding Kit</a>, <a href="https://store.nanoporetech.com/pcr-barcoding-kit-96.html">PCR Barcoding Kit</a> or <a href="https://store.nanoporetech.com/rapid-barcoding-sequencing-kit.html">Rapid Barcoding Kit</a>.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Porechop" rel="nofollow">https://github.com/rrwick/Porechop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</guid>
	<pubDate>Fri, 15 Jun 2018 04:48:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</link>
	<title><![CDATA[mScaffolder: A comparative genome scaffolding tool]]></title>
	<description><![CDATA[<p>A comparative genome scaffolding tool based on MUMmer</p>
<p>mScaffolder scaffolds a genome using an existing high quality genome as the reference. It aligns the two genomes using nucmer utility from MUMmer and then orders and orients the contigs of the candidate genome guided by their alignments to the reference genome. Please send your questions and comments to&nbsp;<a href="mailto:mchakrab@uci.edu">mchakrab@uci.edu</a>.</p>
<p><span>Citation</span><span>&nbsp;</span><a href="https://www.nature.com/articles/s41588-017-0010-y">https://www.nature.com/articles/s41588-017-0010-y</a></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/mscaffolder" rel="nofollow">https://github.com/mahulchak/mscaffolder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</guid>
	<pubDate>Fri, 10 Aug 2018 13:29:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</link>
	<title><![CDATA[FMLRC: a long-read error correction tool using the multi-string Burrows Wheeler Transform]]></title>
	<description><![CDATA[<p><span>FMLRC, or FM-index Long Read Corrector, is a tool for performing hybrid correction of long read sequencing using the BWT and FM-index of short-read sequencing data. Given a BWT of the short-read sequencing data, FMLRC will build an FM-index and use that as an implicit de Bruijn graph. Each long read is then corrected independently by identifying low frequency k-mers in the long read and replacing them with the closest matching high frequency k-mers in the implicit de Bruijn graph. In contrast to other de Bruijn graph based implementations, FMLRC is not restricted to a particular k-mer size and instead uses a two pass method with both a short "k-mer" and a longer "K-mer". This allows FMLRC to correct through low complexity regions that are computational difficult for short k-mers.</span></p><p>Address of the bookmark: <a href="https://github.com/holtjma/fmlrc" rel="nofollow">https://github.com/holtjma/fmlrc</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37837/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Thu, 04 Oct 2018 16:39:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37837/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</link>
	<title><![CDATA[ClipCrop: a tool for detecting structural variations with single-base resolution using soft-clipping information]]></title>
	<description><![CDATA[<p>This is a tool for detecting structural variations using soft-clipping information From&nbsp;<a href="http://samtools.sourceforge.net/SAM1.pdf">SAM</a>&nbsp;files.</p>
<p>https://github.com/shinout/clipcrop</p><p>Address of the bookmark: <a href="https://github.com/shinout/clipcrop" rel="nofollow">https://github.com/shinout/clipcrop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38561/hawkeye-an-interactive-visual-analytics-tool-for-genome-assemblies</guid>
	<pubDate>Tue, 01 Jan 2019 11:56:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38561/hawkeye-an-interactive-visual-analytics-tool-for-genome-assemblies</link>
	<title><![CDATA[Hawkeye: an interactive visual analytics tool for genome assemblies]]></title>
	<description><![CDATA[<p><span>Genome sequencing remains an inexact science, and genome sequences can contain significant errors if they are not carefully examined. Hawkeye is our new visual analytics tool for genome assemblies, designed to aid in identifying and correcting assembly errors. Users can analyze all levels of an assembly along with summary statistics and assembly metrics, and are guided by a ranking component towards likely mis-assemblies. Hawkeye is freely available and released as part of the open source AMOS project&nbsp;</span><span><a href="http://amos.sourceforge.net/hawkeye"><span>http://amos.sourceforge.net/hawkeye</span></a></span><span>.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/gb-2007-8-3-r34</p><p>Address of the bookmark: <a href="http://amos.sourceforge.net/wiki/index.php?title=Hawkeye" rel="nofollow">http://amos.sourceforge.net/wiki/index.php?title=Hawkeye</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</guid>
	<pubDate>Tue, 03 Dec 2019 02:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</link>
	<title><![CDATA[Minipolish: A tool for Racon polishing of miniasm assemblies]]></title>
	<description><![CDATA[<p><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate &ndash; they are essentially made of stitched-together pieces of long reads.</p>
<p><a href="https://github.com/isovic/racon">Racon</a>&nbsp;is a great polishing tool that can be used to clean up assembly errors. It's also very fast and well suited for long-read data. However, it operates on FASTA files, not the&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA graphs</a>&nbsp;that miniasm makes.</p>
<p>That's where Minipolish comes in. With a single command, it will use Racon to polish up a miniasm assembly, while keeping the assembly in graph form.</p>
<p>It also takes care of some of the other nuances of polishing a miniasm assembly:</p>
<ul>
<li>Adding read depth information to contigs</li>
<li>Fixing sequence truncation that can occur in Racon</li>
<li>Adding circularising links to circular contigs if not already present (so they display better in&nbsp;<a href="https://github.com/rrwick/Bandage">Bandage</a>)</li>
<li>'Rotating' circular contigs between polishing rounds to ensure clean circularisation</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Minipolish" rel="nofollow">https://github.com/rrwick/Minipolish</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41920/liftoff-an-accurate-tool-that-maps-annotations-in-gff-or-gtf-between-assemblies</guid>
	<pubDate>Tue, 30 Jun 2020 21:40:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41920/liftoff-an-accurate-tool-that-maps-annotations-in-gff-or-gtf-between-assemblies</link>
	<title><![CDATA[Liftoff: an accurate tool that maps annotations in GFF or GTF between assemblies]]></title>
	<description><![CDATA[<p><span>&nbsp;Liftoff, an accurate tool that maps annotations in GFF or GTF between assemblies of the same, or closely-related species. Unlike current coordinate lift-over tools which require a pre-generated &ldquo;chain&rdquo; file as input, Liftoff is a standalone tool that takes two genome assemblies and a reference annotation as input and outputs an annotation of the target genome.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/agshumate/Liftoff" rel="nofollow">https://github.com/agshumate/Liftoff</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42354/vsfilt-a-tool-to-improve-virtual-screening-by-structural-filtration-of-docking-poses</guid>
	<pubDate>Wed, 25 Nov 2020 02:39:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42354/vsfilt-a-tool-to-improve-virtual-screening-by-structural-filtration-of-docking-poses</link>
	<title><![CDATA[vsFilt: A tool to improve virtual screening by structural filtration of docking poses]]></title>
	<description><![CDATA[<p><span>The vsFilt is the first open application for post-docking structural filtration, available as a web-server. The new tool is easy to use and configure to detect a wide range of interaction types that are known to be involved in molecular recognition, including hydrogen and halogen bonds, ionic interactions, hydrophobic contacts, &pi;-stacking, and cation-&pi; interactions. The web-server can process large libraries of up to 150&rsquo;000 docked ligand poses. The results are web-based and can be operated on-line using the built-in HTML5 interactive analysis tools, or can be downloaded for a local use. The vsFilt is freely available on-line, no login required.</span></p><p>Address of the bookmark: <a href="https://biokinet.belozersky.msu.ru/vsfilt" rel="nofollow">https://biokinet.belozersky.msu.ru/vsfilt</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>