<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=770</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=770" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</guid>
	<pubDate>Tue, 06 Mar 2018 05:02:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35823/regen-ancestral-genome-reconstruction-for-bacteria</link>
	<title><![CDATA[REGEN: Ancestral Genome Reconstruction for Bacteria]]></title>
	<description><![CDATA[<p><span>REGEN infers evolutionary events, including gene creation and deletion and replicon fission and fusion. The reconstruction can be performed by either a maximum parsimony or a maximum likelihood method. Gene content reconstruction is based on the concept of neighboring gene pairs. REGEN was designed to be used with any set of genomes that are sufficiently related, which will usually be the case for bacteria within the same taxonomic order.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.mdpi.com/2073-4425/3/3/423" rel="nofollow">http://www.mdpi.com/2073-4425/3/3/423</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35800/scikit-bio%E2%84%A2-is-an-open-source-bsd-licensed-python-package-providing-data-structures-algorithms-and-educational-resources-for-bioinformatics</guid>
	<pubDate>Fri, 02 Mar 2018 04:29:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35800/scikit-bio%E2%84%A2-is-an-open-source-bsd-licensed-python-package-providing-data-structures-algorithms-and-educational-resources-for-bioinformatics</link>
	<title><![CDATA[scikit-bio™ is an open-source, BSD-licensed, python package providing data structures, algorithms, and educational resources for bioinformatics.]]></title>
	<description><![CDATA[<p><span>scikit-bio is currently in beta. We are very actively developing it, and&nbsp;</span><strong>backward-incompatible interface changes can and will arise</strong><span>. To avoid these types of changes being a surprise to our users, our public APIs are decorated to make it clear to users when an API can be relied upon (stable) and when it may be subject to change (experimental). See the&nbsp;</span><a href="https://github.com/biocore/scikit-bio/blob/master/doc/source/user/api_stability.rst">API stability docs</a><span>&nbsp;for more details, including what we mean by&nbsp;</span><em>stable</em><span>&nbsp;and&nbsp;</span><em>experimental</em><span>&nbsp;in this context.</span></p><p>Address of the bookmark: <a href="http://scikit-bio.org/" rel="nofollow">http://scikit-bio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35798/an-introduction-to-applied-bioinformatics</guid>
	<pubDate>Fri, 02 Mar 2018 04:26:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35798/an-introduction-to-applied-bioinformatics</link>
	<title><![CDATA[An Introduction to Applied Bioinformatics]]></title>
	<description><![CDATA[<p>IAB is primarily being developed by&nbsp;<a href="http://caporasolab.us/people/greg-caporaso/">Greg Caporaso</a>(GitHub/Twitter:&nbsp;<a href="https://github.com/gregcaporaso">@gregcaporaso</a>) in the&nbsp;<a href="http://www.caporasolab.us/">Caporaso Lab</a>&nbsp;at&nbsp;<a href="http://www.nau.edu/">Northern Arizona University</a>. You can find information on the courses I teach on&nbsp;<a href="http://www.caporasolab.us/teaching">my teaching website</a>&nbsp;and information on my research and lab on&nbsp;<a href="http://www.caporasolab.us/">my lab website</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://readiab.org/" rel="nofollow">http://readiab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</guid>
	<pubDate>Thu, 01 Mar 2018 06:20:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</link>
	<title><![CDATA[Protein Subcellular Localization Prediction]]></title>
	<description><![CDATA[<p>Assigning subcellular localization to a protein is an important step towards elucidating its interaction partners, function, and potential role(s) in the cellular machinery. Computational tools offer an attractive complement to time-consuming and laborious experimental methods.</p>
<p>http://abi.inf.uni-tuebingen.de/Services/YLoc/webloc.cgi</p><p>Address of the bookmark: <a href="https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization" rel="nofollow">https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35764/generate-interactive-codon-usage-plots</guid>
	<pubDate>Wed, 28 Feb 2018 03:47:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35764/generate-interactive-codon-usage-plots</link>
	<title><![CDATA[Generate interactive codon usage plots]]></title>
	<description><![CDATA[<p>Generate interactive codon usage plots as used at&nbsp;<a href="http://ensembl.lepbase.org/">ensembl.lepbase.org</a>. The input file format can be generated from an&nbsp;<a href="http://ensembl.org/">Ensembl</a>&nbsp;database using the&nbsp;<code>export_json.pl</code>&nbsp;script from the&nbsp;<a href="http://easy-import.readme.io/">easy-import</a>&nbsp;pipeline.</p>
<p><a href="http://content.lepbase.org/pages/annotations/codon-usage.html?assembly=Heliconius_melpomene_Hmel2">live demo</a></p><p>Address of the bookmark: <a href="https://github.com/rjchallis/codon-usage" rel="nofollow">https://github.com/rjchallis/codon-usage</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</guid>
	<pubDate>Wed, 28 Feb 2018 03:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</link>
	<title><![CDATA[Genome assembly stats plotting]]></title>
	<description><![CDATA[<p>A&nbsp;<em>de novo</em>&nbsp;genome assembly can be summarised b</p>
<p>y a number of metrics, including:</p>
<ul>
<li>Overall assembly length</li>
<li>Number of scaffolds/contigs</li>
<li>Length of longest scaffold/contig</li>
<li>Scaffold/contig N50 and N90Assembly base composition, in particular percentage GC and percentage Ns</li>
<li>CEGMA completeness</li>
<li>Scaffold/contig length/count distribution</li>
</ul>
<p>assembly-stats supports two widely used presentations of these values, tabular and cumulative length plots, and introduces an additional circular plot that summarises most commonly used assembly metrics in a single visualisation. Each of these presentations is generated using javascript from a common (JSON) data structure, allowing toggling between alternative views, and each can be applied to a single or multiple assemblies to allow direct comparison of alternate assemblies.</p>
<p>Tabular presentation allows direct comparison of exact values between assemblies, the limitations of this approach lie in the necessary omission of distributions and the challenge of interpreting ratios of values that may vary by several orders of magnitude.</p><p>Address of the bookmark: <a href="https://github.com/rjchallis/assembly-stats" rel="nofollow">https://github.com/rjchallis/assembly-stats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</guid>
	<pubDate>Mon, 19 Feb 2018 06:46:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</link>
	<title><![CDATA[ETE 3: Reconstruction, Analysis, and Visualization of Phylogenomic Data]]></title>
	<description><![CDATA[<p><span>ETE v3, featuring numerous improvements in the underlying library of methods, and providing a novel set of standalone tools to perform common tasks in comparative genomics and phylogenetics. </span></p>
<p><span>The new features include </span></p>
<p><span>(i) building gene-based and supermatrix-based phylogenies using a single command, </span></p>
<p><span>(ii) testing and visualizing evolutionary models, </span></p>
<p><span>(iii) calculating distances between trees of different size or including duplications, and </span></p>
<p><span>(iv) providing seamless integration with the NCBI taxonomy database. </span></p>
<p><span>ETE is freely available at&nbsp;</span><a href="http://etetoolkit.org/" target="">http://etetoolkit.org</a></p><p>Address of the bookmark: <a href="http://etetoolkit.org" rel="nofollow">http://etetoolkit.org</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</guid>
	<pubDate>Wed, 14 Feb 2018 02:49:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</link>
	<title><![CDATA[MeDuSa: a multi-draft based scaffolder]]></title>
	<description><![CDATA[<p><span>MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/combogenomics/medusa" rel="nofollow">https://github.com/combogenomics/medusa</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35565/circosjs-d3-library-to-build-circular-graphs</guid>
	<pubDate>Tue, 13 Feb 2018 06:57:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35565/circosjs-d3-library-to-build-circular-graphs</link>
	<title><![CDATA[circosJS: d3 library to build circular graphs]]></title>
	<description><![CDATA[<p>Circos is a javascript library to easily build interactive graphs in a circular layout. It's based on&nbsp;<a href="https://d3js.org/">d3.js</a>. It aims to be a javascript version of the&nbsp;<a href="http://circos.ca/">Circos</a>&nbsp;software.</p>
<p>You should consider using Circos to show:</p>
<ul>
<li>relationships between entities</li>
<li>periodical data</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nicgirault/circosJS" rel="nofollow">https://github.com/nicgirault/circosJS</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>