<?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/27806?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/27806?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</guid>
	<pubDate>Mon, 19 Dec 2016 05:56:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</link>
	<title><![CDATA[e-RGA: enhanced Reference Guided Assembly of Complex Genomes]]></title>
	<description><![CDATA[<p><span>Next Generation Sequencing has totally changed genomics: we are able to produce huge amounts of data at an incredibly low cost compared to Sanger sequencing. Despite this, some old problems have become even more difficult, de novo assembly being on top of this list. Despite efforts to design tools able to assemble, de novo, an organism sequenced with short reads, the results are still far from those achievable with long reads. In this paper, we propose a novel method that aims to improve de novo assembly in the presence of a closely related reference. The idea is to combine de novo and reference-guided assembly in order to obtain enhanced results.</span></p><p>Address of the bookmark: <a href="http://journal.embnet.org/index.php/embnetjournal/article/view/208" rel="nofollow">http://journal.embnet.org/index.php/embnetjournal/article/view/208</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30111/eager</guid>
	<pubDate>Sat, 10 Dec 2016 18:07:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30111/eager</link>
	<title><![CDATA[EAGER]]></title>
	<description><![CDATA[<p><span>The automated reconstruction of genome sequences in ancient genome analysis is a multifaceted process.</span></p>
<p><span>EAGER encompasses both state-of-the-art tools for each step as well as new complementary tools tailored for ancient DNA data within a single integrated solution in an easily accessible format.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0918-z</p><p>Address of the bookmark: <a href="https://github.com/apeltzer/EAGER-GUI" rel="nofollow">https://github.com/apeltzer/EAGER-GUI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26925/reapr-a-universal-tool-for-genome-assembly-evaluation</guid>
	<pubDate>Wed, 06 Apr 2016 18:26:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26925/reapr-a-universal-tool-for-genome-assembly-evaluation</link>
	<title><![CDATA[REAPR: a universal tool for genome assembly evaluation]]></title>
	<description><![CDATA[<p>REAPR is a tool that evaluates the accuracy of a genome assembly using mapped paired end reads, without the use of a reference genome for comparison. It can be used in any stage of an assembly pipeline to automatically break incorrect scaffolds and flag other errors in an assembly for manual inspection. It reports mis-assemblies and other warnings, and produces a new broken assembly based on the error calls.</p>
<p>The software requires as input an assembly in FASTA format and paired reads mapped to the assembly in a BAM file. Mapping information such as the fragment coverage and insert size distribution is analysed to locate mis-assemblies. REAPR works best using mapped read pairs from a large insert library (at least 1000bp). Additionally, if a short insert Illumina library is also available, REAPR can combine this with the large insert library in order to score each base of the assembly.</p>
<p>http://www.sanger.ac.uk/science/tools/reapr</p><p>Address of the bookmark: <a href="https://genomebiology.biomedcentral.com/articles/10.1186/gb-2013-14-5-r47" rel="nofollow">https://genomebiology.biomedcentral.com/articles/10.1186/gb-2013-14-5-r47</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30538/gkno</guid>
	<pubDate>Tue, 17 Jan 2017 03:35:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30538/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>More at&nbsp;http://gkno.me/</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</guid>
	<pubDate>Fri, 20 Jan 2017 06:05:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</link>
	<title><![CDATA[SpeedSeq]]></title>
	<description><![CDATA[<p>A flexible framework for rapid genome analysis and interpretation</p>
<p>C Chiang, R M Layer, G G Faust, M R Lindberg, D B Rose, E P Garrison, G T Marth, A R Quinlan, and I M Hall. SpeedSeq: ultra-fast personal genome analysis and interpretation. Nat Meth (2015). doi:10.1038/nmeth.3505.</p>
<p><a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html">http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html</a></p><p>Address of the bookmark: <a href="https://github.com/hall-lab/speedseq" rel="nofollow">https://github.com/hall-lab/speedseq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28805/bambus</guid>
	<pubDate>Tue, 16 Aug 2016 08:09:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28805/bambus</link>
	<title><![CDATA[Bambus]]></title>
	<description><![CDATA[<div>
<div>
<div>
<p>Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with great flexibility in choosing the scaffolding parameters. In particular, Bambus is able to accept contig linking data other than specified by mate-pairs. Such sources of information include alignment to a reference genome (Bambus can directly use the output of MUMmer), physical mapping data, or information about gene synteny.</p>
</div>
</div>
</div>
<div>
<div>Home Page:&nbsp;</div>
<div>
<div><a href="http://sourceforge.net/apps/mediawiki/amos/index.php?title=Bambus2">http://sourceforge.net/apps/mediawiki/amos/index.php?title=Bambus2</a></div>
</div>
</div><p>Address of the bookmark: <a href="https://www.cbcb.umd.edu/software/bambus2" rel="nofollow">https://www.cbcb.umd.edu/software/bambus2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Mon, 19 Dec 2016 06:07:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS (Genomic Assemblies Merger for Next Generation Sequencing), whose primary goal is to merge two or more assemblies in order to enhance contiguity and correctness of both. GAM-NGS does not rely on global alignment: regions of the two assemblies representing the same genomic&nbsp;</span><em>locus</em><span>&nbsp;(called&nbsp;</span><em>blocks</em><span>) are identified through reads' alignments and stored in a&nbsp;</span><em>weighted</em><span>graph. The merging phase is carried out with the help of this weighted graph that allows an&nbsp;</span><em>optimal</em><span>&nbsp;resolution of&nbsp;</span><em>local</em><span>&nbsp;problematic regions.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30976/brig</guid>
	<pubDate>Thu, 16 Feb 2017 13:14:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30976/brig</link>
	<title><![CDATA[BRIG]]></title>
	<description><![CDATA[<p>BRIG is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The application is available at:<a href="http://sourceforge.net/projects/brig">http://sourceforge.net/projects/brig</a></p>
<p>If you have any questions or comments, post them on&nbsp;<a href="http://sourceforge.net/tracker/?group_id=328245">one of the trackers</a>&nbsp;on BRIG&rsquo;s SourceForge page:<a href="http://sourceforge.net/tracker/?group_id=328245">http://sourceforge.net/tracker/?group_id=328245</a>.</p>
<p>Features:</p>
<ul>
<li>Images show similarity between a central reference sequence and other sequences as concentric rings.</li>
<li>BRIG will perform all BLAST comparisons and file parsing automatically via a simple GUI.</li>
<li>Contig boundaries and read coverage can be displayed for draft genomes; customized graphs and annotations can be displayed.</li>
<li>Using a user-defined set of genes as input, BRIG can display gene presence, absence, truncation or sequence variation in a set of complete genomes, draft genomes or even raw, unassembled sequence data.</li>
<li>BRIG also accepts SAM-formatted read-mapping files enabling genomic regions present in unassembled sequence data from multiple samples to be compared simultaneously</li>
</ul>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://brig.sourceforge.net/" rel="nofollow">http://brig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>