<?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/38055?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/38055?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</guid>
	<pubDate>Sat, 02 Jan 2021 07:05:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42530/shovill-assemble-bacterial-isolate-genomes-from-illumina-paired-end-reads</link>
	<title><![CDATA[shovill: Assemble bacterial isolate genomes from Illumina paired-end reads]]></title>
	<description><![CDATA[<p><span>Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take advantage of the pre- and post-processing the Shovill provides with those too.</span></p><p>Address of the bookmark: <a href="https://github.com/tseemann/shovill" rel="nofollow">https://github.com/tseemann/shovill</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</guid>
	<pubDate>Wed, 27 Dec 2017 00:04:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</link>
	<title><![CDATA[Recovery of complete genomes from metagenomes]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p><strong>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</strong></p>
<p><a href="http://personprofil.aau.dk/120257">Mads Albertsen</a>,&nbsp;<a href="http://ecogenomic.org/users/phil-hugenholtz">Philip Hugenholtz</a>,&nbsp;<a href="http://ecogenomic.org/users/adam-skarshewski">Adam Skarshewski</a>,&nbsp;<a href="http://www.ecogenomic.org/users/gene-tyson">Gene W. Tyson</a>,&nbsp;<a href="http://personprofil.aau.dk/103057">K&aring;re L. Nielsen</a>&nbsp;and&nbsp;<a href="http://personprofil.aau.dk/105842">Per .H. Nielsen</a></p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="http://madsalbertsen.github.io/multi-metagenome/" rel="nofollow">http://madsalbertsen.github.io/multi-metagenome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</guid>
	<pubDate>Mon, 14 May 2018 04:02:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</link>
	<title><![CDATA[Digest: In silico restriction digest of complete genomes]]></title>
	<description><![CDATA[<p><span>This tool allows to retrieve number of cleavages yielded by commercially available endonucleases in up-to-date sequenced prokaryotic genomes. When the number of fragments is bellow 50, Pulse Field gel Electrophoresis (PFGE) is simulated.</span></p>
<p>A tool for restriction digest of&nbsp;<a href="http://insilico.ehu.eus/restriction/long_seq/">long</a>user's sequences is available.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://insilico.ehu.es/digest/" rel="nofollow">http://insilico.ehu.es/digest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</guid>
	<pubDate>Thu, 09 Aug 2018 17:41:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</link>
	<title><![CDATA[mmgenome: Tools for extracting individual genomes from metagneomes]]></title>
	<description><![CDATA[<p>The mmgenome toolbox enables reproducible extraction of individual genomes from metagenomes. It builds on the&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">multi-metagenome</a>&nbsp;concept, but wraps most of the process of extracting genomes in simple R functions. Thereby making the whole process of binning easy and at the same time reproducible through the Rmarkdown format.</p>
<p>The mmgenome R package also facilitates effortless integration with additional data sources and hence should not be seen as "yet another binning method", but rather a package to integrate different binning strategies.</p>
<p>All functions in the mmgenome R package has associated documentation, check it out in R by e.g.&nbsp;<code>?mmplot</code>.</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/mmgenome" rel="nofollow">https://github.com/MadsAlbertsen/mmgenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</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/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</guid>
	<pubDate>Tue, 09 May 2023 19:38:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44318/proksee-in-depth-characterization-and-visualization-of-bacterial-genomes</link>
	<title><![CDATA[Proksee: in-depth characterization and visualization of bacterial genomes]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>