<?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/29235?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/29235?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27847/anvio</guid>
	<pubDate>Thu, 16 Jun 2016 18:15:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27847/anvio</link>
	<title><![CDATA[Anvio]]></title>
	<description><![CDATA[<p>In a nutshell</p>
<p>Anvi&rsquo;o is an analysis and visualization platform for &lsquo;omics data.</p>
<p>Please find the methods paper here: https://peerj.com/articles/1319/</p>
<p>Anvi&rsquo;o would not have been possible without the help of many people who directly or indirectly contributed to its development. Here is the acknowledgements section of our methods paper</p>
<p><span>An analysis and visualization platform for 'omics data</span><span>&nbsp;</span><span><a href="http://merenlab.org/projects/anvio">http://merenlab.org/projects/anvio</a></span></p>
<p><span>Paper&nbsp;https://peerj.com/articles/1839/</span></p><p>Address of the bookmark: <a href="https://github.com/meren/anvio" rel="nofollow">https://github.com/meren/anvio</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28199/genome-workbench-2107</guid>
	<pubDate>Fri, 01 Jul 2016 12:09:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28199/genome-workbench-2107</link>
	<title><![CDATA[Genome Workbench 2.10.7]]></title>
	<description><![CDATA[<p>Genome Workbench 2.10.7 is here! New features include added support for local custom BLAST databases and improvements to Tree View.</p><p>For the full list of features, improvements and fixes, see the release notes:<a href="https://ncbi.nlm.nih.gov/tools/gbench/releasenotes" target="_blank">https://ncbi.nlm.nih.gov/tools/gbench/releasenotes</a></p><p>New Features</p><ul>
<li>BLAST Tool: added support for local custom BLAST databases</li>
<li>Graphical Sequence View: added log scaling option for graph tracks</li>
<li>Generic Table View:&nbsp;<a href="https://www.ncbi.nlm.nih.gov/tools/gbench/tutorial17">new tutorial</a>&nbsp;added</li>
</ul><p>Bug Fixes and Improvements</p><ul>
<li>Project Tree View: Genomic Collections/Assemblies now show accessions, not just names</li>
<li>Tree View: layout updated to better accommodate nodes of different sizes</li>
<li>Table Import Dialog (MacOS): fixed issue with table visibility</li>
<li>Fixed bug where different molecules IDs in GenBank could resolve to the same sequence</li>
<li>Graphical Sequence View: fixed issue where sequence track was not shown for some sequences</li>
<li>Graphical Sequence View: fixed protein coloration methods</li>
<li>Graphical Sequence View: improved rendering of Markers to better indicate boundaries and produce higher quality PDF images</li>
<li>Create Gene Model tool: fixed scenario when gene model tool failed with local sequences</li>
<li>Search View: ORF Finder &ndash; fixed incorrect protein lengths</li>
<li>Fixed bug with not opening project file (.gbp) on a click</li>
<li>Fixed issues in GVF import</li>
<li>Fixed BLAST Search tool against NCBI databases not working</li>
<li>Fixed tblastn (protein BLAST) not working in standalone mode</li>
<li>Fixed GTF export failure</li>
</ul>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</guid>
	<pubDate>Wed, 13 Jul 2016 07:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</link>
	<title><![CDATA[Scarpa]]></title>
	<description><![CDATA[<p><strong>Scarpa</strong>&nbsp;is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate insert size distributions from data. Scarpa is available free of charge for academic and commercial use under the GNU General Public License (GPL).</p>
<p>See the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/hapsembler-2.21_manual.pdf">user manual</a>&nbsp;or the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/scarpa_paper.pdf">paper</a>&nbsp;for more information about Scarpa. Click&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/ScarpaSupplementary.pdf">here</a>&nbsp;for the supplementary material.</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/scarpa.html" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/scarpa.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31100/vaguevelvet-assembler-graphical-front-end</guid>
	<pubDate>Fri, 24 Feb 2017 08:56:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31100/vaguevelvet-assembler-graphical-front-end</link>
	<title><![CDATA[VAGUE:Velvet Assembler Graphical Front End]]></title>
	<description><![CDATA[<p>VAGUE is a vague acronym for "Velvet Assembler Graphical Front End", which means it is a GUI for the Velvet <em>de novo</em> assembler. The command line version of Velvet can be complicated for beginners to use, but VAGUE makes it clear and simple</p>
<p>More at&nbsp;http://www.vicbioinformatics.com/software.vague.shtml</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.vague.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.vague.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30111/eager</guid>
	<pubDate>Sat, 10 Dec 2016 18:07:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30111/eager</link>
	<title><![CDATA[EAGER]]></title>
	<description><![CDATA[<p><span>The automated reconstruction of genome sequences in ancient genome analysis is a multifaceted process.</span></p>
<p><span>EAGER encompasses both state-of-the-art tools for each step as well as new complementary tools tailored for ancient DNA data within a single integrated solution in an easily accessible format.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0918-z</p><p>Address of the bookmark: <a href="https://github.com/apeltzer/EAGER-GUI" rel="nofollow">https://github.com/apeltzer/EAGER-GUI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30234/last</guid>
	<pubDate>Mon, 19 Dec 2016 14:07:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30234/last</link>
	<title><![CDATA[LAST]]></title>
	<description><![CDATA[<p>LAST can:</p>
<ul>
<li>Handle&nbsp;<strong>big</strong>&nbsp;sequence data, e.g:
<ul>
<li>Compare two vertebrate genomes</li>
<li>Align billions of DNA reads to a genome</li>
</ul>
</li>
<li>Indicate the&nbsp;<a href="http://lastweb.cbrc.jp/about.html">reliability</a>&nbsp;of each aligned column.</li>
<li>Use sequence quality data&nbsp;<a href="http://nar.oxfordjournals.org/content/38/7/e100.abstract">properly</a>.</li>
<li>Compare DNA to proteins, with frameshifts.</li>
<li>Compare PSSMs to sequences</li>
<li>Calculate the likelihood of chance similarities between random sequences.</li>
<li>Do split and spliced alignment.</li>
<li><a href="http://last.cbrc.jp/doc/last-train.html">Train</a>&nbsp;alignment parameters for unusual kinds of sequence (e.g. nanopore).</li>
</ul><p>Address of the bookmark: <a href="http://last.cbrc.jp/" rel="nofollow">http://last.cbrc.jp/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</guid>
	<pubDate>Fri, 04 Nov 2016 12:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</link>
	<title><![CDATA[R Graphical Cookbook by Winston Chang]]></title>
	<description><![CDATA[<p>R Graphical Cookbook by Winston Chang</p><p>A very nice book by Winston Chang for R ethusiast. The R code presented in these pages is the R code actually used to produce the Figures in the book. There will be differences compared to the code chunks shown in the text of the book, but in most cases the differences will be that these pages contain additional code to lay out multiple plots on a single "page".</p><p>The code presented for each figure is self-contained, i.e., all code required to produce the figure is included. This means that there is sometimes considerable overlap of code between several figures  In some cases, it may be necessary to install an add-on package from CRAN to get the code to run.</p><p>More books at http://www.e-reading.club/bookreader.php/137370/C486x_APPb.pdf</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29638" length="37521" type="image/png" />
</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/30153/e-mem-efficient-computation-of-maximal-exact-matches</guid>
	<pubDate>Thu, 15 Dec 2016 09:30:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</link>
	<title><![CDATA[E-MEM: Efficient computation of Maximal Exact Matches]]></title>
	<description><![CDATA[<p>E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.&nbsp;<br><br>E-MEM source code</p>
<p>The source code can be downloaded&nbsp;<a href="http://www.csd.uwo.ca/~ilie/E-MEM/e-mem.zip">here</a>.&nbsp;<br><br>If you use E-MEM, please cite:</p>
<ul>
<li>N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes,&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/31/4/509.short">Bioinformatics</a>&nbsp;<strong>31</strong>(4) (2015) 509 -- 514.</li>
</ul>
<p>For any questions, please contact Lucian Ilie:&nbsp;<a href="mailto:ilie@uwo.ca">ilie@uwo.ca</a>&nbsp;</p><p>Address of the bookmark: <a href="http://www.csd.uwo.ca/~ilie/E-MEM/" rel="nofollow">http://www.csd.uwo.ca/~ilie/E-MEM/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30212/pear</guid>
	<pubDate>Mon, 19 Dec 2016 09:28:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30212/pear</link>
	<title><![CDATA[PEAR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p><p>Address of the bookmark: <a href="http://sco.h-its.org/exelixis/web/software/pear/doc.html" rel="nofollow">http://sco.h-its.org/exelixis/web/software/pear/doc.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>