<?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/44375?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/44375?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</guid>
	<pubDate>Wed, 29 Nov 2017 16:44:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34488/scripts-for-the-analysis-of-hgt-in-genome-sequence-data</link>
	<title><![CDATA[Scripts for the analysis of HGT in genome sequence data.]]></title>
	<description><![CDATA[<p><span>Scripts for the analysis of HGT in genome sequence data</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/hgt" rel="nofollow">https://github.com/reubwn/hgt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</guid>
	<pubDate>Wed, 15 Sep 2021 21:15:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43374/reference-sequence-resource</link>
	<title><![CDATA[Reference Sequence Resource!]]></title>
	<description><![CDATA[<p><span>The ENCODE project uses Reference Genomes from&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/genome/browse/reference/">NCBI</a><span>&nbsp;or&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/downloads.html">UCSC</a><span>&nbsp;to provide a consistent framework for mapping high-throughput sequencing data.&nbsp;In general, ENCODE data are mapped consistently to 2 human (GRCH38, hg19) and 2 mouse (mm9/mm10) genomes for historical comparability.&nbsp;</span><em>Drosophia melanogaster</em><span>&nbsp;experiments are mapped to either dm3 or dm6 and&nbsp;</span><em>Caenorhabdilis elegans&nbsp;</em><span>experiments are mapped to ce10 or ce11.&nbsp;T</span></p><p>Address of the bookmark: <a href="https://www.encodeproject.org/data-standards/reference-sequences/" rel="nofollow">https://www.encodeproject.org/data-standards/reference-sequences/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</guid>
	<pubDate>Fri, 15 Jun 2018 04:48:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</link>
	<title><![CDATA[mScaffolder: A comparative genome scaffolding tool]]></title>
	<description><![CDATA[<p>A comparative genome scaffolding tool based on MUMmer</p>
<p>mScaffolder scaffolds a genome using an existing high quality genome as the reference. It aligns the two genomes using nucmer utility from MUMmer and then orders and orients the contigs of the candidate genome guided by their alignments to the reference genome. Please send your questions and comments to&nbsp;<a href="mailto:mchakrab@uci.edu">mchakrab@uci.edu</a>.</p>
<p><span>Citation</span><span>&nbsp;</span><a href="https://www.nature.com/articles/s41588-017-0010-y">https://www.nature.com/articles/s41588-017-0010-y</a></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/mscaffolder" rel="nofollow">https://github.com/mahulchak/mscaffolder</a></p>]]></description>
	<dc:creator>Jit</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/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38758/roary-the-pan-genome-pipeline</guid>
	<pubDate>Tue, 22 Jan 2019 05:52:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38758/roary-the-pan-genome-pipeline</link>
	<title><![CDATA[Roary: the Pan Genome Pipeline]]></title>
	<description><![CDATA[<p><span>Roary is a high speed stand alone pan genome pipeline, which takes annotated assemblies in GFF3 format (produced by Prokka (Seemann, 2014)) and calculates the pan genome. Using a standard desktop PC, it can analyse datasets with thousands of samples, something which is computationally infeasible with existing methods, without compromising the quality of the results. 128 samples can be analysed in under 1 hour using 1 GB of RAM and a single processor. To perform this analysis using existing methods would take weeks and hundreds of GB of RAM. Roary is not intended for meta-genomics or for comparing extremely diverse sets of genomes.</span></p><p>Address of the bookmark: <a href="https://sanger-pathogens.github.io/Roary/" rel="nofollow">https://sanger-pathogens.github.io/Roary/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</guid>
	<pubDate>Wed, 21 Feb 2024 06:19:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</link>
	<title><![CDATA[pipesnake: bioinformatics best-practice analysis pipeline for phylogenomic reconstruction]]></title>
	<description><![CDATA[<p dir="auto"><span>ausarg/pipesnake</span>&nbsp;is a bioinformatics best-practice analysis pipeline for phylogenomic reconstruction starting from short-read 'second-generation' sequencing data.</p>
<p dir="auto">The pipeline is built using&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>, a workflow tool to run tasks across multiple compute infrastructures in a very portable manner. It uses Docker/Singularity containers making installation trivial and results highly reproducible. The&nbsp;<a href="https://www.nextflow.io/docs/latest/dsl2.html">Nextflow DSL2</a>&nbsp;implementation of this pipeline uses one container per process which makes it much easier to maintain and update software dependencies.</p><p>Address of the bookmark: <a href="https://github.com/AusARG/pipesnake" rel="nofollow">https://github.com/AusARG/pipesnake</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</guid>
	<pubDate>Wed, 06 Dec 2017 01:05:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</link>
	<title><![CDATA[HiC-Pro: an optimized and flexible pipeline for Hi-C data processing]]></title>
	<description><![CDATA[<p><span>HiC-Pro was designed to process Hi-C data, from raw fastq files (paired-end Illumina data) to the normalized contact maps. Since version 2.7.0, HiC-Pro supports the main Hi-C protocols, including digestion protocols as well as protocols that do not require restriction enzyme such as DNase Hi-C. In practice, HiC-Pro can be used to process dilution Hi-C, in situ Hi-C, DNase Hi-C, Micro-C, capture-C, capture Hi-C or HiChip data.</span></p>
<p>&nbsp;</p>
<p>http://nservant.github.io/HiC-Pro/</p><p>Address of the bookmark: <a href="http://nservant.github.io/HiC-Pro/" rel="nofollow">http://nservant.github.io/HiC-Pro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39200/omtools-a-software-package-for-visualizing-and-processing-optical-mapping-data</guid>
	<pubDate>Fri, 29 Mar 2019 01:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39200/omtools-a-software-package-for-visualizing-and-processing-optical-mapping-data</link>
	<title><![CDATA[OMTools: a software package for visualizing and processing optical mapping data]]></title>
	<description><![CDATA[<p><span>OMTools, an efficient and intuitive data processing and visualization suite to handle and explore large-scale optical mapping profiles. OMTools includes modules for visualization (OMView), data processing and simulation. These modules together form an accessible and convenient pipeline for optical mapping analyses.</span></p>
<p><span><a href="https://github.com/TF-Chan-Lab/OMTools">https://github.com/TF-Chan-Lab/OMTools</a></span></p><p>Address of the bookmark: <a href="https://github.com/TF-Chan-Lab/OMTools" rel="nofollow">https://github.com/TF-Chan-Lab/OMTools</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

</channel>
</rss>