<?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/40856?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/40856?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Mon, 26 Oct 2020 21:23:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding.]]></title>
	<description><![CDATA[<p><span>Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary and secondary contigs are not properly identified, the primary assembly will overrepresent both the size and complexity of the genome, which complicates downstream analysis such as scaffolding.</span></p>
<p><span>More at&nbsp;https://github.com/esolares/HapSolo</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding]]></title>
	<description><![CDATA[<p><span>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</guid>
	<pubDate>Sun, 03 Apr 2022 20:35:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</link>
	<title><![CDATA[Merfin: improved variant filtering, assembly evaluation and polishing via k-mer validation]]></title>
	<description><![CDATA[<p><span>Merfin, a&nbsp;</span><em>k</em><span>-mer based variant-filtering algorithm for improved accuracy in genotyping and genome assembly polishing. Merfin evaluates each variant based on the expected&nbsp;</span><em>k</em><span>-mer multiplicity in the reads, independently of the quality of the read alignment and variant caller&rsquo;s internal score. Merfin increased the precision of genotyped calls in several benchmarks, improved consensus accuracy and reduced frameshift errors when applied to human and nonhuman assemblies built from Pacific Biosciences HiFi and continuous long reads or Oxford Nanopore reads, including the first complete human genome. Moreover, we introduce assembly quality and completeness metrics that account for the expected genomic copy numbers.</span></p>
<p><span>More at&nbsp;https://www.nature.com/articles/s41592-022-01445-y</span></p>
<p><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41592-022-01445-y/MediaObjects/41592_2022_1445_Fig1_HTML.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/arangrhie/merfin" rel="nofollow">https://github.com/arangrhie/merfin</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</guid>
	<pubDate>Mon, 08 Feb 2016 15:47:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</link>
	<title><![CDATA[CrossMap]]></title>
	<description><![CDATA[<p>CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between <em>different assemblies</em> (such as Human <a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a>, Mouse <a href="http://www.ncbi.nlm.nih.gov/assembly/165668/">mm9 (MGSCv37)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/327618/">mm10 (GRCm38)</a>).</p>
<p>It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.</p>
<p>CrossMap is designed to liftover genome coordinates between assemblies. It&rsquo;s <em>not</em> a program for aligning sequences to reference genome.</p>
<p>We <em>do not</em> recommend using CrossMap to convert genome coordinates between species.</p>
<p>More at http://crossmap.sourceforge.net/</p><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</guid>
	<pubDate>Fri, 29 Apr 2016 05:49:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27110/easyfig</link>
	<title><![CDATA[Easyfig]]></title>
	<description><![CDATA[<p>Easyfig has moved to github, for newer releases of Easyfig please visit our new webpage - https://mjsull.github.io/Easyfig.&nbsp; Easyfig is a Python application for creating linear comparison figures of multiple genomic loci with an easy-to-use graphical user interface (GUI).</p>
<p>More at http://easyfig.sourceforge.net/</p><p>Address of the bookmark: <a href="http://easyfig.sourceforge.net/" rel="nofollow">http://easyfig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26923/quast-quality-assessment-tool-for-genome-assemblies</guid>
	<pubDate>Wed, 06 Apr 2016 18:23:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26923/quast-quality-assessment-tool-for-genome-assemblies</link>
	<title><![CDATA[QUAST: quality assessment tool for genome assemblies]]></title>
	<description><![CDATA[<p><span>QUAST evaluates genome assemblies. For metagenomes, please see&nbsp;<a href="http://bioinf.spbau.ru/metaquast">MetaQUAST</a>&nbsp;project.</span><br><span>It can works both with and without a given reference genome.</span><br><span>The tool accepts multiple assemblies, thus is suitable for comparison.</span></p>
<p><span>More at&nbsp;http://bioinf.spbau.ru/quast</span></p>
<p><span>http://bioinformatics.oxfordjournals.org/content/early/2013/03/09/bioinformatics.btt086.long</span></p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2013/03/09/bioinformatics.btt086.long" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2013/03/09/bioinformatics.btt086.long</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27035/spades</guid>
	<pubDate>Tue, 19 Apr 2016 08:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27035/spades</link>
	<title><![CDATA[SPAdes]]></title>
	<description><![CDATA[<p>SPAdes &ndash; St. Petersburg genome assembler &ndash; is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8, 2016 and can be downloaded from <a href="http://bioinf.spbau.ru/en/spades" target="_blank">http://bioinf.spbau.ru/en/spades</a>.</p>
<p>Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/spades" rel="nofollow">http://bioinf.spbau.ru/spades</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29130/gage-genome-assembly-gold-standard-evaluation</guid>
	<pubDate>Wed, 07 Sep 2016 07:35:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29130/gage-genome-assembly-gold-standard-evaluation</link>
	<title><![CDATA[GAGE : Genome Assembly Gold-standard Evaluation]]></title>
	<description><![CDATA[<p><span>GAGE is an evaluation of the very latest large-scale genome assembly algorithms. We have organized this "bake-off" as an attempt to produce a realistic assessment of genome assembly software in a rapidly changing field of next-generation sequencing. The main results of GAGE have now been published in the journal Genome Research:&nbsp;</span><a href="http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111">GAGE: A critical evaluation of genome assemblies and assembly algorithms</a><span>.</span></p>
<p><span>http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111</span></p><p>Address of the bookmark: <a href="http://gage.cbcb.umd.edu/index.html" rel="nofollow">http://gage.cbcb.umd.edu/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>