<?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/43384?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/43384?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</guid>
	<pubDate>Tue, 14 Nov 2017 10:26:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</link>
	<title><![CDATA[DFAST: a flexible prokaryotic genome annotation pipeline for faster genome publication]]></title>
	<description><![CDATA[<p>We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its first launch in 2016. Here, we present a newly implemented background annotation engine for DFAST, which is also available as a standalone command-line program. The new engine can annotate a typical-sized bacterial genome within 10 minutes, with rich information such as pseudogenes, translation exceptions, and orthologous gene assignment between given reference genomes. In addition, the modular framework of DFAST allows users to customize the annotation workflow easily and will also facilitate extensions for new functions and incorporation of new tools in the future.</p>
<div>Availability and Implementation</div>
<p>The software is implemented in Python 3 and runs in both Python 2.7 and 3.4&ndash; on Macintosh and Linux systems. It is freely available at&nbsp;<a href="https://github.com/nigyta/dfast_core/" target="">https://github.com/nigyta/dfast_core/</a>&nbsp;under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at&nbsp;<a href="https://dfast.nig.ac.jp/" target="">https://dfast.nig.ac.jp/</a>.</p><p>Address of the bookmark: <a href="https://dfast.nig.ac.jp/" rel="nofollow">https://dfast.nig.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34931/3d-dna-3d-de-novo-assembly-3d-dna-pipeline</guid>
	<pubDate>Thu, 28 Dec 2017 10:09:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34931/3d-dna-3d-de-novo-assembly-3d-dna-pipeline</link>
	<title><![CDATA[3d-dna: 3D de novo assembly (3D DNA) pipeline]]></title>
	<description><![CDATA[<p>This code is designed to enable anyone to reproduce the Hs2-HiC and the AaegL4 genomes reported in:&nbsp;<a href="http://science.sciencemag.org/content/early/2017/03/22/science.aal3327.full">Dudchenko et al., De novo assembly of the Aedes aegypti genome using Hi-C yields chromosome-length scaffolds. Science, 2017.</a></p>
<p>Unless otherwise noted, all terminology below is consistent with this paper, and all references to figures and tables in this readme refer to this paper. Specifically, some of the terminology used below is outlined in&nbsp;<code>Figure S2</code>. The assembly procedure is described in detail in the&nbsp;<a href="http://science.sciencemag.org/content/suppl/2017/03/22/science.aal3327.DC1?_ga=1.9816115.760837492.1490574064">Supporting Online Materials</a>, specifically in the section labelled &ldquo;Pipeline description&rdquo;.</p>
<p>In addition, the pipeline uses tools and methods from&nbsp;<a href="http://www.cell.com/cell-systems/abstract/S2405-4712(16)30219-8">Juicer (Durand &amp; Shamim et al., Cell Systems, 2016)</a>&nbsp;and&nbsp;<a href="http://www.cell.com/cell-systems/abstract/S2405-4712(15)00054-X">Juicebox (Durand &amp; Robinson et al., Cell Systems, 2016)</a>, as well as additional dependencies noted below.</p>
<p>Feel free to post your questions and comments at:&nbsp;<a href="http://www.aidenlab.org/forum.html">http://www.aidenlab.org/forum.html</a></p>
<p>http://aidenlab.org/documentation.html</p><p>Address of the bookmark: <a href="https://github.com/theaidenlab/3d-dna" rel="nofollow">https://github.com/theaidenlab/3d-dna</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38666/mcat-motif-combining-and-association-tool</guid>
	<pubDate>Sun, 13 Jan 2019 06:27:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38666/mcat-motif-combining-and-association-tool</link>
	<title><![CDATA[MCAT: Motif Combining and Association Tool]]></title>
	<description><![CDATA[<p>This is a pipeline for finding motifs in fasta files.<br>It can be run from the command line as follows:</p>
<p>usage: orange_pipeline_refine.py [-h] [-w W] [--nmotifs NMOTIFS] [--iter ITER] [-c C]<br>[-s S] [-d] [-ff] [-v V]<br>positive_seq negative_seq</p>
<p>positional arguments:<br>positive_seq the fasta file for the positive sequences<br>negative_seq the fasta file for the negative sequences</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/yanshen43/MCAT" rel="nofollow">https://github.com/yanshen43/MCAT</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39843/dnapipete-a-pipeline-designed-to-find-annotate-and-quantify-transposable-elements</guid>
	<pubDate>Mon, 12 Aug 2019 21:56:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39843/dnapipete-a-pipeline-designed-to-find-annotate-and-quantify-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: a pipeline designed to find, annotate and quantify Transposable Elements]]></title>
	<description><![CDATA[<p><span>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</span></p>
<p><span><a href="https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home">https://github.com/clemgoub/dnaPipeTE/wiki/dnaPipeTE-WIKI-home</a></span></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41893/sunbeam-a-robust-extensible-metagenomics-pipeline</guid>
	<pubDate>Thu, 18 Jun 2020 06:58:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41893/sunbeam-a-robust-extensible-metagenomics-pipeline</link>
	<title><![CDATA[sunbeam: A robust, extensible metagenomics pipeline]]></title>
	<description><![CDATA[<p><span>Sunbeam is a pipeline written in&nbsp;</span><a href="http://snakemake.readthedocs.io/">snakemake</a><span>&nbsp;that simplifies and automates many of the steps in metagenomic sequencing analysis. It uses&nbsp;</span><a href="http://conda.io/">conda</a><span>&nbsp;to manage dependencies, so it doesn't have pre-existing dependencies or admin privileges, and can be deployed on most Linux workstations and clusters. To read more, check out&nbsp;</span><a href="https://microbiomejournal.biomedcentral.com/articles/10.1186/s40168-019-0658-x">our paper in Microbiome</a><span>.</span></p>
<p><span><a href="https://sunbeam.readthedocs.io/en/latest/">https://sunbeam.readthedocs.io/en/latest/</a></span></p><p>Address of the bookmark: <a href="https://github.com/sunbeam-labs/sunbeam" rel="nofollow">https://github.com/sunbeam-labs/sunbeam</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42413/liftoff-an-accurate-gff3gtf-lift-over-pipeline</guid>
	<pubDate>Sun, 20 Dec 2020 01:36:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42413/liftoff-an-accurate-gff3gtf-lift-over-pipeline</link>
	<title><![CDATA[Liftoff: An accurate GFF3/GTF lift over pipeline]]></title>
	<description><![CDATA[<p><span>Liftoff is a tool that accurately 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.</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>Neel</dc:creator>
</item>

</channel>
</rss>