<?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/34814?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/34814?offset=160" 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/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</guid>
	<pubDate>Wed, 24 May 2017 10:39:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</link>
	<title><![CDATA[Synteny Portal: a web-based application portal for synteny block analysis]]></title>
	<description><![CDATA[<p><span>Synteny Portal, a versatile web-based application portal for constructing, visualizing and browsing synteny blocks. With Synteny Portal, users can easily (i) construct synteny blocks among multiple species by using prebuilt alignments in the UCSC genome browser database, (ii) visualize and download syntenic relationships as high-quality images, (iii) browse synteny blocks with genetic information and (iv) download the details of synteny blocks to be used as input for downstream synteny-based analyses, all in an intuitive and easy-to-use web-based interface. We believe that Synteny Portal will serve as a highly valuable tool that will enable biologists to easily perform comparative genomics studies by compensating limitations of existing tools. Synteny Portal is freely available at&nbsp;</span><a href="http://bioinfo.konkuk.ac.kr/synteny_portal" target="pmc_ext">http://bioinfo.konkuk.ac.kr/synteny_portal</a><span>.</span></p>
<p>http://bioinfo.konkuk.ac.kr/synteny_portal/</p><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/synteny_portal/" rel="nofollow">http://bioinfo.konkuk.ac.kr/synteny_portal/</a></p>]]></description>
	<dc:creator>Jit</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/news/view/34369/scfbio-have-developed-sanjeevini</guid>
	<pubDate>Fri, 17 Nov 2017 07:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/34369/scfbio-have-developed-sanjeevini</link>
	<title><![CDATA[SCFBio have developed Sanjeevini]]></title>
	<description><![CDATA[<p><span>SCFBio have developed a new android based application for drug design called&nbsp;</span><strong>Sanjeevini</strong><span>&nbsp;(</span><a href="https://play.google.com/store/apps/details?id=com.sanjeevini&amp;hl=en" target="_blank">https://play.google.com/store/apps/details?id=com.sanjeevini&amp;hl=en</a><span>). It is available free of charge. You can download it using Google play store. Just search for&nbsp;</span><strong>"Sanjeevini-SCFBIO-CADD</strong><span>" in Google play store. It contains all modules used by current Sanjeevini users. We have worked towards making a unified and easy to use interface. The app now supports all major small molecule file formats (pdb, mol, sdf, mol2 and xyz). The application contains inbuilt visualizer JSmol for easy analysis of results. Users can now directly download the protein files from PDB ("Get protein PDB file" in `FILE` Menu) and prepare it using the easy to use in-built module "Prepare protein/DNA".</span><br /><br /><span><span>SCFBio</span>&nbsp;have worked towards making the process of Job retrieval more streamlined and user friendly. All jobs are now recorded in the "Job results". It can be accessed using the main page of the application. Job status can now be retrieved by clicking on the refresh button against the job ID.</span><br /><br /><span><span>SCFBio</span>&nbsp;have also added a new feature of accessing Jobs run on different android application. Users can retrieve jobs run by other users by sharing the job ID and module name. This feature can be accessed using the Import Jobs option in File menu. We hope this feature will help collaborating groups stay in touch with each other.</span><br /><br /><span>The module contains all modules of Sanjeevini suite of software for structure based Drug design.</span><br /><br /></p><table width="630" cellspacing="0" cellpadding="7">
<thead>
<tr>
<td><strong>Sl No.</strong></td>
<td><strong>Module name</strong></td>
<td><strong>Activity</strong></td>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>Prepare Protein/DNA</td>
<td>Prepares protein/DNA for other modules of Sanjeevini</td>
</tr>
<tr>
<td>2</td>
<td>Prepare ligand</td>
<td>Prepares ligands for other modules of Sanjeevini</td>
</tr>
<tr>
<td>3</td>
<td>Active site Prediction</td>
<td>Predicts biologically relevant sites in a protein</td>
</tr>
<tr>
<td>4</td>
<td>ParDOCK</td>
<td>Rigid Docking of Protein-Ligand complex</td>
</tr>
<tr>
<td>5</td>
<td>BAPPL</td>
<td>Binding affinity prediction of Protein-Ligand complex</td>
</tr>
<tr>
<td>6</td>
<td>BAPPL Z</td>
<td>Binding affinity prediction of Protein-Zinc-Ligand complex</td>
</tr>
<tr>
<td>7</td>
<td>DNA ligand Docking</td>
<td>Rigid Docking of DNA-Ligand complex</td>
</tr>
<tr>
<td>8</td>
<td>PreDDICTA</td>
<td>Binding affinity prediction of DNA-Ligand complex</td>
</tr>
<tr>
<td>9</td>
<td>SOM Prediction</td>
<td>Rigid Docking of Ligand and CYP proteins</td>
</tr>
<tr>
<td>10</td>
<td>Lipinski filters</td>
<td>Checks Lipinski's rule of five for ligand molecule</td>
</tr>
<tr>
<td>11</td>
<td>Molecular volume</td>
<td>Calculates volume of a ligand</td>
</tr>
<tr>
<td>12</td>
<td>RASPD</td>
<td>Virtual screening of protein molecule to yield hit molecules</td>
</tr>
<tr>
<td>13</td>
<td>AADS</td>
<td>Prediction and docking of top 10 biologically relevant sites on protein</td>
</tr>
<tr>
<td>14</td>
<td>Intercalate</td>
<td>Rigid Docking of DNA-Ligand complex in intercalation sites</td>
</tr>
<tr>
<td>15</td>
<td>DNA sequence to str.</td>
<td>Converts DNA sequence to DNA structure (A-DNA or B-DNA)</td>
</tr>
<tr>
<td>16</td>
<td>NRDBSM</td>
<td>Non-redundant database of small molecules</td>
</tr>
<tr>
<td>17</td>
<td>TPACM4</td>
<td>Partial charge calculator for small molecules</td>
</tr>
<tr>
<td>18</td>
<td>Wiener index</td>
<td>Wiener index calculator for small molecules</td>
</tr>
</tbody>
</table><p><strong>The results can be downloaded to the PC desktop for further analysis</strong><span>. For this you can use this accompanying website for this purpose:</span><br /><a href="http://www.scfbio-iitd.res.in/sanjapp/webSearch/Sanjeevini_webpage.html" target="_blank">http://www.scfbio-iitd.res.in/sanjapp/webSearch/Sanjeevini_webpage.html</a><br /><br /><span>On more information on how to use the application please visit:&nbsp;</span><a href="http://scfbio-iitd.res.in/sanjapp/webSearch/doc.html" target="_blank">http://scfbio-iitd.res.in/sanjapp/webSearch/doc.html</a><br /><span>or</span><br /><a href="http://scfbio-iitd.res.in/sanjeeviniapp/tut.html" target="_blank">http://scfbio-iitd.res.in/sanjeeviniapp/tut.html</a><br /><br /><span>Please email us your valuable comments and suggestions at&nbsp;</span><a href="mailto:iitd.scfbio@gmail.com" target="_blank">iitd.scfbio@gmail.com</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>

</channel>
</rss>