<?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/44483?offset=300</link>
	<atom:link href="https://bioinformaticsonline.com/related/44483?offset=300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34734/smash-an-alignment-free-tool-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</guid>
	<pubDate>Thu, 21 Dec 2017 08:26:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34734/smash-an-alignment-free-tool-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</link>
	<title><![CDATA[SMASH: An alignment-free tool to find and visualise rearrangements between pairs of DNA sequences]]></title>
	<description><![CDATA[<p style="text-align: justify;"><span>SMASH is a completely alignment-free method to find and visualise rearrangements between pairs of DNA sequences</span>. The detection is based on&nbsp;<span>relative compression</span>, namely using a FCM, also known as Markov model, of high context order (typically 20). The method has been approached with a tool (also called SMASH). For visualization, SMASH outputs a SVG image, with an ideogram output architecture, where the patterns are represented with several HSV values (only value varies). The following image, illustrating the information maps between human and chimpanzee for the several chromosomes, depicts an example:</p>
<p><a href="https://github.com/pratas/smash/blob/master/imgs/HC.png" target="_blank"><img src="https://github.com/pratas/smash/raw/master/imgs/HC.png" alt="ScreenShot" style="border: 0px;"></a></p>
<p>&nbsp;</p>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/pratas/smash" rel="nofollow">https://github.com/pratas/smash</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</guid>
	<pubDate>Thu, 19 Apr 2018 08:06:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</link>
	<title><![CDATA[Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data]]></title>
	<description><![CDATA[<p><span>Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from&nbsp;</span><a href="https://github.com/meiji-bioinf/heap">https://github.com/meiji-bioinf/heap</a><span>&nbsp;and our web site (</span><a href="http://bioinf.mind.meiji.ac.jp/lab/en/tools.html">http://bioinf.mind.meiji.ac.jp/lab/en/tools.html</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/meiji-bioinf/heap" rel="nofollow">https://github.com/meiji-bioinf/heap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</guid>
	<pubDate>Mon, 09 Jul 2018 05:27:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37259/epiviz-an-interactive-visualization-tool-for-functional-genomics-data</link>
	<title><![CDATA[Epiviz: an interactive visualization tool for functional genomics data.]]></title>
	<description><![CDATA[<p><span>Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other user-supplied visualizations. It also includes data from the&nbsp;</span><a href="http://barcode.luhs.org/" target="_blank">Gene Expression Barcode project</a><span>&nbsp;for transcriptome visualization. It has a flexible plugin framework so users can add</span><a href="http://d3js.org/" target="_blank">d3</a><span>&nbsp;visualizations. You can see a video tour&nbsp;</span><a href="http://youtu.be/099c4wUxozA" target="_blank">here</a><span>.</span></p>
<p><span>https://bioconductor.org/packages/release/bioc/html/epivizr.html</span></p>
<p><span>https://github.com/epiviz</span></p>
<p><span>https://github.com/epiviz/epiviz</span></p><p>Address of the bookmark: <a href="https://epiviz.github.io/" rel="nofollow">https://epiviz.github.io/</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/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:39:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</link>
	<title><![CDATA[SeqMonk:A tool to visualise and analyse high throughput mapped sequence data]]></title>
	<description><![CDATA[<p>SeqMonk is a program to enable the visualisation and analysis of mapped sequence data. It was written for use with mapped next generation sequence data but can in theory be used for any dataset which can be expressed as a series of genomic positions. It's main features are:</p>
<ul>
<li>Import of mapped data from mapped data (BAM/SAM/bowtie etc)</li>
<li>Creation of data groups for visualisation and analysis</li>
<li>Visualisation of mapped regions against an annotated genome.</li>
<li>Flexible quantitation of the mapped data to allow comparisons between data sets</li>
<li>Statistical analysis of data to find regions of interest</li>
<li>Creation of reports containing data and genome annotation</li>
</ul><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Sun, 20 Jan 2019 06:34:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38749/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><span>ClipCrop for detecting SVs with single-base resolution using soft-clipping information. A soft-clipped sequence is an unmatched fragment in a partially mapped read. To assess the performance of ClipCrop with other SV-detecting tools, we generated various patterns of simulation data &ndash; SV lengths, read lengths, and the depth of coverage of short reads &ndash; with insertions, deletions, tandem duplications, inversions and single nucleotide alterations in a human chromosome.&nbsp;</span></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>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</guid>
	<pubDate>Tue, 28 Jan 2020 03:44:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</link>
	<title><![CDATA[vt: a variant tool set that discovers short variants from Next Generation Sequencing data.]]></title>
	<description><![CDATA[<p><span>vt is a variant tool set that discovers short variants from Next Generation Sequencing data.</span></p>
<p><span><a href="https://genome.sph.umich.edu/wiki/Vt">https://genome.sph.umich.edu/wiki/Vt</a></span></p>
<p><a href="https://github.com/atks/vt">https://github.com/atks/vt</a></p><p>Address of the bookmark: <a href="https://genome.sph.umich.edu/wiki/Vt" rel="nofollow">https://genome.sph.umich.edu/wiki/Vt</a></p>]]></description>
	<dc:creator>Jit</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/41916/truvari-structural-variant-comparison-tool-for-vcfs</guid>
	<pubDate>Tue, 30 Jun 2020 21:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</link>
	<title><![CDATA[truvari: Structural variant comparison tool for VCFs]]></title>
	<description><![CDATA[<p>Structural variant comparison tool for VCFs</p>
<p>Given benchmark and comparsion sets of SVs, calculate the recall, precision, and f-measure.</p>
<p><a href="https://github.com/spiralgenetics/www.spiralgenetics.com">Spiral Genetics</a></p>
<p><a href="https://docs.google.com/presentation/d/17mvC1XOpOm7khAbZwF3SgtG2Rl4M9Mro37yF2nN7GhE/edit">Motivation</a></p><p>Address of the bookmark: <a href="https://github.com/spiralgenetics/truvari" rel="nofollow">https://github.com/spiralgenetics/truvari</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>