<?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/34718?</link>
	<atom:link href="https://bioinformaticsonline.com/related/34718?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36723/hapsembler-an-assembler-for-highly-polymorphic-genomes</guid>
	<pubDate>Tue, 22 May 2018 04:09:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36723/hapsembler-an-assembler-for-highly-polymorphic-genomes</link>
	<title><![CDATA[Hapsembler: An Assembler for Highly Polymorphic Genomes]]></title>
	<description><![CDATA[Hapsembler is a haplotype-specific genome assembly toolkit that is designed for genomes that are rich in SNPs and other types of polymorphism. Hapsembler can be used to assemble reads from a variety of platforms including Illumina and Roche/454. 

http://compbio.cs.toronto.edu/hapsembler/<p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</guid>
	<pubDate>Fri, 01 Jun 2018 07:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</link>
	<title><![CDATA[Ranbow: a haplotype assembler for polyploid genomes]]></title>
	<description><![CDATA[Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function:

ranbow hap: for haplotyping
ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads 
ranbow phylo: for the phylogenetic analysis<p>Address of the bookmark: <a href="https://www.molgen.mpg.de/ranbow" rel="nofollow">https://www.molgen.mpg.de/ranbow</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1926</guid>
	<pubDate>Sun, 11 Aug 2013 11:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1926</link>
	<title><![CDATA[Want to Know which genome assembler rule the world ?]]></title>
	<description><![CDATA[<p><span><strong>Assemblathon 2</strong>: evaluating de novo methods of genome assembly&nbsp;</span></p><p><span><a href="http://www.gigasciencejournal.com/content/2/1/10/abstract">http://www.gigasciencejournal.com/content/2/1/10/abstract</a></span></p><p><span><a href="http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html">http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html</a></span></p><p><a href="http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p">http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</guid>
	<pubDate>Tue, 16 Aug 2016 08:34:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</link>
	<title><![CDATA[KisSplice]]></title>
	<description><![CDATA[<p>KisSplice is a software that enables to analyse RNA-seq data with or without a reference genome. It is an exact local transcriptome assembler that allows to identify SNPs, indels and alternative splicing events. It can deal with an arbitrary number of biological conditions, and will quantify each variant in each condition. It has been tested on Illumina datasets of up to 1G reads. Its memory consumption is around 5Gb for 100M reads.</p>
<p>KisSplice is not a full-length transcriptome assembler. This means that it will output the variable regions of the transcripts, not reconstruct them entirely.</p>
<p>KisSplice comes as a workflow, with several possible post-treatments meant to facilitate the analysis of the results. The choice of the post-treatment depends on the availability of a reference genome/transcriptome and on the need to perform a differential analysis, as summarised in the following table.</p><p>Address of the bookmark: <a href="http://kissplice.prabi.fr/" rel="nofollow">http://kissplice.prabi.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</guid>
	<pubDate>Wed, 01 Mar 2017 08:32:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</link>
	<title><![CDATA[YASRA: Reference based assembler]]></title>
	<description><![CDATA[<p>YASRA (Yet Another Short Read Assembler) performs comparative assembly of short reads using a reference genome, which can differ substantially from the genome being sequenced. Mapping reads to reference genomes makes use of LASTZ (Harris et al), a pairwise sequence aligner compatible with BLASTZ. Special scoring sets were derived to improve the performance, both in runtime and quality for 454 and Illumina sequence reads.</p>
<p>YASRA uses LASTZ (<a href="http://bx.psu.edu/miller_lab">http://bx.psu.edu/miller_lab</a> for released version and <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a> for newer version) for aligning the sequences to the reference genome. Please install LASTZ (the newest version on <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a>) and add the LASTZ binary in your executable/binary search path before installing YASRA.</p><p>Address of the bookmark: <a href="https://github.com/aakrosh/YASRA" rel="nofollow">https://github.com/aakrosh/YASRA</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33859/disco-multi-threaded-and-multiprocess-distributed-memory-overlap-layout-consensus-olc-metagenome-assembler</guid>
	<pubDate>Mon, 10 Jul 2017 10:09:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33859/disco-multi-threaded-and-multiprocess-distributed-memory-overlap-layout-consensus-olc-metagenome-assembler</link>
	<title><![CDATA[DISCO : multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler]]></title>
	<description><![CDATA[<p><span>DISCO is a multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler. Disco was developed as a&nbsp;scalable assembler to assemble large metagenomes from billions of Illumina sequencing reads of complex microbial communities. Disco was parallelized for computer clusters in a hybrid architecture that integrated shared-memory multi-threading, point-to-point message passing, and remote direct memory access. The assembly and scaffolding were performed using an iterative overlap graph approach.</span></p><p>Address of the bookmark: <a href="http://disco.omicsbio.org/" rel="nofollow">http://disco.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>