<?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/37576?offset=210</link>
	<atom:link href="https://bioinformaticsonline.com/related/37576?offset=210" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</guid>
	<pubDate>Mon, 17 Feb 2020 05:38:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</link>
	<title><![CDATA[Chromonomer: a tool set for repairing and enhancing assembled genomes through integration of genetic maps and conserved synteny]]></title>
	<description><![CDATA[<p>Chromonomer is a program designed to integrate a genome assembly with a genetic map. Chromonomer tries very hard to identify and remove markers that are out of order in the genetic map, when considered against their local assembly order; and to identify scaffolds that have been incorrectly assembled according to the genetic map, and split those scaffolds.</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/chromonomer/" rel="nofollow">http://catchenlab.life.illinois.edu/chromonomer/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</guid>
	<pubDate>Tue, 30 Jun 2020 21:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</link>
	<title><![CDATA[truvari: Structural variant comparison tool for VCFs]]></title>
	<description><![CDATA[<p>Structural variant comparison tool for VCFs</p>
<p>Given benchmark and comparsion sets of SVs, calculate the recall, precision, and f-measure.</p>
<p><a href="https://github.com/spiralgenetics/www.spiralgenetics.com">Spiral Genetics</a></p>
<p><a href="https://docs.google.com/presentation/d/17mvC1XOpOm7khAbZwF3SgtG2Rl4M9Mro37yF2nN7GhE/edit">Motivation</a></p><p>Address of the bookmark: <a href="https://github.com/spiralgenetics/truvari" rel="nofollow">https://github.com/spiralgenetics/truvari</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42155/clustergrammer-is-a-web-based-tool-for-visualizing-high-dimensional-data-as-an-interactive-and-shareable-hierarchically-clustered-heatmap</guid>
	<pubDate>Sun, 23 Aug 2020 19:30:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42155/clustergrammer-is-a-web-based-tool-for-visualizing-high-dimensional-data-as-an-interactive-and-shareable-hierarchically-clustered-heatmap</link>
	<title><![CDATA[Clustergrammer is a web-based tool for visualizing high-dimensional data as an interactive and shareable hierarchically clustered heatmap]]></title>
	<description><![CDATA[<p><span>Clustergrammer is a web-based tool for visualizing high-dimensional data (e.g. a matrix) as an interactive and shareable hierarchically clustered heatmap. Clustergrammer's front end (</span><a href="http://clustergrammer.readthedocs.io/clustergrammer_js.html#clustergrammer-js">Clustergrammer-JS</a><span>) is built using&nbsp;</span><a href="https://d3js.org/">D3.js</a><span>&nbsp;and its back-end (</span><a href="http://clustergrammer.readthedocs.io/clustergrammer_py.html#clustergrammer-py">Clustergrammer-PY</a><span>) is built using Python. Clustergrammer produces highly interactive visualizations that enable intuitive exploration of high-dimensional data and has several biology-specific features (e.g. enrichment analysis, see&nbsp;</span><a href="http://clustergrammer.readthedocs.io/biology_specific_features.html#biology-specific-features">Biology-Specific Features</a><span>) to facilitate the exploration of gene-level biological data.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/MaayanLab/clustergrammer" rel="nofollow">https://github.com/MaayanLab/clustergrammer</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</guid>
	<pubDate>Wed, 23 Jun 2021 07:54:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</link>
	<title><![CDATA[LoReTTA, a user-friendly tool for assembling viral genomes from PacBio sequence data]]></title>
	<description><![CDATA[<p>LoReTTA (Long Read Template-Targeted Assembler), a tool designed for performing <em>de novo</em> assembly of long reads generated from viral genomes on the PacBio platform. LoReTTA exploits a reference genome to guide the assembly process, an approach that has been successful with short reads.</p>
<p>https://academic.oup.com/ve/article/7/1/veab042/6248116</p><p>Address of the bookmark: <a href="https://academic.oup.com/ve/article/7/1/veab042/6248116" rel="nofollow">https://academic.oup.com/ve/article/7/1/veab042/6248116</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</guid>
	<pubDate>Thu, 19 May 2022 04:29:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43867/genomeqc-a-quality-assessment-tool-for-genome-assemblies-and-gene-structure-annotations</link>
	<title><![CDATA[GenomeQC: a quality assessment tool for genome assemblies and gene structure annotations]]></title>
	<description><![CDATA[<p><span>The GenomeQC web application is implemented in R/Shiny version 1.5.9 and Python 3.6 and is freely available at&nbsp;</span><a href="https://genomeqc.maizegdb.org/">https://genomeqc.maizegdb.org/</a><span>&nbsp;under the GPL license. All source code and a containerized version of the GenomeQC pipeline is available in the GitHub repository&nbsp;</span><a href="https://github.com/HuffordLab/GenomeQC">https://github.com/HuffordLab/GenomeQC</a><span>.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-020-6568-2</p><p>Address of the bookmark: <a href="https://github.com/HuffordLab/GenomeQC" rel="nofollow">https://github.com/HuffordLab/GenomeQC</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</guid>
	<pubDate>Wed, 27 Mar 2024 11:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</link>
	<title><![CDATA[CGView.js is a Circular Genome Viewing tool]]></title>
	<description><![CDATA[<p>CGView.js is a&nbsp;<span>C</span>ircular&nbsp;<span>G</span>enome&nbsp;<span>View</span>ing tool for visualizing and interacting with small genomes. This software is an adaptation of the Java program&nbsp;<a href="https://paulstothard.github.io/cgview/">CGView</a>.</p>
<div>
<p>CGView.js is the genome viewer of Proksee, an expert system for genome assembly, annotation and visualization.</p>
<a href="https://proksee.ca/"></a></div>
<h1 id="features">Features</h1>
<ul>
<li>
<p>Circular and linear views of genomes</p>
</li>
<li>
<p>Capable of drawing genomes up to 10 Mbp with 1000's of features and 100's contigs</p>
</li>
<li>
<p>Smooth zooming down to the sequence level</p>
</li>
<li>
<p>Easily generate features and plots directly form the sequence (e.g. ORFs, GC-content and GC-Skew)</p>
</li>
<li>
<p>Save high resolution PNG maps up to 8000x8000px</p>
</li>
<li>
<p>Fully documented API for interacting with CGView.js maps</p>
</li>
</ul><p>Address of the bookmark: <a href="https://js.cgview.ca/" rel="nofollow">https://js.cgview.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44655/ngenomesyn-an-easy-to-use-and-flexible-tool-for-publication-ready-visualization-of-syntenic-relationships-across-multiple-genomes</guid>
	<pubDate>Tue, 10 Sep 2024 04:54:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44655/ngenomesyn-an-easy-to-use-and-flexible-tool-for-publication-ready-visualization-of-syntenic-relationships-across-multiple-genomes</link>
	<title><![CDATA[NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes]]></title>
	<description><![CDATA[<p>NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes&nbsp;</p>
<p><img src="https://github.com/hewm2008/NGenomeSyn/raw/main/Example/example2/OUT3.png" alt="image" style="border: 0px;"></p>
<p><span>NGenomeSyn [multiple (N) Genome Synteny], for publication-ready visualization of syntenic relationships of the whole genome or local region and genomic features (e.g. repeats, structural variations, genes) across multiple genomes with a high customization. NGenomeSyn provides an easy way for its users to visualize a large amount of data with a rich layout by simply adjusting options for moving, scaling, and rotation of target genomes. Moreover, NGenomeSyn could be applied on the visualization of relationships on non-genomic data with similar input formats.</span></p>
<p>https://academic.oup.com/bioinformatics/article/39/3/btad121/7072460</p><p>Address of the bookmark: <a href="https://github.com/hewm2008/NGenomeSyn" rel="nofollow">https://github.com/hewm2008/NGenomeSyn</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</guid>
	<pubDate>Wed, 21 Mar 2018 18:10:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36015/repeat-aware-repeat-aware-scaffolding-evaluation-framework-by-igor-mandric</link>
	<title><![CDATA[repeat-aware: Repeat aware scaffolding evaluation framework by Igor Mandric]]></title>
	<description><![CDATA[<p>Genome scaffolding is a classical challenging problem in bioinformatics. It refers to joining assembly contigs into chains (called scaffolds). The join between two contigs A and B is considered correct if:</p>
<ul>
<li>Their relative orientation is correct</li>
<li>Their relative order is correct</li>
<li>The gap estimate is similar to the true distance on the reference</li>
</ul>
<p>The problem of scaffolding validation is also a challenging one. One of the main issues which hinders from an adequate scaffolding evaluation are genome repeats. The previous standard for evaluation&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/gb-2014-15-3-r42">(Hunt et al.,&nbsp;<em>Genome Biology</em>, 2014)</a>&nbsp;did not take into account repeats. In this evaluation framework, repeats are taken into account.</p>
<p style="text-align: center;"><a href="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" target="_blank"><img src="https://camo.githubusercontent.com/9675b90205e5bc0dc0b6b84b321b00bc87d8d88e/687474703a2f2f616c616e2e63732e6773752e6564752f7265706561742d61776172652f6669677572652e706e67" width="75%" alt="image" style="border: 0px;"></a></p>
<p>The new evaluation framework considers the optimal assignment of contigs in the output scaffolding to contigs in the reference scaffolding in the sense of the number of correct links.</p>
<p>&nbsp;</p>
<p>https://github.com/mandricigor/repeat-aware</p><p>Address of the bookmark: <a href="https://github.com/mandricigor/repeat-aware" rel="nofollow">https://github.com/mandricigor/repeat-aware</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/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>