<?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/926?offset=1330</link>
	<atom:link href="https://bioinformaticsonline.com/related/926?offset=1330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</guid>
	<pubDate>Tue, 23 Jan 2018 05:28:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35286/alfred-bam-statistics-and-feature-counting</link>
	<title><![CDATA[Alfred: BAM Statistics and Feature Counting]]></title>
	<description><![CDATA[<p>The easiest way to get Alfred is to download a statically linked binary from the&nbsp;<a href="https://github.com/tobiasrausch/alfred/releases/">Alfred github release page</a>. Alternatively, you can build Alfred from source. Alfred dependencies are included as submodules so you need to do a recursive clone.</p>
<p><code>git clone --recursive https://github.com/tobiasrausch/alfred.git</code></p>
<p><code>cd alfred/</code></p>
<p><code>make all</code></p>
<p>https://github.com/tobiasrausch/alfred/</p><p>Address of the bookmark: <a href="https://gear.embl.de/alfred" rel="nofollow">https://gear.embl.de/alfred</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</guid>
	<pubDate>Fri, 03 Mar 2017 08:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</link>
	<title><![CDATA[MyCC: Accurate binning of metagenomic contigs via automated clustering sequences using information of genomic signatures and marker genes]]></title>
	<description><![CDATA[<p><span>MyCC, an automated binning tool that combines genomic signatures, marker genes and optional contig coverages within one or multiple samples, in order to visualize the metagenomes and to identify the reconstructed genomic fragments.</span></p>
<p><span>More at&nbsp;http://www.nature.com/articles/srep24175</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/sb2nhri/files/MyCC/" rel="nofollow">https://sourceforge.net/projects/sb2nhri/files/MyCC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</guid>
	<pubDate>Mon, 06 Mar 2017 03:49:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</link>
	<title><![CDATA[Prokka: tool for the rapid annotation of prokaryotic genomes]]></title>
	<description><![CDATA[<p>Prokka is a software tool for the rapid annotation of prokaryotic genomes. A typical 4 Mbp genome can be fully annotated in less than 10 minutes on a quad-core computer, and scales well to 32 core SMP systems. It produces GFF3, GBK and SQN files that are ready for editing in Sequin and ultimately submitted to Genbank/DDJB/ENA.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.prokka.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.prokka.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1906</guid>
	<pubDate>Sun, 11 Aug 2013 11:13:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1906</link>
	<title><![CDATA[Compressive Genomics]]></title>
	<description><![CDATA[<p>The key to finding a solution is to notice that most&nbsp;<a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">genomic</a>sequences differ by very little. It may well be that the number of complete genome sequences being stored is increasing rapidly, but the actual amount of new data is very small. In other words, a single DNA sequence isn't particularly compressible but a set of sequences shares so much in common that the redundancy can be used to store them in a much smaller storage space. (Source:e-article from&nbsp;Alex Armstrong)</p><p><a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html</a></p><p><a href="http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data">http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data</a></p><p><a href="http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html">http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html</a></p><p><a href="http://bioinformatics.oxfordjournals.org/content/29/13/i283.full">http://bioinformatics.oxfordjournals.org/content/29/13/i283.full</a></p><p><a href="http://groups.csail.mit.edu/cb/cast/">http://groups.csail.mit.edu/cb/cast/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</guid>
	<pubDate>Tue, 07 Mar 2017 08:50:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</link>
	<title><![CDATA[COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)]]></title>
	<description><![CDATA[<p>COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.</p>
<p>News: Python version of COCACOLA is available now!</p><p>Address of the bookmark: <a href="https://github.com/younglululu/COCACOLA" rel="nofollow">https://github.com/younglululu/COCACOLA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</guid>
	<pubDate>Fri, 10 Mar 2017 08:51:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</link>
	<title><![CDATA[sequenceserver]]></title>
	<description><![CDATA[<p><span>SequenceServer lets you rapidly set up a BLAST+ server with an intuitive user interface for use locally or over the web.</span></p>
<p><span><span>More at&nbsp;</span><a href="http://sequenceserver.com/">http://sequenceserver.com</a><span>.</span></span></p><p>Address of the bookmark: <a href="https://github.com/wurmlab/sequenceserver" rel="nofollow">https://github.com/wurmlab/sequenceserver</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/459</guid>
	<pubDate>Thu, 11 Jul 2013 14:39:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/459</link>
	<title><![CDATA[Python vs Perl]]></title>
	<description><![CDATA[<p>Why bioinformatician still using Perl when Python is easy to code, good in ReXp and faster than perl?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/840/junior-research-fellow-jrf</guid>
  <pubDate>Sat, 13 Jul 2013 11:17:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF)]]></title>
  <description><![CDATA[
<p>School of Biotechnology<br />Gautam Buddha University<br />Greater Noida, UP - 201310</p>

<p>Applications are invited for one position of Junior Research Fellow (JRF) in a Department of Biotechnology (DBT) sponsored research project entitled “Design, synthesis and evaluation of potent aminopeptidase inhibitors for malarial therapy” under the supervision of Dr. Shakti Sahi.</p>

<p>The monthly fellowship of JRF will be Rs 12,000/- plus HRA as per the University rules.</p>

<p>Essential Qualification: Master degree in any discipline of Life Science with NET qualified.</p>

<p>Desirable Qualification: Preference will be given to candidates having research experience in in silico drug designing/Bioinformatics.</p>

<p>Interested candidates may send their resume to undersigned on or before 14th July 2013 by post-mail/e-mail shaktis@gbu.ac.in or shaktisahi@gmail.com. No TA and DA will be paid for appearing for the interview. Dr. Shakti Sahi (Principle Investigator)</p>

<p>Advertisement:<br />www.gbu.ac.in/Recruitment/JRF_Advt_DBTProject_Shakt</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>