<?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/43062?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/43062?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 09:30:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Itegration Pipeline]]></title>
	<description><![CDATA[<p>#Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)</p>
<p>TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.&nbsp;<br>Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures. Tulipbulb adds long read sequencing data to these.</p>
<p>&nbsp;</p>
<p>https://github.com/Generade-nl/TULIP</p><p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</guid>
	<pubDate>Sat, 31 Aug 2019 11:30:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39903/integrative-meta-assembly-pipeline-imap-chromosome-level-genome-assembler-combining-multiple-de-novo-assemblies</link>
	<title><![CDATA[Integrative Meta-Assembly Pipeline (IMAP): Chromosome-level genome assembler combining multiple de novo assemblies]]></title>
	<description><![CDATA[<p><span>Chromosome-level genome assembler combining multiple de novo assemblies</span></p>
<p><span><a href="https://github.com/jkimlab/IMAP">https://github.com/jkimlab/IMAP</a></span></p><p>Address of the bookmark: <a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858" rel="nofollow">https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0221858</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44470/phyloherb-phylogenomic-analysis-pipeline-for-herbarium-specimens</guid>
	<pubDate>Wed, 21 Feb 2024 06:15:13 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44470/phyloherb-phylogenomic-analysis-pipeline-for-herbarium-specimens</link>
	<title><![CDATA[PhyloHerb: Phylogenomic Analysis Pipeline for Herbarium Specimens]]></title>
	<description><![CDATA[<p><span>What is PhyloHerb</span><span>: PhyloHerb is a wrapper program to process&nbsp;</span><span>genome skimming</span><span>&nbsp;data collected from plant materials. The outcomes include the plastid genome (plastome) assemblies, mitochondrial genome assemblies, nuclear ribosomal DNAs (NTS+ETS+18S+ITS1+5.8S+ITS2+28S), alignments of gene and intergenic regions, and a species tree. It is designed to be a high throughput program dealing with lower quality data. Examples include&nbsp;</span><span>low-coverage (5x cpDNA) plastome phylogeny, recycling plastid genes from target enrichment data, retrieving low-copy nuclear genes from medium coverage (5x nucDNA) genome skimming</span><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/lmcai/PhyloHerb/" rel="nofollow">https://github.com/lmcai/PhyloHerb/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/26290/webinar-on-streamlining-large-scale-analysis-using-the-strand-ngs-pipeline-manager-on-24-feb-2016</guid>
	<pubDate>Fri, 05 Feb 2016 06:43:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/26290/webinar-on-streamlining-large-scale-analysis-using-the-strand-ngs-pipeline-manager-on-24-feb-2016</link>
	<title><![CDATA[Webinar on Streamlining large scale analysis using the Strand NGS Pipeline Manager on 24 Feb 2016]]></title>
	<description><![CDATA[<p><a href="http://www.strand-ngs.com/webinar_registration" title="webinar"><strong>Live Webinar on Streamlining large scale NGS data analysis using the Strand NGS Pipeline Manager on 24 Feb 2016</strong></a></p><p><strong>Abstract:</strong> Strand NGS includes comprehensive workflows for DNA-Seq, RNA-Seq, Small RNA-Seq, ChIP-Seq, MeDIP-Seq, and Methyl-Seq analysis. Each workflow includes a quality assessment and filter section, followed by a workflow-specific analysis section. The pipeline functionality in Strand NGS allows users to execute a sequence of analysis steps with specific parameters - all without any manual intervention. This simplifies the analysis in large scale sequencing projects where every sample needs to be processed identically.</p><p>In this webinar we will discuss the pre-packaged pipelines present in Strand NGS. The packaged pipelines have well-chosen default parameters and are suitable for users analyzing data for the first time in the tool. We will also show how advanced users can customize pipelines and share them with other Strand NGS users. Finally, we will show a brief glimpse of an elaborate pipeline that aligns reads, filters poor-quality matches, computes coverage metrics, identifies variants, checks for sample cross-contamination, and emails quality reports - all from within Strand NGS.</p><p><strong>Speaker:</strong> Dr. Vamsi Veeramachaneni, Vice President - Bioinformatics, Strand Life Sciences</p><p><strong>Details:</strong> Session 1: 2:30 PM IST, Session 2 : 10:30 PM IST<br /><strong>Register here:</strong> http://www.strand-ngs.com/webinar_registration</p><h3>&nbsp;</h3>]]></description>
	<dc:creator>Yeshodari</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/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Fri, 24 Jan 2020 06:04:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p><span>gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser. </span></p>
<p><span>gapFinisher can fill gaps in draft genomes quickly and reliably.</span></p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Thu, 14 May 2020 15:13:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p>gapFinisher to process SSPACE-LongRead output to fill gaps after the scaffolding. gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines.</p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6733440/</p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>