<?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/36905?offset=180</link>
	<atom:link href="https://bioinformaticsonline.com/related/36905?offset=180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44659/figeno-tool-for-plotting-sequencing-data-along-genomic-coordinates</guid>
	<pubDate>Tue, 17 Sep 2024 02:28:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44659/figeno-tool-for-plotting-sequencing-data-along-genomic-coordinates</link>
	<title><![CDATA[Figeno: Tool for plotting sequencing data along genomic coordinates.]]></title>
	<description><![CDATA[<p><span>Tool for plotting sequencing data along genomic coordinates.</span></p>
<div>
<pre><code>FIGENO is a
  FIGure
    GENerator
for GENOmics</code></pre>
</div>
<p dir="auto">With figeno, you can plot various types of sequencing data along genomic coordinates. Video overview:&nbsp;<a href="https://www.youtube.com/watch?v=h1cBeXoSYTA">https://www.youtube.com/watch?v=h1cBeXoSYTA</a>.</p>
<p dir="auto"><a href="https://github.com/CompEpigen/figeno/blob/main/docs/content/images/figeno.png" target="_blank"><img src="https://github.com/CompEpigen/figeno/raw/main/docs/content/images/figeno.png" alt="figeno" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/CompEpigen/figeno" rel="nofollow">https://github.com/CompEpigen/figeno</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</guid>
	<pubDate>Sat, 18 Nov 2017 16:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</link>
	<title><![CDATA[CHSMiner: a GUI tool to identify chromosomal homologous segments]]></title>
	<description><![CDATA[<div id="ASec1">
<h3>Background</h3>
<p>The identification of chromosomal homologous segments (CHS) within and between genomes is essential for comparative genomics. Various processes including insertion/deletion and inversion could cause the degeneration of CHSs.</p>
</div>
<div id="ASec2">
<h3>Results</h3>
<p>Here we present a Java software CHSMiner that detects CHSs based on shared gene content alone. It implements fast greedy search algorithm and rigorous statistical validation, and its friendly graphical interface allows interactive visualization of the results. We tested the software on both simulated and biological realistic data and compared its performance with similar existing software and data source.</p>
</div>
<div id="ASec3">
<h3>Conclusion</h3>
<p>CHSMiner is characterized by its integrated workflow, fast speed and convenient usage. It will be useful for both experimentalists and bioinformaticians interested in the structure and evolution of genomes.</p>
<p>&nbsp;</p>
<p>https://github.com/zhenwang100/CHSMiner</p>
</div><p>Address of the bookmark: <a href="https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2" rel="nofollow">https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</guid>
	<pubDate>Tue, 06 Mar 2018 16:39:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35885/multi-car-a-tool-of-contig-scaffolding-using-multiple-references</link>
	<title><![CDATA[Multi-CAR: a tool of contig scaffolding using multiple references]]></title>
	<description><![CDATA[<p><span>we design a simple heuristic method to further revise our single reference-based scaffolding tool CAR into a new one called Multi-CAR such that it can utilize multiple complete genomes of related organisms as references to more accurately order and orient the contigs of a draft genome. In practical usage, our Multi-CAR does not require prior knowledge concerning phylogenetic relationships among the draft and reference genomes and libraries of paired-end reads. To validate Multi-CAR, we have tested it on a real dataset composed of several prokaryotic genomes and also compared its accuracy performance with other multiple reference-based scaffolding tools Ragout and MeDuSa.&nbsp;</span></p><p>Address of the bookmark: <a href="http://genome.cs.nthu.edu.tw/Multi-CAR/" rel="nofollow">http://genome.cs.nthu.edu.tw/Multi-CAR/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</guid>
	<pubDate>Tue, 29 May 2018 07:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</link>
	<title><![CDATA[Porechop:  tool for finding and removing adapters from Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Porechop is a tool for finding and removing adapters from <a href="https://nanoporetech.com/">Oxford Nanopore</a> reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.</p>
<p>Porechop also supports demultiplexing of Nanopore reads that were barcoded with the <a href="https://store.nanoporetech.com/native-barcoding-kit-1d.html">Native Barcoding Kit</a>, <a href="https://store.nanoporetech.com/pcr-barcoding-kit-96.html">PCR Barcoding Kit</a> or <a href="https://store.nanoporetech.com/rapid-barcoding-sequencing-kit.html">Rapid Barcoding Kit</a>.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Porechop" rel="nofollow">https://github.com/rrwick/Porechop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</guid>
	<pubDate>Mon, 01 Oct 2018 08:34:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37800/heatmapper-web-enabled-heat-mapping-for-all</link>
	<title><![CDATA[Heatmapper: web-enabled heat mapping for all]]></title>
	<description><![CDATA[<p><span>Heatmapper is a freely available web server that allows users to interactively visualize their data in the form of heat maps through an easy-to-use graphical interface. Heatmapper is a versatile tool that allows users to easily create a wide variety of heat maps for many different data types and applications. Heatmapper allows users to generate, cluster and visualize: </span></p>
<p><span>1)&nbsp;</span><span>expression-based heat maps</span><span>&nbsp;from transcriptomic, proteomic and metabolomic experiments; 2)&nbsp;</span><span>pairwise distance maps</span><span>; </span></p>
<p><span>3)&nbsp;</span><span>correlation maps</span><span>; </span></p>
<p><span>4)&nbsp;</span><span>image overlay heat maps</span><span>; </span></p>
<p><span>5)&nbsp;</span><span>latitude and longitude heat maps</span><span>&nbsp;and </span></p>
<p><span>6)&nbsp;</span><span>geopolitical (choropleth) heat maps</span><span>. </span></p>
<p><span>Heatmapper offers a number of simple and intuitive customization options for easy adjustments to each heat map&rsquo;s appearance and plotting parameters. Heatmapper also allows users to interactively explore their numeric data values by hovering their cursor over each heat map, or by using a searchable/sortable data table view.</span></p>
<p><span>Ref&nbsp;https://www.ncbi.nlm.nih.gov/pubmed/27190236</span></p><p>Address of the bookmark: <a href="http://www2.heatmapper.ca/" rel="nofollow">http://www2.heatmapper.ca/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</guid>
	<pubDate>Wed, 12 Dec 2018 09:16:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38449/koala-keggs-internal-annotation-tool-for-k-number-assignment-of-kegg-genes-using-ssearch-computation</link>
	<title><![CDATA[KOALA: KEGG&#039;s internal annotation tool for K number assignment of KEGG GENES using SSEARCH computation]]></title>
	<description><![CDATA[<p>KOALA (KEGG Orthology And Links Annotation) is KEGG's internal annotation tool for&nbsp;<a href="https://www.kegg.jp/kegg/ko.html">K number</a>&nbsp;assignment of KEGG GENES using SSEARCH computation. BlastKOALA and GhostKOALA assign K numbers to the user's sequence data by&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/">BLAST</a>&nbsp;and&nbsp;<a href="http://www.bi.cs.titech.ac.jp/ghostx/">GHOSTX</a>&nbsp;searches, respectively, against a nonredundant set of KEGG GENES. Annotate Sequence in KEGG Mapper and Pathogen Checker in KEGG Pathogen are special interfaces to the BlastKOALA server and can be executed in an interactive mode. &nbsp;&nbsp; See&nbsp;<a href="https://www.kegg.jp/blastkoala/help_blastkoala.html" target="_blastkoala">Step-by-step Instructions</a>.</p>
<div>Reference: Kanehisa, M., Sato, Y., and Morishima, K. (2016) BlastKOALA and GhostKOALA: KEGG tools for functional characterization of genome and metagenome sequences. J. Mol. Biol. 428, 726-731. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/26585406">pubmed</a>] [<a href="https://doi.org/10.1016/j.jmb.2015.11.006">pdf</a>]</div><p>Address of the bookmark: <a href="https://www.kegg.jp/blastkoala/" rel="nofollow">https://www.kegg.jp/blastkoala/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</guid>
	<pubDate>Tue, 03 Dec 2019 02:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40359/minipolish-a-tool-for-racon-polishing-of-miniasm-assemblies</link>
	<title><![CDATA[Minipolish: A tool for Racon polishing of miniasm assemblies]]></title>
	<description><![CDATA[<p><a href="https://github.com/lh3/miniasm">Miniasm</a>&nbsp;is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate &ndash; they are essentially made of stitched-together pieces of long reads.</p>
<p><a href="https://github.com/isovic/racon">Racon</a>&nbsp;is a great polishing tool that can be used to clean up assembly errors. It's also very fast and well suited for long-read data. However, it operates on FASTA files, not the&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA graphs</a>&nbsp;that miniasm makes.</p>
<p>That's where Minipolish comes in. With a single command, it will use Racon to polish up a miniasm assembly, while keeping the assembly in graph form.</p>
<p>It also takes care of some of the other nuances of polishing a miniasm assembly:</p>
<ul>
<li>Adding read depth information to contigs</li>
<li>Fixing sequence truncation that can occur in Racon</li>
<li>Adding circularising links to circular contigs if not already present (so they display better in&nbsp;<a href="https://github.com/rrwick/Bandage">Bandage</a>)</li>
<li>'Rotating' circular contigs between polishing rounds to ensure clean circularisation</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Minipolish" rel="nofollow">https://github.com/rrwick/Minipolish</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>