<?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/34398?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/34398?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</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/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</guid>
	<pubDate>Mon, 17 Dec 2018 03:17:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</link>
	<title><![CDATA[Purge Haplotigs: Pipeline to help with curating heterozygous diploid genome assemblies]]></title>
	<description><![CDATA[<p>Some parts of a genome may have a very high degree of heterozygosity. This causes contigs for both haplotypes of that part of the genome to be assembled as separate primary contigs, rather than as a contig and an associated haplotig. This can be an issue for downstream analysis whether you're working on the haploid or phased-diploid assembly.</p>
<p><span>Identify pairs of contigs that are syntenic and move one of them to the haplotig 'pool'. The pipeline uses mapped read coverage and Minimap2 alignments to determine which contigs to keep for the haploid assembly. Dotplots are optionally produced for all flagged contig matches, juxtaposed with read-coverage, to help the user determine the proper assignment of any remaining ambiguous contigs. The pipeline will run on either a haploid assembly (i.e. Canu, FALCON or FALCON-Unzip primary contigs) or on a phased-diploid assembly (i.e. FALCON-Unzip primary contigs + haplotigs). Here are&nbsp;</span><a href="https://bitbucket.org/mroachawri/purge_haplotigs/wiki/Examples">two examples</a><span>&nbsp;of how Purge Haplotigs can improve a haploid and diploid assembly.</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/mroachawri/purge_haplotigs" rel="nofollow">https://bitbucket.org/mroachawri/purge_haplotigs</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44168/environmental-genomics-group-scilifelabkth-stockholm</guid>
	<pubDate>Thu, 01 Dec 2022 01:12:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44168/environmental-genomics-group-scilifelabkth-stockholm</link>
	<title><![CDATA[Environmental Genomics Group SciLifeLab/KTH Stockholm]]></title>
	<description><![CDATA[<p>Useful Metagenomics resources</p><p>Address of the bookmark: <a href="https://github.com/envgen" rel="nofollow">https://github.com/envgen</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</guid>
	<pubDate>Sat, 19 Oct 2024 12:23:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</link>
	<title><![CDATA[Variant Calling Pipeline]]></title>
	<description><![CDATA[<p dir="auto">The&nbsp;<a href="https://github.com/Tom-Jenkins/maerl-wgs-pipelines/blob/main/src/variantcalling.nf"><code>variantcalling.nf</code></a>&nbsp;nextflow script will take any number of samples with paired-end reads in FASTQ format, map reads using Bowtie2, process BAM files, and finally call variants using BCFtools v1.21 and/or Freebayes v1.3.6. If part of the pipeline is unsuccessful for a sample then these errors are ignored.</p>
<p dir="auto">Pipeline flowchart:</p>
<div dir="auto">
<div dir="auto">
<div>&nbsp;</div>
<div></div>
</div>
<div>&nbsp;</div>
<div dir="auto">
<h2 dir="auto">Dependencies (version tested)</h2>
<a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md#dependencies-version-tested"></a></div>
<ul dir="auto">
<li>Nextflow (24.04.4)</li>
<li>Java (18.0.2.1)</li>
<li>Python (3.10)</li>
<li>Perl (5.32.1)</li>
<li>Bowtie2 (2.5.3)</li>
<li>SAMtools (1.19.2)</li>
<li>GATK4 (4.5)</li>
<li>BCFtools (1.21)</li>
<li>Freebayes (1.3.6)</li>
</ul>
</div><p>Address of the bookmark: <a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md" rel="nofollow">https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</guid>
	<pubDate>Thu, 23 Nov 2017 08:37:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</link>
	<title><![CDATA[Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence]]></title>
	<description><![CDATA[<p><span>Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp&nbsp;</span><em>Saccharina japonica</em><span>. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at&nbsp;</span><a href="http://sdittami.altervista.org/taxoblast" title="">http://sdittami.altervista.org/taxoblast</a><span>&nbsp;and via SourceForge (</span><a href="https://sourceforge.net/projects/taxoblast" title="">https://sourceforge.net/projects/taxoblast</a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/taxoblast/files/" rel="nofollow">https://sourceforge.net/projects/taxoblast/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</guid>
	<pubDate>Mon, 05 Nov 2018 08:12:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</link>
	<title><![CDATA[MetaPlotR: a Perl/R pipeline for plotting metagenes of nucleotide modifications and other transcriptomic sites]]></title>
	<description><![CDATA[<p><span>An increasing number of studies are mapping protein binding and nucleotide modifications sites throughout the transcriptome. Often, these sites cluster in certain regions of the transcript, giving clues to their function. Hence, it is informative to summarize where in the transcript these sites occur. A metagene is a simple and effective tool for visualizing the distribution of sites along a simplified transcript model. In this work, we introduce MetaPlotR, a Perl/R pipeline for creating metagene plots.</span></p><p>Address of the bookmark: <a href="https://github.com/olarerin/metaPlotR" rel="nofollow">https://github.com/olarerin/metaPlotR</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>