<?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/28449?offset=1090</link>
	<atom:link href="https://bioinformaticsonline.com/related/28449?offset=1090" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26539/scikit-learn</guid>
	<pubDate>Mon, 29 Feb 2016 17:39:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26539/scikit-learn</link>
	<title><![CDATA[scikit-learn]]></title>
	<description><![CDATA[<p>Machine Learning in Python</p>
<p>Simple and efficient tools for data mining and data analysis<br> Accessible to everybody, and reusable in various contexts<br> Built on NumPy, SciPy, and matplotlib<br> Open source, commercially usable - BSD license</p>
<p>More at&nbsp;http://scikit-learn.org/stable/index.html</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://scikit-learn.org/stable/auto_examples/index.html" rel="nofollow">http://scikit-learn.org/stable/auto_examples/index.html</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</guid>
	<pubDate>Wed, 23 Mar 2016 05:53:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</link>
	<title><![CDATA[RNA-Seq De novo Assembly Using Trinity]]></title>
	<description><![CDATA[<p>Trinity, developed at the <a href="http://www.broadinstitute.org">Broad Institute</a> and the <a href="http://www.cs.huji.ac.il">Hebrew University of Jerusalem</a>, represents a novel method for the efficient and robust de novo reconstruction of transcriptomes from RNA-seq data. Trinity combines three independent software modules: Inchworm, Chrysalis, and Butterfly, applied sequentially to process large volumes of RNA-seq reads. Trinity partitions the sequence data into many individual de Bruijn graphs, each representing the transcriptional complexity at at a given gene or locus, and then processes each graph independently to extract full-length splicing isoforms and to tease apart transcripts derived from paralogous genes. Briefly, the process works like so:</p>
<ul>
<li>
<p><em>Inchworm</em> assembles the RNA-seq data into the unique sequences of transcripts, often generating full-length transcripts for a dominant isoform, but then reports just the unique portions of alternatively spliced transcripts.</p>
</li>
<li>
<p><em>Chrysalis</em> clusters the Inchworm contigs into clusters and constructs complete de Bruijn graphs for each cluster. Each cluster represents the full transcriptonal complexity for a given gene (or sets of genes that share sequences in common). Chrysalis then partitions the full read set among these disjoint graphs.</p>
</li>
<li>
<p><em>Butterfly</em> then processes the individual graphs in parallel, tracing the paths that reads and pairs of reads take within the graph, ultimately reporting full-length transcripts for alternatively spliced isoforms, and teasing apart transcripts that corresponds to paralogous genes.</p>
</li>
</ul>
<p>More at https://github.com/trinityrnaseq/trinityrnaseq/wiki</p>
<p>......................................................................................................................................</p>
<p>Download Trinity <a href="https://github.com/trinityrnaseq/trinityrnaseq/releases">here</a>.</p>
<p>Build Trinity by typing 'make' in the base installation directory.</p>
<p>Assemble RNA-Seq data like so:</p>
<pre><code> Trinity --seqType fq --left reads_1.fq --right reads_2.fq --CPU 6 --max_memory 20G 
</code></pre>
<p>Find assembled transcripts as: 'trinity_out_dir/Trinity.fasta'</p><p>Address of the bookmark: <a href="https://github.com/trinityrnaseq/trinityrnaseq/wiki" rel="nofollow">https://github.com/trinityrnaseq/trinityrnaseq/wiki</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26927/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 06 Apr 2016 19:06:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26927/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>More at&nbsp;http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26999/discovar</guid>
	<pubDate>Mon, 18 Apr 2016 11:59:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26999/discovar</link>
	<title><![CDATA[DISCOVAR]]></title>
	<description><![CDATA[<p><strong>DISCOVAR</strong> is a new variant caller and <strong>DISCOVAR <em>de novo</em></strong> a new genome assembler, both designed for state-of-the-art data. Their inputs are chosen to optimize quality while keeping costs low. Currently it takes as input Illumina reads of length 250 or longer &mdash; produced on MiSeq or HiSeq 2500 &mdash; and from a single PCR-free library. These data enable a level of completeness and continuity that was not previously possible.</p>
<p><strong>DISCOVAR</strong> can call variants on a region by region basis, potentially tiling an entire large genome. DISCOVAR variant calling is under active development and transitioning to VCF.</p>
<p><strong>DISCOVAR <em>de novo</em></strong> can generate <em>de novo</em> assemblies for both large and small genomes. It currently does not call variants.</p>
<p>More at https://www.broadinstitute.org/software/discovar/blog/?page_id=14</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/discovar/blog/" rel="nofollow">https://www.broadinstitute.org/software/discovar/blog/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</guid>
	<pubDate>Tue, 26 Apr 2016 12:18:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</link>
	<title><![CDATA[Smash: An alignment-free method to find and visualise rearrangements between pairs of DNA sequences]]></title>
	<description><![CDATA[<p><strong>Smash is a completely alignment-free method/tool to find and visualise genomic rearrangements</strong><span>. The detection is based on&nbsp;</span><strong>conditional exclusive compression</strong><span>, namely using a FCM (Markov model), of high context order (typically 20). For visualisation, Smash outputs a&nbsp;</span><strong>SVG image</strong><span>, with an&nbsp;</span><strong>ideogram</strong><span>output architecture, where the patterns are represented with several&nbsp;</span><strong>HSV values</strong><span>&nbsp;(only value varies). The method can perform both in small- and large-scale. Nevertheless is more directed to large-scale since that the main aim of the research is to&nbsp;</span><strong>know where the large-scale [chromosomal by chromosome] of several primates was equal/different, having at a glance a map of the entire genomes</strong><span>.</span></p><p>Address of the bookmark: <a href="http://bioinformatics.ua.pt/software/smash/" rel="nofollow">http://bioinformatics.ua.pt/software/smash/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</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>

<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>