<?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/26559?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/26559?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</guid>
	<pubDate>Wed, 27 Dec 2017 20:47:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</link>
	<title><![CDATA[Bioinformatics tools developed for Oxford Nanopore data analysis !]]></title>
	<description><![CDATA[<p><span>MinION is the only portable real-time device for DNA and RNA&nbsp;</span><span>sequencing</span><span>. Each consumable flow cell can now generate 10&ndash;20 Gb of DNA&nbsp;</span><span>sequence</span><span>&nbsp;data. Ultra-</span><span>long read lengths are possible (hundreds of kb) as you can choose your fragment length.&nbsp;</span>One of the technical advantages of ONT data is the read length, which offers great prospects for genome assembly. Generally, assemblers are based on several different types of algorithms, such as greedy, overlap-layout-consensus (OLC), de Bruijn graph (DBG), and string graph.</p><p><span>List of analysis tools developed for Oxford Nanopore data</span></p><p>BWA <br />Fast nanopore data tuned alignment tool <br />https://github.com/lh3/bwa</p><p>GraphMap<br />Mapper for long and error-prone reads<br />https://github.com/isovic/graphmap</p><p>LAST<br />Nanopore tuned alignment tool<br />http://last.cbrc.jp/</p><p>LINKS<br />Software tool for long read scaffolding <br />https://github.com/warrenlr/LINKS/</p><p>marginAlign<br />Tools to align nanopore reads to a reference<br />https://github.com/benedictpaten/marginAlign</p><p>minoTour<br />Real time analysis tools<br />http://minotour.nottingham.ac.uk/</p><p>nanoCORR<br />Error-correction tool for nanopore sequence data<br />https://github.com/jgurtowski/nanocorr</p><p>NanoOK<br />Software for nanopore data, quality and error profiles<br />https://documentation.tgac.ac.uk/display/NANOOK/NanoOK</p><p>Nanopolish<br />Nanopore analysis and genome assembly software<br />https://github.com/jts/nanopolish</p><p>nanopore<br />Variant-detection tool for nanopore sequence data<br />https://github.com/mitenjain/nanopore</p><p>Nanocorrect<br />Error-correction tool for nanopore sequence data<br />https://github.com/jts/nanocorrect/</p><p>npReader<br />Real-time conversion and analysis of nanopore reads<br />https://github.com/mdcao/npReader</p><p>poRe<br />Tool for analyzing and visualizing nanopore data<br />https://sourceforge.net/p/rpore/wiki/Home/</p><p>PoreSeq<br />Error-correction and variant-calling software<br />https://github.com/tszalay/poreseq</p><p>Poretools<br />Nanopore sequence analysis and visualization software <br />https://github.com/arq5x/poretools</p><p>SSPACE-LongRead<br />Genome scaffolding tool <br />http://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE-longread</p><p>SMIS<br />Genome scaffolding tool <br />https://sourceforge.net/projects/phusion2/files/smis/</p><p>&nbsp;</p><p>List of assemblers for Oxford Nanopore MinION long reads</p><p>LQS<br />DALIGNER, Celera OLC Nanocorrect, <br />Nanopolish corrector<br />https://github.com/jts/nanopolish</p><p>PBcR<br />HGAP or BLASR, Celera OLC <br />PBcR corrector<br />http://wgs-assembler.sourceforge.net/wiki/index.php/PBcR<br /> &ndash;<br />Canu<br />MHAP, Celera OLC <br />Canu corrector<br />https://github.com/marbl/canu</p><p>Falcon<br />String graph, Celera OLC <br />Falcon corrector<br />https://github.com/PacificBiosciences/falcon</p><p>Miniasm <br />OLC<br />https://github.com/lh3/miniasm</p><p>ra-integrate<br />OLC<br />https://github.com/mariokostelac/ra-integrate/</p><p>ALLPATHS-LG<br />de Bruijn graph <br />ALLPATHS-L corrector<br />https://www.broadinstitute.org/software/allpaths-lg/blog/?page_id=12</p><p>SPAdes <br />de Bruijn graph <br />SPAdes corrector<br />http://bioinf.spbau.ru/spades</p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/2021</guid>
	<pubDate>Mon, 12 Aug 2013 09:27:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2021</link>
	<title><![CDATA[What are the difference between BioRuby and BioGem?]]></title>
	<description><![CDATA[<p>I came across two diferent but matching term BioRuby and BioGem. What are the difference between these two term? If both are using same Ruby language for development then why did they develope two different biological packages.</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/35552/the-brent-lab</guid>
  <pubDate>Fri, 09 Feb 2018 10:55:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[The Brent Lab]]></title>
  <description><![CDATA[
<p>The Brent Lab is developing and applying computational methods for mapping gene regulation networks, modeling them quantitatively, and engineering new behaviors into them.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4090/computational-biology-in-the-21st-century-making-sense-out-of-massive-data</guid>
	<pubDate>Thu, 29 Aug 2013 08:32:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4090/computational-biology-in-the-21st-century-making-sense-out-of-massive-data</link>
	<title><![CDATA[Computational Biology in the 21st Century: Making Sense out of Massive Data]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/I99UiA_vaJQ" frameborder="0" allowfullscreen></iframe>Computational Biology in the 21st Century: Making Sense out of Massive Data    
    
Air date:  Wednesday, February 01, 2012, 3:00:00 PM
Category:  Wednesday Afternoon Lectures  
 
Description:  The last two decades have seen an exponential increase in genomic and biomedical data, which will soon outstrip advances in computing power to perform current methods of analysis. Extracting new science from these massive datasets will require not only faster computers; it will require smarter algorithms. We show how ideas from cutting-edge algorithms, including spectral graph theory and modern data structures, can be used to attack challenges in sequencing, medical genomics and biological networks. 

The NIH Wednesday Afternoon Lecture Series includes weekly scientific talks by some of the top researchers in the biomedical sciences worldwide. 

Author:  Dr. Bonnie Berger  
Runtime:  00:58:06  
Permanent link:  http://videocast.nih.gov/launch.asp?17563]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36197/bioinformatics-oneliner</guid>
	<pubDate>Tue, 10 Apr 2018 04:13:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36197/bioinformatics-oneliner</link>
	<title><![CDATA[Bioinformatics OneLiner]]></title>
	<description><![CDATA[<p>To remove all line ends (\n) from a Unix text file:</p><pre>sed ':a;N;$!ba;s/\n//g' filename.txt &gt; newfilename_oneline.txt</pre><p>To get average for a column of numbers (here the second column $2):</p><pre>awk '{ sum += $2; n++ } END { if (n &gt; 0) print sum / n; }'</pre><p>To get sequence length for all sequences in a fasta file:</p><pre>awk '/^&gt;/ {if (seqlen){print seqlen}; print ;seqlen=0;next; } { seqlen = seqlen +length($0)}END{print seqlen}' \<br />filename.fasta</pre><p>To copy (move, rename, etc) files based on their list in a text file:</p><pre>cat file_list.txt | while read line; do cp "$line" complete_dataset/"$line"; done</pre><p>To split bam files into sets with mapped and unmapped reads:</p><pre>samtools view -F4 sample.bam &gt; sample.mapped.sam<br />samtools view -f4 sample.bam &gt; sample.unmapped.sam</pre><p>To gzip all your fastq files using gnu parallel and gzip:</p><pre>parallel gzip ::: *.fastq</pre><p>To gzip all your fastq files using pigz:</p><pre>pigz *.fastq</pre><p>To count all sequences in a fasta file:</p><pre>grep "^&gt;" yourfile.fasta -c</pre><p>To count all sequences in all fasta files in your current directory:</p><pre>for a in *.fasta; do ls $a; grep "^&gt;" -c $a; done</pre><p>To keep only one copy of duplicated lines:</p><pre>awk '!seen[$0]++'</pre><p>To sum assembly size from SPAdes contigs.fasta or scaffolds.fasta file:</p><pre>grep "^&gt;" scaffolds.fasta | cut -f 4 -d '_' | paste -sd+ | bc</pre><p>To remove everything after the first space at each line, e.g. to to simplify fasta headers:</p><pre>cut -d' ' -f1 &lt; your_file</pre><p>To count reads in a all .fastq.gz files in your current folder (fast, using gnu parallel):</p><pre>parallel "echo {} &amp;&amp; gunzip -c {} | wc -l | awk '{d=\$1; print d/4;}'" ::: *.gz</pre><p>To count reads in a all .fastq.gz files in your current folder:</p><pre>zcat *.gz | echo $((`wc -l`/4))</pre><p>To count reads in a all .fastq files in your current folder:</p><pre>cat *.fastq | echo $((`wc -l`/4))</pre><p>To count base pairs in a all .fastq.gz files in your current folder:</p><pre>zcat *.fastq.gz | paste - - - - | cut -f 2 | tr -d '\n' | wc -c </pre><p>To split multifasta file into many fasta files:</p><pre>awk '/^&gt;/ {OUT=substr($0,2) ".fa"}; {print &gt;&gt; OUT; close(OUT)}' Input_File</pre><p>To convert Illumina FASTQ 1.3 to 1.8:</p><pre>sed -e '4~4y/@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghi/!"#$%&amp;'\''()*+,-.\/0123456789:;&lt;=&gt;?@ABCDEFGHIJ/' f.fastq</pre><p>To convert FASTQ to FASTA:</p><pre>sed -n '1~4s/^@/&gt;/p;2~4p' </pre><p>To get fastq read length distribution:</p><pre>cat reads.fastq | awk '{if(NR%4==2) print length($1)}' | sort | uniq -c</pre><p>To deinterleave interleaved fastq file:</p><pre>cat myf.fq | paste - - - - - - - - | tee &gt;(cut -f 1-4 | tr "\t" "\n" &gt; myfile_1.fq) | cut -f 5-8 | \<br />tr "\t" "\n" &gt; myf2.fq </pre><p>To filter and sort contig identifiers from SPAdes assembly (e.g. here lenght &gt;= 4000 + coverage &gt;=100):</p><pre>grep "^&gt;" scaffolds.fasta | sed s"/_/ /"g | awk '{ if ($4 &gt;= 4000 &amp;&amp; $6 &gt;= 100) print $0 }' | sort -k 4 -n | \<br />sed s"/ /_/"g</pre><p>To append something to all headers of your fasta files:</p><pre>sed 's/&gt;.*/&amp;YOURSTRING/' filename.fasta &gt; new_filename.fasta</pre><p>To replace/squeeze multiple adjacent spaces by only one space:&nbsp;</p><pre>tr -s " " &lt; file</pre><p>To filter fastq based on length (here larger than or equal to 21, but smaller than or equal to 25.</p><pre>cat your.fastq | paste - - - - | awk 'length($2)&nbsp; &gt;= 21 &amp;&amp; length($2) &lt;= 25' | sed 's/\t/\n/g' &gt; filtered.fastq</pre><p>To print difference between the last and first row in 5th column:</p><pre>awk '{if (!first){first=$5;}; last=$5;} END {print last-first}' myfile.txt</pre><p>To sample only 200 first bases from all sequences in a multifasta file (e.g. from assembly scaffolds.fasta file here):</p><pre>awk '/^&gt;/{ seqlen=0; print; next; } seqlen &lt; 200 { if (seqlen + length($0) &gt; 200) $0 = substr($0, 1, 200-seqlen);\<br /> seqlen += length($0); print }' scaffolds.fasta &gt; 200bp_scaffolds.fasta</pre><p>&nbsp;To pipe a compressed fasta file directly into makeblastdb.</p><pre>gunzip -c fasta.gz | makeblastdb -in -</pre><p>To remove sequences with duplicate fasta headers from a fasta file.</p><pre>awk '/^&gt;/{f=!d[$1];d[$1]=1}f' in.fasta &gt; out.fasta</pre>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2334/binc-bioinformatics-national-certification-website-address</guid>
	<pubDate>Wed, 14 Aug 2013 09:40:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2334/binc-bioinformatics-national-certification-website-address</link>
	<title><![CDATA[BINC (BioInformatics National Certification) Website address]]></title>
	<description><![CDATA[<p><span>BINC (BioInformatics National Certification) is an initiative of Department of Biotechnology(DBT), Government Of India in coordination with Bioinformatics Center, University of Pune. The objective of the examination is to recognize trained manpower in the area of Bioinformatics. Currently, various Indian universities, Government and private institutions are involved in imparting courses in Bioinformatics in India.</span></p>
<p>Foreign nationals intending to have certification are eligible to appear for BINC examination.<br>Minimum qualification includes a degree from a recognized university/institute in the areas listed in FAQ.<br>Formal training in the area of Bioinformatics is not a prerequisite.<br>Note that the foreign students will only be certified by DBT and are not eligible for the cash award as well as junior research fellowship.</p><p>Address of the bookmark: <a href="http://binc.scisjnu.ernet.in/" rel="nofollow">http://binc.scisjnu.ernet.in/</a></p>]]></description>
	<dc:creator>Kamalakshi Mukherjee</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</guid>
	<pubDate>Wed, 25 Apr 2018 04:35:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</link>
	<title><![CDATA[Binding Site Prediction in Protein !]]></title>
	<description><![CDATA[<p><span>The interaction between proteins and other molecules is fundamental to all biological functions. In this section we include tools that can assist in prediction of interaction sites on protein surface and tools for predicting the structure of the intermolecular complex formed between two or more molecules (docking).</span></p><h4>Pockets Identification</h4><p><a href="http://sts.bioengr.uic.edu/castp/" target="_blank">CASTp</a></p><div style="text-align: justify;">Automatic Identification of pockets and cavities in proteins structure, and quantitation of their volumes using Delaunay triangulation. Available also as PyMOL plugin</div><p><a href="http://www.bioinformatics.leeds.ac.uk/pocketfinder/" target="_blank">Pocket-Finder</a></p><div style="text-align: justify;">Automatic identification of pockets and cavities in proteins structure, and quantitation of their volumes.</div><p><a href="http://gecco.org.chemie.uni-frankfurt.de/pocketpicker/index.html" target="_blank">PocketPicker</a></p><div style="text-align: justify;">Grid-based technique for the analysis of protein pockets. PocketPicker available as a plugin for&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/pymol.htm">PyMOL</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><h4>Binding Site Prediction</h4>
<p><a href="http://consurf.tau.ac.il/" target="_blank">ConSurf</a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification of functional regions in proteins by surface-mapping of phylogenetic information</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www-cryst.bioc.cam.ac.uk/~crescendo/crescendo.php" target="_blank">CRESCENDO</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification protein interaction sites. It uses sequence conservation patterns in homologous proteins to distinguish between residues that are conserved due to structural restraints from those due to functional restraints.&nbsp;&nbsp;</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><strong>Ligand Binding Sites</strong></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www.sbg.bio.ic.ac.uk/~3dligandsite/" target="_blank">3DLigandSite</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">The server utilizes protein-structure prediction to provide structural models of the binding site. Ligands bound to structures are superimposed onto the model and use to predict the binding site.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">F<a href="http://cssb.biology.gatech.edu/skolnick/files/FINDSITE/" target="_blank">INDSITE</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">A threading-based method for ligand-binding site prediction and functional annotation based on binding-site similarity across superimposed groups of threading templates.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">
<p><a href="http://scoppi.biotec.tu-dresden.de/pocket/" target="_blank">LIGSITE<sup>csc</sup></a></p>
<div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Prediction of binding site by pocket identification using the Connolly surface and degree of conservation</div>
<p><a href="http://metapocket.eml.org/" target="_blank"></a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://metapocket.eml.org/" target="_blank">metaPocket</a>A meta server for ligand-binding site prediction. metaPocket use&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#ligsite">LIGSITE<sup>csc</sup></a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pass">PASS</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#qsite">Q-SiteFinder</a>&nbsp;and&nbsp;<a href="http://www.biochem.ucl.ac.uk/~roman/surfnet/surfnet.html" target="_blank">SURFNET</a></div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/7674/useful-publications-and-websites-for-deep-sequencing-data-analysis</guid>
	<pubDate>Sun, 29 Dec 2013 22:30:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/7674/useful-publications-and-websites-for-deep-sequencing-data-analysis</link>
	<title><![CDATA[Useful Publications and Websites for Deep Sequencing Data Analysis]]></title>
	<description><![CDATA[<h3>Global overview papers</h3><p>Next generation quantitative genetics in plants. Jim&eacute;nez-G&oacute;mez, Frontiers in Plant Science 2:77, 2011 <span style="text-decoration: underline;"><a href="http://www.frontiersin.org/Plant_Physiology/10.3389/fpls.2011.00077/full">Full Text</a> </span><em>[equally relevant to animal and microbial systems]</em></p><p>Sense from sequence reads: methods for alignment and assembly. Flicek &amp; Birney, Nat Methods 6(11 Suppl):S6-S12, 2009. <a href="http://www.nature.com/nmeth/journal/v6/n11s/full/nmeth.1376.html"><span style="text-decoration: underline;">Full Text</span></a></p><h3>Library construction and experimental design</h3><p>Statistical design and analysis of RNA sequencing data. Auer &amp; Doerge, Genetics 185(2):405-16, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881125"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Biases in Illumina transcriptome sequencing caused by random hexamer priming. Hansen et al., Nucleic Acids Res. 38(12): e131, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2896536"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Analyzing and minimizing PCR amplification bias in Illumina sequencing libraries. Aird et al, Genome Biology 12:R18, 2011 <a href="http://genomebiology.com/2011/12/2/R18"><span style="text-decoration: underline;">Full Text</span></a></p><p>Amplification-free Illumina sequencing-library preparation facilitates improved mapping and assembly of GC-biased genomes. Kozarewa et al, Nature Methods 6(4):291-5, 2009 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2664327/"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Cost-effective, high-throughput DNA sequencing libraries for multiplexed target capture. Rohland &amp; Reich, Genome Research 22(5): 939&ndash;946. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3337438/"><span style="text-decoration: underline;">PubMedCentral</span></a></p><h3>Data formats, data management, and alignment software tools<span style="text-decoration: underline;"> </span></h3><p>The Sequence Alignment/Map format and SAMtools. Li et al, Bioinformatics 25(16):2078-9, 2009 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2723002"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>SAM format specification <a href="http://samtools.sourceforge.net/SAM1.pdf"><span style="text-decoration: underline;">file</span></a></p><p>Efficient storage of high throughput sequencing data using reference-based compression. Fritz et al, Genome Res 21(5):734-40, 2011. <a href="http://genome.cshlp.org/content/21/5/734.long"><span style="text-decoration: underline;">Full Text</span></a></p><p>Compression of DNA sequence reads in FASTQ format. Deorowicz &amp; Grabowski, Bioinformatics 27(6):860-2, 2011. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21252073"><span style="text-decoration: underline;">PubMed</span></a></p><p>Fast and accurate short read alignment with Burrows-Wheeler transform. Li &amp; Durbin, Bioinformatics 25(14):1754-60, 2009. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2705234"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Improving SNP discovery by base alignment quality. Li H, Bioinformatics 27(8):1157-8, 2011. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21320865"><span style="text-decoration: underline;">PubMed</span></a></p><p>BEDTools: a flexible suite of utilities for comparing genomic features. Quinlan and Hall, Bioinformatics 26:841-842, 2010. <a href="http://bioinformatics.oxfordjournals.org/content/26/6/841.full.pdf+html"><span style="text-decoration: underline;">Publisher Website</span></a></p><h3>Data quality assessment, filtering, and correction</h3><p>SolexaQA: At-a-glance quality assessment of Illumina second-generation sequencing data. Cox et al, BMC Bioinformatics 11:485, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2956736"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>TileQC: a system for tile-based quality control of Solexa data. Dolan &amp; Denver, BMC Bioinformatics 9:250, 2008 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2443380"><span style="text-decoration: underline;">PubMedCentral</span></a> <em>[requires a reference sequence]</em></p><p>Quake: quality-aware detection and correction of sequencing errors. Kelley et al, Genome Biol 11(11):R116, 2010. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21114842"> <span style="text-decoration: underline;">PubMed</span></a></p><p>FastQC: a quality control tool for high-throughput sequence data. <a href="http://www.bioinformatics.bbsrc.ac.uk/projects/fastqc/"><span style="text-decoration: underline;">Home Page</span></a></p><p>FASTX-toolkit: FASTQ/A short-reads pre-processing tools <a href="http://hannonlab.cshl.edu/fastx_toolkit/"><span style="text-decoration: underline;">Home Page</span></a></p><p>Reference-free validation of short read data. Schr&ouml;der et al, PLoS One 5(9):e12681, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2943903"> <span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Correction of sequencing errors in a mixed set of reads. Salmela, Bioinformatics 26(10):1284, 2010. <a href="http://bioinformatics.oxfordjournals.org/content/26/10/1284.long"><span style="text-decoration: underline;">Full Text</span></a> <em>[includes error correction of SOLiD reads in colorspace]</em></p><p>Repeat-aware modeling and correction of short read errors. Yang et al, BMC Bioinformatics 12(Supp1):S52, 2011 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3044310"> <span style="text-decoration: underline;">PubMedCentral</span></a> <em>[requires a reference sequence]</em></p><p>HiTEC: accurate error correction in high-throughput sequencing data. Ilie et al, Bioinformatics 27(3):295, 2011 <a href="http://bioinformatics.oxfordjournals.org/content/27/3/295.long"><span style="text-decoration: underline;">Full Text</span></a></p><p>Error correction of high-throughput sequencing datasets with non-uniform coverage. Medvedev et al., Bioinformatics 27(13):i137-41, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3117386"><span style="text-decoration: underline;">PubMedCentral</span></a></p><h3>De novo assembly<span style="text-decoration: underline;"> </span></h3><p>Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Zerbino &amp; Birney, Genome Res 18(5):821-9, 2008. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2336801">u&gt;PubMedCentral</a></p><p>Assembly of large genomes using second-generation sequencing. Schatz et al, Genome Res 20(9):1165-73, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928494"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Gnerre et al, PNAS 108(4): 1513-18, 2011 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3029755"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Genome assembly has a major impact on gene content: a comparison of annotation in two <em>Bos taurus </em> assemblies. Florea&nbsp; et al., PLoS One 6(6):e21400, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3120881/"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Artemis: an integrated platform for visualization and analysis of high-throughput sequence-based experimental data. Carver et al, Bioinformatics 28(4):464 - 469, 2012 <span style="text-decoration: underline;"><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3278759/">PubMedCentral</a></span></p><p>Efficient de novo assembly of large genomes using compressed data structures. Simpson &amp; Durbin, Genome Research 22:549-556, 2012 <span style="text-decoration: underline;"><a href="http://genome.cshlp.org/content/22/3/549.full">Full Text</a></span> <em>[Describes the String Graph Assembler (SGA), which assembled a human genome in less than 6 days using 54 Gb of RAM and a 123-processor compute cluster for calculation of an FM-index of the 1.2 billion reads]</em></p><p>Readjoiner: a fast and memory efficient string graph-based sequence assembler. Gonnella &amp; Kurtz, BMC Bioinformatics 13: 82, 2012 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3507659"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Assemblathon 1: A competitive assessment of de novo short read assembly methods. Earl et al, Genome Research 21:2224-2241, 2011 <span style="text-decoration: underline;"><a href="http://genome.cshlp.org/content/early/2011/09/16/gr.126599.111.full.pdf+html">Full Text</a></span></p><h3>Chromatin immunoprecipation analysis: ChIP-seq</h3><p>ChIP-seq: advantages and challenges of a maturing technology. Park, Nat Rev Genet. 10:669-80, 2009 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3191340/"><span style="text-decoration: underline;">PubMed</span></a></p><p>ChIP-seq and Beyond: new and improved methodologies to detect and characterize protein-DNA interactions. Furey, Nat Rev Genet 13: 840&ndash;852, 2012 <a href="http://www.nature.com/nrg/journal/v13/n12/full/nrg3306.html"> <span style="text-decoration: underline;">Publisher Web Site</span></a></p><p>MuMoD: a Bayesian approach to detect multiple modes of protein&ndash;DNA binding from genome-wide ChIP data. Narlikar, Nucleic Acids Res 41:21&ndash;32, 2013 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3592440/"><span style="text-decoration: underline;">PubMed</span></a></p><h3>Transcriptome analysis</h3><h3>Assembly and comparison to genome</h3><p>Full-length transcriptome assembly from RNA-Seq data without a reference genome. Grabherr et al, Nature Biotechnology 29:644 - 652, 2011. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21572440"><span style="text-decoration: underline;">PubMed</span></a> <em>[The software is called <a href="http://trinityrnaseq.sourceforge.net/"><span style="text-decoration: underline;">Trinity</span></a>, and is available on Sourceforge.]</em></p><p>Comprehensive analysis of RNA-Seq data reveals extensive RNA editing in a human transcriptome. Peng et al, Nature Biotechnology 30:253 - 260, 2012. <span style="text-decoration: underline;"><a href="http://www.ncbi.nlm.nih.gov/pubmed/22327324">PubMed</a></span> <em>[Several comments on this paper question whether the reported differences are in fact evidence of editing or are simply sequencing errors - the authors stand by their conclusions, but the controversy demonstrates the importance of robust data analysis methods.] </em></p><p>Optimization of de novo transcriptome assembly from next-generation sequencing data. Surget-Groba &amp; Montoya-Burgos, Genome Res 20(10):1432-40, 2010. <a href="http://genome.cshlp.org/content/20/10/1432.long"><span style="text-decoration: underline;">Full Text</span></a></p><p>Rnnotator: an automated <em>de novo</em> transcriptome assembly pipeline from stranded RNA-Seq reads. Martin et al, BMC Genomics 11:663, 2010 <a href="http://www.biomedcentral.com/1471-2164/11/663"><span style="text-decoration: underline;">Full Text</span></a></p><p><em>De novo</em> assembly and analysis of RNA-seq data. Robertson et al, Nature Methods 7:909-912, 2010 <a href="http://www.nature.com/nmeth/journal/v7/n11/full/nmeth.1517.html"><span style="text-decoration: underline;">Full Text</span></a> <em>[describes Trans-ABySS, a pipeline to use the ABySS parallel assembler for de novo transcriptome analysis]</em></p><h3>Differential expression analysis</h3><p>R-SAP: a multi-threading computational pipeline for the characterization of high-throughput RNA-sequencing data. Mittal &amp; McDonald, Nucleic Acids Res, 2012 <span style="text-decoration: underline;"><a href="http://nar.oxfordjournals.org/content/early/2012/01/28/nar.gks047.long">Full Text</a></span></p><p>Targeted RNA sequencing reveals the deep complexity of the human transcriptome. Mercer et al, Nature Biotechnology 30:99 - 104, 2012 <span style="text-decoration: underline;"><a href="http://www.nature.com/nbt/journal/v30/n1/full/nbt.2024.html"> Publisher Website</a></span></p><p>Differential gene and transcript expression analysis of RNA-Seq experiments with TopHat and Cufflinks. Trapnell et al, Nature Protocols 7:562 - 578, 2012 <span style="text-decoration: underline;"><a href="http://www.nature.com/nprot/journal/v7/n3/full/nprot.2012.016.html"> Publisher Website</a></span></p><p>Characterization and improvement of RNA-Seq precision in quantitative transcript expression profiling. Łabaj et al, Bioinformatics 27:i383 - i391, 2011 <span style="text-decoration: underline;"><a href="http://bioinformatics.oxfordjournals.org/content/27/13/i383.full.pdf+html"> Full Text</a></span></p><p>Improving RNA-Seq expression estimates by correcting for fragment bias. Roberts et al, Genome Biol 12:R22, 2011 <span style="text-decoration: underline;"><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3129672/">PubMed Central</a></span></p><p>Cloud-scale RNA-sequencing differential expression analysis with Myrna. Langmead et al, Genome Biol 11:R83, 2010 <a href="http://genomebiology.com/2010/11/8/R83"><span style="text-decoration: underline;">Full Text</span></a></p><p>From RNA-seq reads to differential expression results. Oshlack et al, Genome Biol 11(12):220, 2010 <a href="http://genomebiology.com/content/11/12/220"><span style="text-decoration: underline;">Full Text</span></a></p><p>DEGseq: an R package for identifying differentially expressed genes from RNA-seq data. Wang et al., Bioinformatics. 26(1):136-8. 2010 <a href="http://www.ncbi.nlm.nih.gov/pubmed/19855105"><span style="text-decoration: underline;"> PubMed</span></a></p><p>DEseq: Differential expression analysis for sequence count data. Anders and Huber, Genome Biology 11:R106, 2010 <a href="http://genomebiology.com/2010/11/10/R106"><span style="text-decoration: underline;">Full Text</span></a></p><p>edgeR: a Bioconductor package for differential expression analysis of digital gene expression data. Robinson et al., Bioinformatics 26(1):139-40 2010 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2796818"> <span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Two-stage Poisson model for testing RNA-seq data. Auer and Doerge, SAGMB 10(1), article 26 <a href="http://www.bepress.com/sagmb/vol10/iss1/art26/"><span style="text-decoration: underline;">Full Text</span></a></p><p>Experimental design, preprocessing, normalization and differential expression analysis of small RNA sequencing experiments. McCormick et al., Silence2(1):2, 2011 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3055805"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>RNA-Seq gene expression estimation with read mapping uncertainty. Li et al, Bioinformatics 26:493-500, 2010 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2820677">PubMedCentral</a> <em>[describes the RSEM software package]</em></p><h3>Comparing genomes and assemblies; variant detection<span style="text-decoration: underline;"> </span></h3><p>Versatile and open software for comparing large genomes. Kurtz et al, Genome Biol (5(2):R12, 2004. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC395750"><span style="text-decoration: underline;">PubMedCentral</span></a> <em>[describes the MUMmer software for full-genome alignment &amp; comparisons]</em></p><p>Searching for SNPs with cloud computing. Langmead et al, Genome Biol 10(11):R134, 2009 <a href="http://genomebiology.com/content/10/11/R134"><span style="text-decoration: underline;">Full Text</span></a></p><p>Calling SNPs without a reference sequence. Ratan et al, BMC Bioinformatics 11:130, 2010 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2851604"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Microindel detection in short-read sequence data. Krawitz et al, Bioinformatics 26(6):722-9, 2010. <a href="http://bioinformatics.oxfordjournals.org/content/26/6/722.long"><span style="text-decoration: underline;">Full Text</span></a></p><p>vipR: variant identification in pooled DNA using R. Altmann et al., Bioinformatics 27: i77-i84, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3117388"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Geoseq: a tool for dissecting deep-sequencing datasets. Gurtowski et al, BMC Bioinformatics 11:506, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2972303/"><span style="text-decoration: underline;">PubMedCentral</span></a> <em>[Geoseq is a web service that allows searching deep sequencing datasets with a reference sequence of a gene of interest]</em></p><p>Detecting and annotating genetic variations using the HugeSeq pipeline. Lam et al, Nature Biotechnology 30:226 - 229, 2012 <span style="text-decoration: underline;"><a href="http://www.nature.com/nbt/journal/v30/n3/full/nbt.2134.html">Publisher Website</a></span>, <span style="text-decoration: underline;"><a href="http://hugeseq.snyderlab.org/">Home Page</a></span></p><p>Genome-wide LORE1 retrotransposon mutagenesis and high-throughput insertion detection in <em>Lotus japonicus</em>. Urbański et al, Plant J 64:731-741, 2012. <span style="text-decoration: underline;"><a href="http://onlinelibrary.wiley.com/doi/10.1111/j.1365-313X.2011.04827.x/abstract">Publisher Website</a></span> <em>[This paper describes a 2-dimensional pooling strategy with barcoding to allow use of Illumina sequencing to screen for retrotransposon insertion mutations, and includes a software package called FSTpoolit for analysis of the resulting sequence reads.]</em></p><h3>Genotyping by sequencing</h3><p>Genome-wide genetic marker discovery and genotyping using next-generation sequencing. Davey et al., Nat Rev Genet 12(7):499-510, 2011 <a href="http://www.ncbi.nlm.nih.gov/pubmed/21681211"><span style="text-decoration: underline;">PubMed</span></a> <em>[A review of methods available at the time]</em></p><p>A robust, simple genotyping-by-sequencing (GBS) approach for high diversity species. Elshire et al., PLoS One 6(5):e19379, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3087801"><span style="text-decoration: underline;">Full Text</span></a></p><p>Development of high-density genetic maps for barley and wheat using a novel two-enzyme genotyping-by-sequencing approach. Poland et al., PLoS One 7(2): e32253, 2012. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3289635/"><span style="text-decoration: underline;">Full Text</span></a></p><p>Double digest RADseq: an inexpensive method for de novo SNP discovery and genotyping in model and non-model species. Peterson et al, PLoS One 7(5):e37135, . 2012. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3365034/"><span style="text-decoration: underline;">Full Text</span></a></p><p>Imputation of unordered markers and the impact on genomic selection accuracy. Rutkowski et al, G3 3(3):427-39, 2013. <a href="http://www.g3journal.org/content/3/3/427.long"><span style="text-decoration: underline;">Full Text</span></a></p><p>Diversity Arrays Technology (DArT) and next-generation sequencing combined: genome-wide, high-throughput, highly informative genotyping for molecular breeding of <em>Eucalyptus</em>. Sansaloni et al., BMC Proceedings 5(Suppl 7):P54, 2011 <span style="text-decoration: underline;"><a href="http://www.biomedcentral.com/1753-6561/5/S7/P54">Full Text</a></span></p><p>High-throughput genotyping by whole-genome resequencing. Huang et al., Genome Res 19(6):1068-76, 2009. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694477"><span style="text-decoration: underline;">Full Text</span></a></p><p>Multiplexed shotgun genotyping for rapid and efficient genetic mapping. Andolfatto et al. Genome Res 21(4):610-7, 2011. <a href="http://genome.cshlp.org/content/21/4/610.long"><span style="text-decoration: underline;">Full Text</span></a></p><h3>Restriction-site Associated DNA (RAD) markers</h3><p>Rapid SNP discovery and genetic mapping using sequenced RAD markers. Baird et al, PLoS One 3(10):e3376, 2008 <span style="text-decoration: underline;"><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0003376">Full Text</a></span></p><p>Linkage mapping and comparative genomics using next-generation RAD sequencing of a non-model organism. Baxter et al., PLoS One 6(4):e19315, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3082572"><span style="text-decoration: underline;">Full Text</span></a></p><p>Genome evolution and meiotic maps by massively parallel DNA sequencing: spotted gar, an outgroup for the teleost genome duplication. Amores et al, Genetics 188(4):799-808, 2011. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21828280"><span style="text-decoration: underline;"> PubMed</span></a></p><p>Construction and application for QTL analysis of a Restriction-site Associated DNA (RAD) linkage map in barley. Chutimanitsakun et al, BMC Genomics 4; 12:4, 2011. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3023751"><span style="text-decoration: underline;">Full Text</span></a></p><p>RAD tag sequencing as a source of SNP markers in <em>Cynara cardunculus </em>L. Scaglione et al., BMC Genomics 13:3, 2012. <span style="text-decoration: underline;"><a href="http://www.biomedcentral.com/1471-2164/13/3">Full Text</a></span></p><p>Paired-end RAD-seq for de novo assembly and marker design without available reference. Willing et al., Bioinformatics 27(16):2187-93, 2011. <a href="http://bioinformatics.oxfordjournals.org/content/27/16/2187.long"><span style="text-decoration: underline;">Publisher Website</span></a></p><p>Local de novo assembly of RAD paired-end contigs using short sequencing reads. Etter et al., PLOS ONE 6(4): e18561, 2011. <a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0018561"><span style="text-decoration: underline;">Full Text</span></a></p><p>Stacks: building and genotyping loci de novo from short-read sequences. Catchen et al., G3: Genes, Genomes, Genetics, 1:171-182, 2011. <span style="text-decoration: underline;"> Full Text</span>, <a href="http://creskolab.uoregon.edu/stacks/"><span style="text-decoration: underline;">Home Page</span></a></p><p>Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads. Chong et al, Bioinformatics 28(21):2732-7, 2012. <a href="http://bioinformatics.oxfordjournals.org/content/28/21/2732.long"> <span style="text-decoration: underline;">Publisher Website</span></a></p><p>UK RAD Sequencing Wiki page, with bibliography and RADTools software download <a href="https://www.wiki.ed.ac.uk/display/RADSequencing/Home"><span style="text-decoration: underline;">Home Page</span></a></p><h3>Workspace environments</h3><p><span style="text-decoration: underline;">Papers</span></p><p>Galaxy: a comprehensive approach for supporting accessible, reproducible, and transparent computational research in the life sciences. Goecks et al, Genome Biol 11(8):R86, 2010 <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2945788"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>Galaxy Cloudman: Delivering compute clusters. BMC Bioinformatics 11(Suppl. 12):S4, 2010 <a href="http://www.biomedcentral.com/content/pdf/1471-2105-11-S12-S4.pdf"><span style="text-decoration: underline;">Full Text</span></a></p><p><a href="http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit"><span style="text-decoration: underline;">The Genome Analysis Toolkit</span></a>: a MapReduce framework for analyzing next-generation DNA sequencing data. McKenna et al, Genome Res 20(9):1297-303, 2010. <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2928508"><span style="text-decoration: underline;">PubMedCentral</span></a></p><p>A framework for variation discovery and genotyping using next-generation DNA sequencing data. DePristo et al., Nat Genet 43(5):491-8, 2011. <a href="http://www.ncbi.nlm.nih.gov/pubmed/21478889"><span style="text-decoration: underline;"> PubMed</span></a></p><p><span style="text-decoration: underline;">Online resources</span></p><p>The <a href="http://cran.r-project.org/"><span style="text-decoration: underline;">R statistical computing</span></a> environment includes<a href="http://www.bioconductor.org/"><span style="text-decoration: underline;"> Bioconductor</span></a>, a specialized set of tools for analysis of microarray and high-throughput sequencing data. Introductory materials from on-line or short workshops are widely available online; examples are <span style="text-decoration: underline;"><a href="http://bioconductor.org/help/course-materials/2012/Evomics2012/Bioconductor-tutorial.pdf">Evomics2012 Bioconductor-tutorial.pdf</a></span>, and <a href="http://bcb.dfci.harvard.edu/%7Eaedin/courses/Bioconductor/"><span style="text-decoration: underline;">Intro to Bioconductor</span></a>. Materials from an advanced course on high-throughput genetic data analysis are at <span style="text-decoration: underline;"><a href="http://bioconductor.org/help/course-materials/2012/SeattleFeb2012/">Seattle 2012 materials</a></span>. Thomas Girke of UC-Riverside has written a very complete set of manuals describing the use of R and Bioconductor for analysis of genomic datasets, available at <a href="http://manuals.bioinformatics.ucr.edu/home/R_BioCondManual">R and Bioconductor Manuals</a>. <br /> <a href="http://cran.r-project.org/manuals.html"><span style="text-decoration: underline;">Manuals</span></a> and contributed <a href="http://cran.r-project.org/other-docs.html"><span style="text-decoration: underline;">documentation</span></a> for R are available at the R-project.org website, and video tutorials are also available on Youtube; those posted by Tutorlol are brief, clear, and to the point. <br /> Materials from a series of mini-courses in R taught in 2010 at UCLA are available:</p><ul>
<li><a href="http://scc.stat.ucla.edu/page_attachments/0000/0141/10S-basicR.pdf">Intro to programming and graphics</a></li>
<li><a href="http://scc.stat.ucla.edu/page_attachments/0000/0143/S10_RProgII.pdf">Data manipulation and functions</a></li>
<li><a href="http://scc.stat.ucla.edu/page_attachments/0000/0185/Graphics_course.pdf">Graphics for exploratory data analysis</a></li>
<li><a href="http://scc.stat.ucla.edu/page_attachments/0000/0147/20100503_IntroStats.pdf">Introductory statistics</a></li>
<li><a href="http://scc.stat.ucla.edu/page_attachments/0000/0188/reg_R_1_09S_slides.pdf">Linear regression</a></li>
</ul><p><a href="http://a-little-book-of-r-for-bioinformatics.readthedocs.org/en/latest/"> <span style="text-decoration: underline;">A Little Book of R for Bioinformatics</span></a> is an on-line resource with information and exercises to provide practice in bioinformatics analysis of DNA sequences and other biological data in R. <br /> Many books on specific topics in R programming are also available through Amazon or other vendors.</p><h3>Cloud computing resources</h3><p>The case for cloud computing in genome informatics. Lincoln Stein, Genome Biol. 11(5):207, 2010 <a href="http://www.ncbi.nlm.nih.gov/pubmed/20441614"><span style="text-decoration: underline;">Pubmed</span></a></p><p>Galaxy Cloudman: delivering cloud compute clusters. Afgan et al, BMC Bioinformatics <span style="text-decoration: underline;">11</span>(Suppl 12):S4, 2010 <a href="http://www.biomedcentral.com/1471-2105/11/S12/S4"><span style="text-decoration: underline;">Full Text</span></a></p><p><a href="http://cloudbiolinux.com/">CloudBioLinux</a> is an open-source project that provides a bioinformatics Linux system for cloud computing, pre-configured with a variety of software tools installed and ready to use.</p><p>A <a href="https://github.com/chapmanb/cloudbiolinux/blob/master/doc/intro/gettingStarted_CloudBioLinux.pdf?raw=true"><span style="text-decoration: underline;">tutorial</span></a> on getting started with CloudBioLinux on the Amazon Web Services Elastic Compute Cloud (EC2)</p><p><a href="http://userwww.service.emory.edu/%7Eeafgan/content/ppt/EnisAfgan_BOSC_2010.pdf"><span style="text-decoration: underline;">Deploying Galaxy on the Cloud</span></a>  slides from a presentation by Enis Afgan (Emory University) at the <br /> &nbsp;Bioinformatics Open Source Conference in Boston, July 2010</p><p>A <a href="http://screencast.g2.bx.psu.edu/cloud/"><span style="text-decoration: underline;"> screencast</span></a> that provides a step-by-step guide to starting a Galaxy cluster in the EC2 environment</p><p>A <a href="https://bitbucket.org/galaxy/galaxy-central/wiki/cloud"><span style="text-decoration: underline;">webpage</span></a> that has the same information in text form, and is the basis for the screencast</p><p>The iPlant Collaborative, an NSF-funded project to create computational resources for plant biology research, provides access to cloud computing resources through <span style="text-decoration: underline;"><a href="http://www.iplantcollaborative.org/discover/atmosphere">Atmosphere</a></span></p><p>SeqWare Query Engine: storing and searching sequence data in the cloud. OConnor et al, BMC Bioinformatics <strong>11</strong>(Suppl 12)<strong>:</strong>S2, 2010 <a href="http://www.biomedcentral.com/1471-2105/11/S12/S2"><span style="text-decoration: underline;">Full Text</span></a></p><p>An overview of the Hadoop/MapReduce/HBase framework and its current applications in bioinformatics. Taylor, BMC Bioinformatics <strong>11</strong>(Suppl 12)<strong>:</strong>S1, 2010 <a href="http://www.biomedcentral.com/1471-2105/11/S12/S1"><span style="text-decoration: underline;">Full Text</span></a></p><h3>Links to Linux command-line tutorials and resources</h3><p>Tutorials for AWK, a powerful tool for handling data tables</p><ul>
<li>A set of <a href="http://people.bu.edu/scottm/AWK.NOTES"><span style="text-decoration: underline;">awk notes</span></a> from Boston University</li>
<li>Bruce Barnett's <a href="http://www.grymoire.com/Unix/Awk.html"><span style="text-decoration: underline;">awk tutorial</span></a></li>
<li>Greg Goebel's <a href="http://www.vectorsite.net/tsawk.html"><span style="text-decoration: underline;">awk tutorial</span></a></li>
<li><a href="http://teaching.software-carpentry.org/2013/01/16/1433/"><span style="text-decoration: underline;">Executing an awk command from R</span></a> to simplify data exploratory analysis, from Lex Nederbragt</li>
</ul><p>Tutorials for bash shell scripting</p><ul>
<li>A <a href="http://www.linuxconfig.org/bash-scripting-tutorial"><span style="text-decoration: underline;">tutorial</span></a> at linuxconfig.org</li>
<li>A <a href="http://www.hypexr.org/bash_tutorial.php"><span style="text-decoration: underline;">Getting Started With Bash</span></a> tutorial at hypexr.org</li>
<li>Mendel Cooper's <a href="http://tldp.org/LDP/abs/html/"><span style="text-decoration: underline;">Advanced Bash Shell-Scripting Guide</span></a></li>
</ul><p>Tutorials for sed, the command-line stream editor</p><ul>
<li>A <a href="http://www.panix.com/%7Eelflord/unix/sed.html"><span style="text-decoration: underline;">tutorial</span></a> at Rutgers</li>
<li>Peteris Krumins claims to have the <a href="http://www.catonmat.net/blog/worlds-best-introduction-to-sed/"><span style="text-decoration: underline;"> World's Best Introduction to Sed</span></a>; take a look and judge for yourself.</li>
<li>Bruce Barnett's <a href="http://www.grymoire.com/Unix/Sed.html"><span style="text-decoration: underline;">sed tutorial</span></a>.</li>
</ul><h3>Links to other useful sites</h3><p>The<a href="http://seqanswers.com/"><span style="text-decoration: underline;"> SEQanswers</span></a> online community has forums on several topics related to sequencing; the bioinformatics forum is the most active.</p><p>The SEQanswers <span style="text-decoration: underline;"><a href="http://seqanswers.com/wiki/Software">Software Wiki</a></span> is a list of software for analysis of sequencing data</p><p><a href="http://biostar.stackexchange.com/">Biostar</a> is another online community for questions and answers on bioinformatics and computational genomics.</p><p>Information on file formats used by the University of California - Santa Cruz Genome Browser is on the <a href="http://genome.ucsc.edu/FAQ/FAQformat"><span style="text-decoration: underline;"> FAQ list</span></a></p><p>A manual for the Integrated Genome Browser visualization tool is <a href="http://wiki.transvar.org/confluence/display/igbman/Home"><span style="text-decoration: underline;">here</span></a></p><p>Course materials for a short course entitled <a href="http://bioconductor.org/help/course-materials/2010/SeattleIntro/"><span style="text-decoration: underline;">Introduction to R and Bioconductor</span></a>, held in Seattle in Dec 2010</p><p><a href="http://great.stanford.edu/"><span style="text-decoration: underline;">Genomic Regions Enrichment of Annotations Tool</span></a> - A web service to test for over-representation of specific ontology categories among genes near ChIP-seq peaks</p><p><a href="http://www.animalgenome.org/bioinfo/resources/nextgensoft.html"><span style="text-decoration: underline;">Next-gen-seq software</span></a> - a list of software packages, both commercial and open-source, related to analysis of deep sequencing datasets</p><p><a href="http://www.cbcb.umd.edu/software/"><span style="text-decoration: underline;">Software</span></a> from the Center for Bioinformatics and Computational Biology, University of Maryland - many useful programs, all open-source</p><p><a href="http://bioinformatics.psb.ugent.be/plaza/"><span style="text-decoration: underline;"> PLAZA</span></a>: a comparative genomics resource to study gene and genome evolution in plants; described by Proost et al, Plant Cell 21:3718, 2010 <a href="http://www.plantcell.org/content/21/12/3718.full"><span style="text-decoration: underline;">Full Text</span></a></p><p>The European Bioinformatics Institute provides tools <a href="http://www.ebi.ac.uk/Tools/rcloud/"><span style="text-decoration: underline;">ArrayExpressHTS</span><span style="text-decoration: underline;"> and R-Cloud</span></a> for analysis of transcriptome data</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</guid>
	<pubDate>Sat, 25 Aug 2018 11:32:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37590/parallel-processing-with-perl</link>
	<title><![CDATA[Parallel Processing with Perl !]]></title>
	<description><![CDATA[<p>Here is a small tutorial on how to make best use of multiple processors for bioinformatics analysis. One best way is using perl threads and forks. Knowing how these threads and forks work is very important before implementing them. Getting to know how these work would be really useful before reading this tutorial.</p><p>Many times in bioinformatics we need to deal with huge datasets which&nbsp; are more than 100GB size. The traditional way to analysis a file is using the while loop</p><p>while (FILE){</p><p>Do something;</p><p>}</p><p>This is very slow(since we are using only one processor) and if we have 500 million lines in the dataset it takes more than a day to iterate through the whole dataset. So how do we make best use of all our processors and get the work done quickly?</p><p>Here is a very simple and efficient technique with perl which i have been using. I am&nbsp; more inclined towards using perl fork than perl threads.</p><p>One of the oldest way to fork is</p><blockquote><p>my $fork = fork();<br />if($fork){&nbsp;&nbsp;&nbsp;<br />push (@childs,$fork);&nbsp;<br />}<br />elseif($fork==0){<br /><strong>your code here;</strong><br />exit(0);<br />}<br />else{die &ldquo;Couldnt fork : $!&rdquo;;}</p><p>## wait for the child process to finish<br />foreach(@childs){<br />my $tmp=waitid($_,0);<br />}</p></blockquote><p>what a fork does is it creates a child process and takes the variables and code with it to analyze it separately (detached from the parent process) and thus a separate process is created( which usually runs on a separate processor). Thats it!! One big disadvantage of forking is its very difficult to share variables among the different processes. I will show you how to do it easily but still it has its own drawbacks.</p><blockquote><p>Okie, now if you really do not want to use fork in your code, that&rsquo;s okie too..There are many useful modules which do it for you very efficiently. One really useful module is Parallel::ForkManager. You can use Parallel::ForkManager to manage the number of forks you want to generate (number of processors you want to use).</p><p><strong>Simple usage:</strong><br />use Parallel::ForkManager;<br />my $max_processors=8;<br />my $fork= new Parallel::ForkManager($max_processors);<br />foreach (@dna) {<br />$fork-&gt;start and next; # do the fork<br /><strong>you code here;</strong><br />$fork-&gt;finish; # do the exit in the child process<br />}<br />$pm-&gt;wait_all_children;</p></blockquote><p>so you will be generating 8 forks which do the same thing for your each element of array. when one child finishes, Parallel::ForkManager generates a new one and thus you will be using all your processors to analyze the data. Now, if you have generated 8 child processes and want to write the data to one file. You need to lock the file to do this, because you will have problems with the buffering. You can lock the file using flock command.</p><blockquote><p>open (my $QUAL, &ldquo;myfile.txt&rdquo;);<br />flock $QUAL, LOCK_EX or die &ldquo;cant lock file $!&rdquo;;<br />print $QUAL &ldquo;$output&rdquo;;<br />flock $QUAL, LOCK_UN or die &ldquo;$!&rdquo;;<br />close $QUAL;</p></blockquote><p>I would not suggest using flock when dealing with multiple processes because it will decrease the processing efficiency( each child process must wait for the lock to be released by the other child process). Instead, I would suggest each fork writing to a separate file and after the processing just concatenating them.</p><p><strong>Putting it all together, If you have 100GB data you can do this</strong></p><blockquote><p><strong>step 1</strong>&nbsp;: split the dataset equally according to number of processors you have. this may take a few hours(about 2-3 hrs for 100GB file)<br />You can use unix &ldquo;split&rdquo; command for this<br />for example:<br />my $number_split=int($number_of_entries_in_your_dataset/$max_processors);<br />my $split_Files=`split -l $number_split &ldquo;your_file.fasta&rdquo; &ldquo;file_name&rdquo;`;</p><p><strong>step2</strong>: open you directory comtaining you split files and start Parallel::ForkManager.<br /><strong>For example:</strong><br />opendir(DIRECTORY, $split_files_directory) or die $!; ### open the directory<br />my $fork= new Parallel::ForkManager($max_processors);<br />while (my $file = readdir(DIRECTORY)) { ### read the directory<br />if($file=~/^\./){next;}<br />print $file,&rdquo;\n&rdquo;;<br />########## Start fork ##########<br />my $pid= $super_fork-&gt;start and next;<br /><strong>Whatever you want to do with the split file ;</strong><br /><strong>analyze my piece of $file;</strong><br />######### end fork ###############<br />$super_fork-&gt;finish;<br />}<br />$super_fork-&gt;wait_all_children;</p></blockquote><p>So basically each processor will be active with its piece of data (split file) and thus you have created 8 processes at one time which run without interfering with the other process. I again will not suggest writing output from each child process to one file(for reasons above). Write output from each fork to a separate file and finally concatenate them. Thats it, you have just increased your program speed by 8 times!! Isnt it easy?</p><p><strong>Note:</strong><br />You may worry about concatenation of the output each child generates, since it does take some time(remember 100GB). I think now you can use a mysql database LOAD DATA LOCAL INFILE command to load all the files into a single table(Should take about 3hrs for 100Gb dataset) and then export the whole table into one file. This should be faster than just concatenating them using &ldquo;cat&rdquo; command.(correct me if I am wrong)</p><p>Or much simpler way is to use pipes</p><p>cat output_dir/* | my_pipe or my_pipe &lt;(file1) final_file;</p><p>Thats it guys!! Enjoy programming and please do comment. I am not a computer scientist so forgive me for any mistakes and if any please report them. Thank you.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2457/rdataminingcom-r-and-data-mining</guid>
	<pubDate>Thu, 15 Aug 2013 18:37:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2457/rdataminingcom-r-and-data-mining</link>
	<title><![CDATA[Rdatamining.com : R and Data Mining]]></title>
	<description><![CDATA[<p>This website presents examples, documents and resources on data mining with R. <br>Documents on using R for data mining are available to download for non-commercial personal use, including&nbsp;R Reference card for Data Mining, R and Data Mining: Examples and Case Studies and Time Series Analysis and Mining with R.</p><p>Address of the bookmark: <a href="http://www.rdatamining.com/" rel="nofollow">http://www.rdatamining.com/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>