<?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/36867?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/36867?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</guid>
	<pubDate>Thu, 06 Sep 2018 16:27:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</link>
	<title><![CDATA[LSC: Improving PacBio Long Read Accuracy by Short Read Alignment]]></title>
	<description><![CDATA[<ul>
<li>Added Command line argument support.</li>
<li>Multi-stage execution modes.</li>
<li>Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.</li>
<li>Better compressed intermediate files.</li>
<li>Added utilities folder.</li>
<li>Added support for multiple short read files.</li>
<li>Removed use of configuration file.</li>
</ul><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</guid>
	<pubDate>Fri, 13 Aug 2021 07:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43254/quasr-quantification-and-annotation-of-short-reads-in-r</link>
	<title><![CDATA[QuasR: Quantification and annotation of short reads in R]]></title>
	<description><![CDATA[<p>The <em><a href="https://bioconductor.org/packages/3.14/QuasR">QuasR</a></em> package (short for <em>Qu</em>antify and <em>a</em>nnotate <em>s</em>hort reads in <em>R</em>) integrates the functionality of several <strong>R</strong> packages (such as <em><a href="https://bioconductor.org/packages/3.14/IRanges">IRanges</a></em> <span>(Lawrence et al. 2013)</span> and <em><a href="https://bioconductor.org/packages/3.14/Rsamtools">Rsamtools</a></em>) and external software (e.g.&nbsp;<code>bowtie</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rbowtie">Rbowtie</a></em> package, and <code>HISAT2</code>, through the <em><a href="https://bioconductor.org/packages/3.14/Rhisat2">Rhisat2</a></em> package). The package aims to cover the whole analysis workflow of typical high throughput sequencing experiments, starting from the raw sequence reads, over pre-processing and alignment, up to quantification. A single <strong>R</strong> script can contain all steps of a complete analysis, making it simple to document, reproduce or share the workflow containing all relevant details.</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/QuasR/inst/doc/QuasR.html</a></p>]]></description>
	<dc:creator>Neel</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Tue, 02 Apr 2019 21:54:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39213/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for single molecule sequencing reads, such as those produced by PacBio and Oxford Nanopore Technologies. It is designed for a wide range of datasets, from small bacterial projects to large mammalian-scale assemblies. The package represents a complete pipeline: it takes raw PB / ONT reads as input and outputs polished contigs. Flye also includes a special mode for metagenome assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</guid>
	<pubDate>Fri, 03 Mar 2017 10:14:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</link>
	<title><![CDATA[Multi-metagenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes<br><br>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Radha Agarkar</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/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Tue, 27 Nov 2018 03:38:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;sequencing reads. It does this with a deep&nbsp;<a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a>&nbsp;classifier, using many of the&nbsp;<a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a>&nbsp;that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p>
<ul>
<li><span>Reasons to use Deepbinner</span>:
<ul>
<li>To minimise the number of unclassified reads (use Deepbinner by itself).</li>
<li>To minimise the number of misclassified reads (use Deepbinner in conjunction with Albacore demultiplexing).</li>
<li>You plan on running signal-level downstream analyses, like&nbsp;<a href="https://github.com/jts/nanopolish">Nanopolish</a>. Deepbinner can&nbsp;<a href="https://github.com/rrwick/Deepbinner#using-deepbinner-before-basecalling">demultiplex the fast5 files</a>which makes this easier.</li>
</ul>
</li>
<li><span>Reasons to&nbsp;<em>not</em>&nbsp;use Deepbinner</span>:
<ul>
<li>You only have basecalled reads not the raw fast5 files (which Deepbinner requires).</li>
<li>You have a small/slow computer. Deepbinner is more computationally intensive than&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>.</li>
<li>You used a sequencing/barcoding kit other than&nbsp;<a href="https://github.com/rrwick/Deepbinner/blob/master/models">the ones Deepbinner was trained on</a>.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</guid>
	<pubDate>Sun, 22 Dec 2019 03:48:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40460/sviper-swipe-your-structural-variants-called-on-long-ontpacbio-reads-with-short-exact-illumina-reads</link>
	<title><![CDATA[SViper: Swipe your Structural Variants called on long (ONT/PacBio) reads with short exact (Illumina) reads.]]></title>
	<description><![CDATA[<p>Call sviper</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants
</code></pre>
<p>This will output a&nbsp;<code>polished_variants.vcf</code>&nbsp;file, that contains all the refined variants.</p>
<p>Sometimes it is helpful to look at the polished sequence, e.g. with the IGV browser. In that case you want SViper to output the polished and aligned sequences in a bam file via the option&nbsp;<code>--output-polished-bam</code>:</p>
<pre><code>~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants --output-</code>polished-bam</pre><p>Address of the bookmark: <a href="https://github.com/smehringer/SViper" rel="nofollow">https://github.com/smehringer/SViper</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>