<?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/44852?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/44852?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</guid>
	<pubDate>Thu, 16 Feb 2017 11:39:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</link>
	<title><![CDATA[HivePlot]]></title>
	<description><![CDATA[<p>The&nbsp;<em>hive plot</em>&nbsp;is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes &mdash; this mapping is based on network structural properties. Edges are drawn as curved links. Simple and interpretable.</p>
<p>The purpose of the hive plot is to establish a new baseline for visualization of large networks &mdash; a method that is both general and tunable and useful as a starting point in visually exploring network structure.</p>
<p>More at&nbsp;http://www.hiveplot.com/</p><p>Address of the bookmark: <a href="http://www.hiveplot.com/" rel="nofollow">http://www.hiveplot.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</guid>
	<pubDate>Wed, 01 Mar 2017 08:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</link>
	<title><![CDATA[Laj: viewing and manipulating the output from pairwise alignment programs]]></title>
	<description><![CDATA[<p>Laj is a tool for viewing and manipulating the output from pairwise alignment programs such as <a href="http://bio.cse.psu.edu/">blastz</a>. It can display interactive dotplot, pip, and text representations of the alignments, a diagram showing the locations of exons and repeats, and annotation links to other web sites containing additional information about particular regions.</p>
<p>The program is written in Java in order to provide a graphical user interface that is portable across a variety of computer platforms; indeed its name stands for "Local Alignments with Java". Currently it exists in two forms, a stand-alone application and a web-based applet, with slightly different capabilities.</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~ratan/" rel="nofollow">http://www.bx.psu.edu/~ratan/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</guid>
	<pubDate>Fri, 03 Mar 2017 09:57:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</link>
	<title><![CDATA[CLgenomics]]></title>
	<description><![CDATA[<p>CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes.</p>
<p>To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics).&nbsp;Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers &gt;40,000 CLG files of publicly available Bacterial and Archaeal genomes.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/clgenomics-software/" rel="nofollow">https://chunlab.wordpress.com/clgenomics-software/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</guid>
	<pubDate>Mon, 06 Mar 2017 04:03:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</link>
	<title><![CDATA[MaxBin: software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm.]]></title>
	<description><![CDATA[<p><span>MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page.</span><br><br><span>Users can use MEGAN or similar software on MaxBin bins to find the taxonomy of each bin after the binning process is finished.</span></p>
<p>https://academic.oup.com/bioinformatics/article/32/4/605/1744462/MaxBin-2-0-an-automated-binning-algorithm-to<br><br><span>The most recent version of MaxBin is 2.2, which supports the analysis of coassemblies of multiple samples. It is available at this JBEI downloads sites as well as&nbsp;</span><a href="https://sourceforge.net/projects/maxbin/" target="_blank">MaxBin</a><span>&nbsp;and&nbsp;</span><a href="https://sourceforge.net/projects/maxbin2/" target="_blank">MaxBin 2.0</a><span>&nbsp;sourceforge sites.</span></p><p>Address of the bookmark: <a href="http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html" rel="nofollow">http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/87/linux-cheat-sheet</guid>
	<pubDate>Tue, 09 Jul 2013 17:30:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/87/linux-cheat-sheet</link>
	<title><![CDATA[Linux Cheat Sheet]]></title>
	<description><![CDATA[<p><span>In an attempt to find a good Linux reference for bioinformatician and BOL readers, I was unsuccessful at finding a decent one on the Internet. So, we decided to make a cheat sheet for biological programmers.</span></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/87" length="81260" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</guid>
	<pubDate>Tue, 07 Mar 2017 08:59:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</link>
	<title><![CDATA[GroopM: Metagenomic binning toolset]]></title>
	<description><![CDATA[<p>GroopM is a metagenomic binning toolset. It leverages spatio-temoral<br>dynamics (differential coverage) to accurately (and almost automatically)<br>extract population genomes from multi-sample metagenomic datasets.</p>
<p>GroopM is largely parameter-free. Use: groopm -h for more info.</p>
<p>For installation and usage instructions see : http://ecogenomics.github.io/GroopM/</p><p>Address of the bookmark: <a href="https://github.com/ecogenomics/GroopM" rel="nofollow">https://github.com/ecogenomics/GroopM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/396/bioinformatics-introduction-to-perl</guid>
	<pubDate>Thu, 11 Jul 2013 09:49:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/396/bioinformatics-introduction-to-perl</link>
	<title><![CDATA[Bioinformatics: Introduction to PERL]]></title>
	<description><![CDATA[<p>This course is aimed at those new to programming and provides an introduction to programming using <strong>Perl</strong>. By the end of this course, attendees should be able to write simple <strong>Perl</strong> programs and to understand more complex <strong>Perl</strong> programs written by others. The course will be taught using the online <a href="http://sofiarobb.com/learning-perl-toc/" title="http://sofiarobb.com/learning-perl-toc/">Learning Perl</a> materials created by <a href="http://stajich.bioinformatics.ucr.edu/members/sofia-robb" title="http://stajich.bioinformatics.ucr.edu/members/sofia-robb">Sofia Robb</a> of the <a href="http://www.ucr.edu/" title="http://www.ucr.edu/">University of California Riverside</a>. Further information is <a href="http://ruddles.bio.cam.ac.uk/%7Edpjudge/Descriptions/PERL.php" title="http://ruddles.bio.cam.ac.uk/~dpjudge/Descriptions/PERL.php">available</a>.</p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>

</channel>
</rss>