<?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/44516?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/44516?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/27080/mrfast-micro-read-fast-alignment-search-tool</guid>
	<pubDate>Tue, 26 Apr 2016 03:50:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27080/mrfast-micro-read-fast-alignment-search-tool</link>
	<title><![CDATA[mrFAST:  Micro Read Fast Alignment Search Tool]]></title>
	<description><![CDATA[<p><span>mrFAST is a read mapper that is designed to map short reads to reference genome with a special emphasis on the discovery of structural variation and segmental duplications. mrFAST maps short reads with respect to user defined error threshold, including indels up to 4+4 bp. This manual, describes how to choose the parameters and tune mrFAST with respect to the library settings. mrFAST is designed to find&nbsp;</span><strong><span style="text-decoration: underline;">'all'</span></strong><span>&nbsp; mappings for a given set of reads, however it can return one "best" map location if the relevant parameter is invoked.</span></p>
<p><span>More at&nbsp;http://mrfast.sourceforge.net/manual.html</span></p><p>Address of the bookmark: <a href="http://mrfast.sourceforge.net/manual.html" rel="nofollow">http://mrfast.sourceforge.net/manual.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27211/srbioinformatics-analyst-ngs-ocimumbio</guid>
  <pubDate>Mon, 02 May 2016 04:41:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Sr.Bioinformatics Analyst (NGS) @ OcimumBio]]></title>
  <description><![CDATA[
<p>Sr.Bioinformatics Analyst (NGS)</p>

<p>Experience Required: 3-5 years of experience<br />No of Positions : Multiple<br />Qualifications: Candidates with minimum qualification as M.Sc Bioinformatics with 3-5  years of experience in Life sciences R&amp;D or Pharma Industry.<br />Ph.D candidates with research experience in Bioinformatics with publications in International journal and minimum 2 years of  industry experience in clinical genomics will be preferred for this position.</p>

<p>Requirement:</p>

<p>1.  Must have basic understanding of molecular biology and Genomics.<br />2. Experience in application development or must have expertise in programming using either of Perl/Python.<br />3.  Experience in statistical programming using R/Bioconductor/Matlab.<br />4. Strong concept in statistical and mathematical modelling.<br />5.  Experience in designing and developing the bioinformatics pipeline.<br />6.  Must have minimum 2+ years of hands on experience in NSG data analysis such as RNA-Seq,Exome-Seq ,Chip-Seq and downstream analysis.<br />7. Knowledge in WGS ,WES, Targeted re-sequencing,GWAS and population genomics will be preferred.<br />8. Must have experience working on opensource software/Framework and commercial software for NGS data analysis and reporting.<br />9. Should be aware of handling big data and guiding team members on multiple projects simultaneously.<br />More at http://www.ocimumbio.com/careers1/<br />10. Should have experience coordinating with different groups of clinical research scientist for various project requirements.<br />11. Ability to work as team as well as independently with minimal support.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27240/bioinformatics-tutor-at-pgimer</guid>
  <pubDate>Wed, 04 May 2016 08:40:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Tutor at PGIMER]]></title>
  <description><![CDATA[
<p>Postgraduate Institute of Medical Education and Research (PGIMER) - Chandigarh, Chandigarh<br />₹9,300 - ₹34,800 a month<br />Postgraduate Institute of Medical Education and Research (PGIMER), Chandigarh invites Online Applications for recruitment of following Group 'A', 'B' and 'C' posts. The closing date for submission of online applications is up to 12th May 2016.</p>

<p>No of Vacancies: 01<br />Pay Scale: Rs. 9300-34800 + Grade Pay Rs. 4600/-</p>

<p>Educational Qualification and Experience: (From Recognized University / Institute) M.Sc. in Biotechnology, Molecular Biology, Human Genomics / Biochemistry / Biophysics.</p>

<p>Age Limit: 18-50 years</p>

<p>Please see Detailed Advertisement Link for full info: https://drive.google.com/file/d/0Bz3xO6e_7OeeZllINnRyWlN5UFE/view</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27291/summer-internship-positions-at-dupont</guid>
  <pubDate>Wed, 11 May 2016 08:05:54 -0500</pubDate>
  <link></link>
  <title><![CDATA[Summer internship positions at DuPont]]></title>
  <description><![CDATA[
<p>DuPont Industrial Biosciences has several summer internship positions<br />for undergrads available. We are looking for driven and creative interns<br />to conduct research in the following areas:</p>

<p>· Enzyme immobilization supports for select enzyme systems.</p>

<p>· New tools for microbial strain and genome engineering using<br />state-of-the-art methodologies.</p>

<p>· Rapid high throughput assays to screen microorganisms from various<br />sources for enzymatic activities of interest.</p>

<p>· High throughput combinatorial approaches to the formulation of growth<br />media in support of microbial enrichments, strain isolations and growth<br />optimization.</p>

<p>· Meta-transcriptomics for the discovery of new enzymes.</p>

<p>· Strain adaptation techniques in defined chemostat environments for<br />microbial strain development.</p>

<p>The internships are based at the Experimental Station R&amp;D Center in<br />Wilmington, DE.</p>

<p>If interested, apply fast!</p>

<p>For more information and to apply, go to:</p>

<p>http://careers.dupont.com/jobsearch/job-details/industrial-biosciences-summer-internship/008549W-10/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27321/slurm-basics</guid>
	<pubDate>Fri, 13 May 2016 04:42:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27321/slurm-basics</link>
	<title><![CDATA[SLURM basics !]]></title>
	<description><![CDATA[<p><a href="http://bioinformaticsonline.com/bookmarks/view/27238/slurm" target="_blank">SLURM</a> is a queue management system and stands for Simple Linux Utility for Resource Management. SLURM was developed at the Lawrence Livermore National Lab and currently runs some of the largest compute clusters in the world.</p><p>SLURM is similar in many ways to most other queue systems. You write a batch script then submit it to the queue manager. The queue manager then schedules your job to run on the queue (or partition in SLURM parlance) that you designate. Below we will provide an outline of how to submit jobs to SLURM, how SLURM decides when to schedule your job and how to monitor progress.</p><p>SLURM has a number of valuable features compared to other job management systems:</p><ul>
<li><em>Kill and Requeue</em> SLURM&rsquo;s ability to kill and requeue is superior to that of other systems. It waits for jobs to be cleared before scheduling the high priority job. It also does kill and requeue on memory rather than just on core count.</li>
<li><em>Memory</em> Memory requests are sacrosanct in SLURM. Thus the amount of memory you request at run time is guaranteed to be there. No one can infringe on that memory space and you cannot exceed the amount of memory that you request.</li>
<li><em>Accounting Tools</em> SLURM has a back end database which stores historical information about the cluster. This information can be queried by the users who are curious about how much resources they have used.</li>
</ul><p><strong>Summary of SLURM commands</strong></p><p>The table below shows a summary of SLURM commands. These commands are described in more detail below along with links to the SLURM doc site.</p><table>
<tbody>
<tr><th>&nbsp;</th><th>SLURM</th><th>SLURM Example</th></tr>
<tr>
<td>Submit a batch serial job</td>
<td><a href="http://slurm.schedmd.com/sbatch.html">sbatch</a></td>
<td><code>sbatch runscript.sh</code></td>
</tr>
<tr>
<td>Run a script interatively</td>
<td><a href="http://slurm.schedmd.com/srun.html">srun</a></td>
<td><code>srun --pty -p interact -t 10 --mem 1000 /bin/bash /bin/hostname</code></td>
</tr>
<tr>
<td>Kill a job</td>
<td><a href="http://slurm.schedmd.com/scancel.html">scancel</a></td>
<td><code>scancel 999999</code></td>
</tr>
<tr>
<td>View status of queues</td>
<td><a href="http://slurm.schedmd.com/squeue.html">squeue</a></td>
<td><code>squeue -u akitzmiller</code></td>
</tr>
<tr>
<td>Check current job by id</td>
<td><a href="http://slurm.schedmd.com/squeue.html">sacct</a></td>
<td><code>sacct -j 999999</code></td>
</tr>
</tbody>
</table>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

</channel>
</rss>