<?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/43791?offset=460</link>
	<atom:link href="https://bioinformaticsonline.com/related/43791?offset=460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 07 Mar 2018 18:11:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>https://www.youtube.com/watch?v=WgufqYMHCvM</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41736/synvisio-an-interactive-multiscale-synteny-visualization-tool-for-mcscanx</guid>
	<pubDate>Sun, 31 May 2020 02:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41736/synvisio-an-interactive-multiscale-synteny-visualization-tool-for-mcscanx</link>
	<title><![CDATA[SynVisio: An Interactive Multiscale Synteny Visualization Tool for McScanX.]]></title>
	<description><![CDATA[<p>SynVisio lets you explore the results of&nbsp;<a href="http://chibba.pgml.uga.edu/mcscan2/">McScanX</a>&nbsp;a popular synteny and collinearity detection toolkit and generate publication ready images.</p>
<p>SynVisio requires two files to run:</p>
<ul>
<li>The&nbsp;<strong>simplified gff file</strong>&nbsp;that was used as an input for a McScanX query.</li>
<li>The&nbsp;<strong>collinearity file</strong>&nbsp;generated as an output by McScanX for the same input query.</li>
<li>Optional&nbsp;<strong>track file</strong>&nbsp;in bedgraph format to annotate the generated charts.</li>
</ul>
<p>SynVisio offers different types of visualizations such as&nbsp;<strong>Linear Parallel plots</strong>,&nbsp;<strong>Hive plots</strong>,&nbsp;<strong>Stacked Parallel Plots&nbsp;</strong>and&nbsp;<strong>Dot plots</strong>. Users can configure the type of plots required and then choose the source and the target chromosomes that need to be mapped. Users also have option to download the generated visualizations in publication ready SVG or PNG formats.</p><p>Address of the bookmark: <a href="https://synvisio.github.io/#/" rel="nofollow">https://synvisio.github.io/#/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</guid>
	<pubDate>Fri, 14 Jun 2024 14:42:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</link>
	<title><![CDATA[Panacus : A Counting Tool for Pangenome Graphs]]></title>
	<description><![CDATA[<p dir="auto"><code>panacus</code>&nbsp;is a tool for calculating statistics for&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA</a>&nbsp;files. It supports GFA files with&nbsp;<code>P</code>&nbsp;and&nbsp;<code>W</code>&nbsp;lines, but requires that the graph is&nbsp;<code>blunt</code>, i.e., nodes do not overlap and consequently, each link (<code>L</code>) points from the end of one segment (<code>S</code>) to the start of another.</p>
<p dir="auto"><code>panacus</code>&nbsp;supports the following calculations:</p>
<ul dir="auto">
<li>coverage histogram</li>
<li>pangenome growth statistics</li>
<li>path-/group-resolved coverage table</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marschall-lab/panacus" rel="nofollow">https://github.com/marschall-lab/panacus</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42303/fqc-dashboard-integrates-fastqc-results-into-a-web-based-interactive-and-extensible-fastq-quality-control-tool</guid>
	<pubDate>Tue, 10 Nov 2020 01:30:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42303/fqc-dashboard-integrates-fastqc-results-into-a-web-based-interactive-and-extensible-fastq-quality-control-tool</link>
	<title><![CDATA[FQC Dashboard: Integrates FastQC results into a web-based, interactive, and extensible FASTQ quality control tool]]></title>
	<description><![CDATA[<p>FQC is software that facilitates quality control of FASTQ files by carrying out a QC protocol using FastQC, parsing results, and aggregating quality metrics into an interactive dashboard designed to richly summarize individual sequencing runs. The dashboard groups samples in dropdowns for navigation among the data sets, utilizes human-readable configuration files to manipulate the pages and tabs, and is extensible with CSV data.</p><p>Address of the bookmark: <a href="https://github.com/pnnl/fqc" rel="nofollow">https://github.com/pnnl/fqc</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33866/perlbrew-admin-free-perl-installation-management-tool</guid>
	<pubDate>Wed, 12 Jul 2017 03:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33866/perlbrew-admin-free-perl-installation-management-tool</link>
	<title><![CDATA[Perlbrew: admin-free perl installation management tool.]]></title>
	<description><![CDATA[<p>perlbrew is an admin-free perl installation management tool. The latest version is 0.79, read the release note:&nbsp;<a href="https://perlbrew.pl/Release-0.79.html">Release 0.79</a>.&nbsp;</p>
<p>Copy &amp; Paste this line into your terminal:</p>
<pre><code>\curl -L https://install.perlbrew.pl | bash
</code></pre>
<p>Or, if your system does not have curl but something else:</p>
<pre><code># Linux
\wget -O - https://install.perlbrew.pl | bash

# FreeBSD
\fetch -o- https://install.perlbrew.pl | sh
</code></pre>
<p>If you prefer to install with cpan, there are two steps:</p>
<pre><code>sudo cpan App::perlbrew
perlbrew init
</code></pre>
<p>If it is installed with cpan, the perlbrew executable should be installed as&nbsp;<code>/usr/bin/perlbrew</code>&nbsp;or&nbsp;<code>/usr/local/bin/perlbrew</code>. For all users who want to use perlbrew, a prior&nbsp;<code>perlbrew init</code>&nbsp;needs to be executed.</p>
<p>The default perlbrew root directory is&nbsp;<code>~/perl5/perlbrew</code>, which can be changed by setting&nbsp;<code>PERLBREW_ROOT</code>environment variable before the installation and initialization. For more advanced installation process, please read&nbsp;<a href="http://metacpan.org/module/App::perlbrew">the perlbrew document</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://perlbrew.pl/" rel="nofollow">https://perlbrew.pl/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</guid>
	<pubDate>Thu, 24 May 2018 02:53:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36752/minmax-a-versatile-tool-for-calculating-and-comparing-synonymous-codon-usage-and-its-impact-on-protein-folding</link>
	<title><![CDATA[%MinMax: A versatile tool for calculating and comparing synonymous codon usage and its impact on protein folding.]]></title>
	<description><![CDATA[%MM calculates whether a given gene sequence encodes amino acids using the most common codons possible, the least common codons possible, or (most typically) some combination of these extremes. See our PLoS ONE paper for more details on how the %MinMax algorithm works. 

%MinMax results are averaged over an 18-codon sliding window; hence the result for "codon window = 1" is the average codon usage for codons 1-18, codon window 2 = codons 2-19, etc.<p>Address of the bookmark: <a href="http://www.codons.org/" rel="nofollow">http://www.codons.org/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</guid>
	<pubDate>Mon, 04 Jun 2018 03:45:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</link>
	<title><![CDATA[“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files]]></title>
	<description><![CDATA[One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.

Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon
Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files
Compute summary statistics for each TE family (number of TE copies, genome coverage...)
Ambiguous cases such as nested TE can be assembled into copies automatically or manually
Allow for working with a TE user-defined library
Allow for working with only a user-chosen set of TE families


http://doua.prabi.fr/software/one-code-to-find-them-all<p>Address of the bookmark: <a href="http://doua.prabi.fr/software/one-code-to-find-them-all" rel="nofollow">http://doua.prabi.fr/software/one-code-to-find-them-all</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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>

</channel>
</rss>