<?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/29583?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/29583?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</guid>
	<pubDate>Wed, 29 Jun 2016 15:38:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</link>
	<title><![CDATA[SAM flags]]></title>
	<description><![CDATA[<p>Decoding SAM flags</p>
<p>This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.</p>
<p>To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.</p><p>Address of the bookmark: <a href="https://broadinstitute.github.io/picard/explain-flags.html" rel="nofollow">https://broadinstitute.github.io/picard/explain-flags.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</guid>
	<pubDate>Fri, 03 Mar 2017 05:15:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</link>
	<title><![CDATA[MetaPred2CS]]></title>
	<description><![CDATA[<p style="text-align: justify;"><strong>MetaPred2CS Web server&nbsp;</strong>is a meta-predictor based on&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17160063">Support Vector Machine (SVM)</a>&nbsp;that combines 6 individual sequence based protein-protein interaction prediction methods to predict&nbsp;<strong>prokaryotic two-component system&nbsp;</strong>protein-protein interactions (PPIs). The methods implemented in MetaPred2CS are 2 co-evolutionary methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11933068">in-silico two hybrid (i2h)</a>&nbsp;and&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11707606">mirror tree (MT)</a>&nbsp;methods and 4 genomics context based methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/15947018">phylogenetic profiling (PP)</a>,&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/10573422">gene fusion (GF)</a>,&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene neighbourhood (GN)</a>&nbsp;and and&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene operon methods (GO)</a>.</p>
<p>&nbsp;http://metapred2cs.ibers.aber.ac.uk/</p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/MetaPred2CS" rel="nofollow">https://github.com/martinjvickers/MetaPred2CS</a></p>]]></description>
	<dc:creator>Manisha Mishra</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/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/bookmarks/view/30557/speedseq</guid>
	<pubDate>Fri, 20 Jan 2017 06:05:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</link>
	<title><![CDATA[SpeedSeq]]></title>
	<description><![CDATA[<p>A flexible framework for rapid genome analysis and interpretation</p>
<p>C Chiang, R M Layer, G G Faust, M R Lindberg, D B Rose, E P Garrison, G T Marth, A R Quinlan, and I M Hall. SpeedSeq: ultra-fast personal genome analysis and interpretation. Nat Meth (2015). doi:10.1038/nmeth.3505.</p>
<p><a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html">http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html</a></p><p>Address of the bookmark: <a href="https://github.com/hall-lab/speedseq" rel="nofollow">https://github.com/hall-lab/speedseq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</guid>
	<pubDate>Tue, 08 Nov 2016 07:42:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</link>
	<title><![CDATA[Bookmarks Biostatistics materials and books]]></title>
	<description><![CDATA[<p>Biostatistics did not spring fully formed from the brow of R. A. Fisher, but evolved over many years. This process is continuing, although it may not be obvious from the outside. It has been ten years since the first edition of this book appeared (and rather longer since it was begun). Over this time, new areas of biostatistics have been developed and emphases and interpretations have changed</p>
<p>Please bookmarks your favourate biostatistics&nbsp;books in commend sectons ...</p><p>Address of the bookmark: <a href="http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf" rel="nofollow">http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf</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/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>

</channel>
</rss>