<?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/43353?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/43353?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44591/yamp-yet-another-metagenomic-pipeline</guid>
	<pubDate>Sat, 06 Jul 2024 04:26:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44591/yamp-yet-another-metagenomic-pipeline</link>
	<title><![CDATA[YAMP: Yet Another Metagenomic Pipeline]]></title>
	<description><![CDATA[<p><span>YAMP is constructed on&nbsp;</span><a href="https://www.nextflow.io/docs/latest/index.html">Nextflow</a><span>, a framework based on the dataflow programming model, which allows writing workflows that are highly parallel, easily portable (including on distributed systems), and very flexible and customisable, characteristics which have been inherited by YAMP. New modules can be added easily and the existing ones can be customised -- even though we have already provided default parameters deriving from our own experience.</span></p><p>Address of the bookmark: <a href="https://github.com/alesssia/YAMP" rel="nofollow">https://github.com/alesssia/YAMP</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37414/arc-pipeline-which-facilitates-iterative-reference-guided-de-novo-assemblies</guid>
	<pubDate>Thu, 26 Jul 2018 09:20:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37414/arc-pipeline-which-facilitates-iterative-reference-guided-de-novo-assemblies</link>
	<title><![CDATA[ARC: pipeline which facilitates iterative, reference guided de novo assemblies]]></title>
	<description><![CDATA[<p>ARC is a pipeline which facilitates iterative, reference guided&nbsp;<em>de novo</em>&nbsp;assemblies with the intent of:</p>
<ol>
<li>Reducing time in analysis and increasing accuracy of results by only considering those reads which should assemble together.</li>
<li>Reducing/removing reference bias as compared to mapping based approaches.</li>
</ol>
<p><span>The software is designed to work in situations where a whole-genome assembly is not the objective, but rather when the researcher wishes to assemble discreet 'targets' contained within next-generation shotgun sequence data. ARC decomplexifies the traditionally difficult problem of assembly by breaking the reads into small, manageable subsets which can then be assembled quickly and efficiently in parallel. Applications include those in which the researcher wishes to&nbsp;</span><em>de novo</em><span>&nbsp;assemble specific content and a set of semi-similar reference targets is available to initialize the assembly process.</span></p>
<p>https://ibest.github.io/ARC/</p><p>Address of the bookmark: <a href="https://ibest.github.io/ARC/" rel="nofollow">https://ibest.github.io/ARC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</guid>
	<pubDate>Tue, 09 Apr 2019 07:23:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</link>
	<title><![CDATA[CAUSEL: an epigenome- and genome-editing pipeline for establishing function of noncoding GWAS variants]]></title>
	<description><![CDATA[<p><span>Validated a widely accessible approach that can be used to establish functional causality for noncoding sequence variants identified by GWASs.</span></p>
<p><a href="https://www.nature.com/articles/nm.3975">https://www.nature.com/articles/nm.3975</a></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/nm.3975" rel="nofollow">https://www.nature.com/articles/nm.3975</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</guid>
	<pubDate>Thu, 19 Dec 2019 07:33:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</link>
	<title><![CDATA[HaploTypo: a variant-calling pipeline for phased genomes]]></title>
	<description><![CDATA[<p>An increasing number of phased (i.e. with resolved haplotypes) reference genomes are available. However, most genetic variant calling tools do not explicitly account for haplotype structure. Here, we present HaploTypo, a pipeline tailored to resolve haplotypes in genetic variation analyses. HaploTypo infers the haplotype correspondence for each heterozygous variant called on a phased reference genome.</p>
<div>Availability and Implementation</div>
<p>HaploTypo is implemented in Python 2.7 and Python 3.5, and is freely available at&nbsp;<a href="https://github.com/gabaldonlab/haplotypo" target="">https://github.com/gabaldonlab/haplotypo</a>, and as a Docker image.</p><p>Address of the bookmark: <a href="https://github.com/gabaldonlab/haplotypo" rel="nofollow">https://github.com/gabaldonlab/haplotypo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41030/slr-superscaffolder-a-scaffold-assemble-pipeline-for-stlfr-reads</guid>
	<pubDate>Fri, 14 Feb 2020 14:23:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41030/slr-superscaffolder-a-scaffold-assemble-pipeline-for-stlfr-reads</link>
	<title><![CDATA[SLR-superscaffolder: A scaffold assemble pipeline for stLFR reads.]]></title>
	<description><![CDATA[<p>This is a scaffold assembler designed for stLFR reads[1]. It uses the link-reads information from stLFR reads to assemble contigs to scaffolds.</p>
<p>Here is an illustration of this pipeline:</p>
<p>&nbsp;<img src="https://github.com/BGI-Qingdao/SLR-superscaffolder/raw/master/image.png" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/BGI-Qingdao/SLR-superscaffolder" rel="nofollow">https://github.com/BGI-Qingdao/SLR-superscaffolder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</guid>
	<pubDate>Thu, 13 Aug 2020 10:06:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</link>
	<title><![CDATA[PyParanoid: a pipeline for rapid identification of homologous gene families in a set of genomes]]></title>
	<description><![CDATA[<p>PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends on performing a all-vs-all sequence comparison, usually using BLAST, to determine homology. However, these methods are computationally expensive, requiring&nbsp;O(n2)&nbsp;resources to identify RBHs. This is problematic, as the modern deluge of sequencing data means that comparative genomics analyses could be performed on datasets of thousands of strains.</p><p>Address of the bookmark: <a href="https://github.com/ryanmelnyk/PyParanoid" rel="nofollow">https://github.com/ryanmelnyk/PyParanoid</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44373/mitohifi-a-python-pipeline-for-mitochondrial-genome-assembly-from-pacbio-high-fidelity-reads</guid>
	<pubDate>Tue, 05 Sep 2023 07:31:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44373/mitohifi-a-python-pipeline-for-mitochondrial-genome-assembly-from-pacbio-high-fidelity-reads</link>
	<title><![CDATA[MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads]]></title>
	<description><![CDATA[<p dir="auto">MitoHiFi v3.2 is a python pipeline distributed under&nbsp;<a href="https://github.com/marcelauliano/MitoHiFi/blob/master/LICENSE">MIT License</a>&nbsp;!</p>
<p dir="auto">MitoHiFi was first developed to assemble the mitogenomes for a wide range of species in the Darwin Tree of Life Project (DToL)</p>
<p dir="auto">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-023-05385-y&nbsp;</p>
<p dir="auto"><a href="https://github.com/marcelauliano/MitoHiFi/blob/master/docs/dtol-logo-round-300x132.png" target="_blank"><img src="https://github.com/marcelauliano/MitoHiFi/raw/master/docs/dtol-logo-round-300x132.png" alt="" style="border: 0px; border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marcelauliano/MitoHiFi" rel="nofollow">https://github.com/marcelauliano/MitoHiFi</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>