<?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/27461?offset=760</link>
	<atom:link href="https://bioinformaticsonline.com/related/27461?offset=760" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27555/phd-at-institute-of-life-sciences-bhubaneswar</guid>
  <pubDate>Mon, 30 May 2016 03:36:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[PhD at INSTITUTE OF LIFE SCIENCES, Bhubaneswar]]></title>
  <description><![CDATA[
<p>INSTITUTE OF LIFE SCIENCES</p>

<p>Bhubaneswar 751023</p>

<p>Advt No. 07/2016</p>

<p>Institute of Life Sciences (ILS), Bhubaneswar, an autonomous Institute of the Department of Biotechnology, Ministry of Science &amp; Technology, Government of India engaged in advanced research invites applications from Indian nationals for the Ph.D. program. The main focus of the projects will be computational biology in the following areas.</p>

<p>S. No. Area of Research Principal investigator</p>

<p>1. Computational Cancer Biology Dr. Anshuman Dixit</p>

<p>2. Immunogenomics &amp; Systems Biology Dr. Sunil Kumar Raghav</p>

<p>3. Chromatin remodeling and hematopoiesis Dr. Punit Prasad</p>

<p>Candidates are strongly encouraged to visit ILS webpage for detailed information, regarding the research activities of the above mentioned scientists.</p>

<p>Essential Qualifications:</p>

<p>(a) Eligibility: M.Sc., M.V.Sc., M.Pharm., M.S. Pharma. (with NET/GATE/GPAT/BINC/any other equivalent national level exam) or M.Tech with minimum of 60% marks (or equivalent grade point). Those awaiting final result may also apply.</p>

<p>Applications received after the last date will not be accepted. The envelope should clearly be superscribed with “Application for Ph.D. program (computational biology)”. Short-listed candidates selected for the interview will be published in the Institute website (www.ils.res.in).</p>

<p>Application Fees: Applicants except SC/ST candidates are required to send a non-refundable D.D. for Rs.100/- in favour of “Director, Institute of Life Sciences, Bhubaneswar” payable at Bhubaneswar along with duly filled-in application form by the date mentioned below. Director, ILS reserves the right to withdraw the procedure without assigning any reasons thereof.</p>

<p>Important dates: </p>

<p>Last date of receiving applications: 24th June 2016 </p>

<p>Date of display of short-listed candidates and instructions on the Institute website: 30th June 2016 </p>

<p>Date of interview: The interview will be organized on 25th July 2016</p>

<p>Advertisement: https://www.ils.res.in/wp-content/uploads/2016/05/advt07-16.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26852/awesome-bioinformatics-pipelines</guid>
	<pubDate>Wed, 30 Mar 2016 21:50:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26852/awesome-bioinformatics-pipelines</link>
	<title><![CDATA[Awesome bioinformatics pipelines !]]></title>
	<description><![CDATA[<p><span>A curated list of awesome pipeline toolkits ...</span></p>
<p><span>https://github.com/pditommaso/awesome-pipeline</span></p><p>Address of the bookmark: <a href="https://github.com/pditommaso/awesome-pipeline" rel="nofollow">https://github.com/pditommaso/awesome-pipeline</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26906/paired-end-assembler-for-dna-sequences</guid>
	<pubDate>Wed, 06 Apr 2016 05:25:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26906/paired-end-assembler-for-dna-sequences</link>
	<title><![CDATA[PAired-eND Assembler for DNA sequences]]></title>
	<description><![CDATA[<p>PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.</p>
<p>&nbsp;</p>
<p>More at https://github.com/neufeld/pandaseq</p><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</guid>
	<pubDate>Wed, 06 Apr 2016 13:27:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</link>
	<title><![CDATA[PEAR: a fast and accurate Illumina Paired-End reAd mergeR]]></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>More at&nbsp;http://www.exelixis-lab.org/web/software/pear</p>
<p>Paper:&nbsp;http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3933873/</p><p>Address of the bookmark: <a href="http://www.exelixis-lab.org/web/software/pear" rel="nofollow">http://www.exelixis-lab.org/web/software/pear</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26968/scalce</guid>
	<pubDate>Fri, 15 Apr 2016 05:09:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26968/scalce</link>
	<title><![CDATA[SCALCE]]></title>
	<description><![CDATA[<p><span>SCALCE (</span><code>/skeɪlz/</code><span>, a.k.a. boosting&nbsp;</span><span style="text-decoration: underline;">S</span><span>equence&nbsp;</span><span style="text-decoration: underline;">C</span><span>ompression&nbsp;</span><span style="text-decoration: underline;">A</span><span>lgorithms using&nbsp;</span><span style="text-decoration: underline;">L</span><span>ocally&nbsp;</span><span style="text-decoration: underline;">C</span><span>onsistent</span><span style="text-decoration: underline;">E</span><span>ncoding) is a tool for compressing FASTQ files. It is designed specifically for the Illumina-generated FASTQ files, but supports any valid FASTQ with consistent read lengths.&nbsp;</span></p>
<p><span>More at&nbsp;http://sfu-compbio.github.io/scalce/</span></p><p>Address of the bookmark: <a href="http://sfu-compbio.github.io/scalce/" rel="nofollow">http://sfu-compbio.github.io/scalce/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27035/spades</guid>
	<pubDate>Tue, 19 Apr 2016 08:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27035/spades</link>
	<title><![CDATA[SPAdes]]></title>
	<description><![CDATA[<p>SPAdes &ndash; St. Petersburg genome assembler &ndash; is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8, 2016 and can be downloaded from <a href="http://bioinf.spbau.ru/en/spades" target="_blank">http://bioinf.spbau.ru/en/spades</a>.</p>
<p>Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/spades" rel="nofollow">http://bioinf.spbau.ru/spades</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</guid>
	<pubDate>Tue, 10 May 2016 07:46:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</link>
	<title><![CDATA[BUSCO: Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs]]></title>
	<description><![CDATA[<ul>
<li><span>High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures like N50.&nbsp;</span></li>
<li></li>
<li><span>BUSCO provides measures for quantitative assessment of genome assembly, gene set, and transcriptome completeness based on evolutionarily informed expectations of gene content from near-universal single-copy orthologs selected from&nbsp;</span><a href="http://orthodb.org/">OrthoDB</a><span>.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments are implemented in open-source software, with comprehensive lineage-specific sets of Benchmarking Universal Single-Copy Orthologs for arthropods, vertebrates, metazoans, fungi, eukaryotes, and bacteria.&nbsp;</span></li>
<li></li>
<li><span>These conserved orthologs are ideal candidates for large-scale phylogenomics studies, and the annotated BUSCO gene models built during genome assessments provide a comprehensive gene predictor training set for use as part of genome annotation pipelines.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments offer intuitive metrics, based on evolutionarily informed expectations of gene content from hundreds of species, to gauge completeness of rapidly accumulating genomic data and satisfy an Iberian's quest for quality - "Busco calidad/qualidade".</span></li>
</ul><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</guid>
	<pubDate>Tue, 03 May 2016 05:31:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27225/painless-package-development-for-r</link>
	<title><![CDATA[Painless package development for R]]></title>
	<description><![CDATA[<p>Devtools makes package development a breeze: it works with R&rsquo;s existing conventions for code structure, adding efficient tools to support the cycle of package development. With devtools, developing a package becomes so easy that it will be your default layout whenever you&rsquo;re writing a significant amount of code.</p>
<p>Before you get started be sure to check out:</p>
<ul>
<li><a href="https://groups.google.com/forum/#%21forum/rdevtools" title="Google devtools Group">devtools Google Group &ndash;&nbsp;https://groups.google.com/forum/#!forum/rdevtools</a></li>
<li><a href="http://adv-r.had.co.nz/" title="Hadley W Online Book">book on &ldquo;Advanced R programming&rdquo; &ndash;&nbsp;http://adv-r.had.co.nz/</a></li>
<li><a href="https://github.com/hadley/devtools" title="devtools GitHub">GitHub repository &ndash;&nbsp;https://github.com/hadley/devtools</a></li>
</ul>
<h3 id="getting_started">&nbsp;</h3><p>Address of the bookmark: <a href="https://www.rstudio.com/products/rpackages/devtools/" rel="nofollow">https://www.rstudio.com/products/rpackages/devtools/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>