<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Crossbow: NGS Informatics in the Cloud</title>
	<atom:link href="http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html/feed" rel="self" type="application/rss+xml" />
	<link>http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html</link>
	<description>Medical genomics in the post-genome era</description>
	<lastBuildDate>Fri, 27 Apr 2012 18:07:26 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Gary Stiehr</title>
		<link>http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html/comment-page-1#comment-284</link>
		<dc:creator>Gary Stiehr</dc:creator>
		<pubDate>Tue, 24 Nov 2009 21:20:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.massgenomics.org/?p=449#comment-284</guid>
		<description>Dan, how does the computational complexity of this process change as the read lengths increase?  I.e., for a given human genome with the a given coverage, would the computing required decrease over time as the read lengths increase?</description>
		<content:encoded><![CDATA[<p>Dan, how does the computational complexity of this process change as the read lengths increase?  I.e., for a given human genome with the a given coverage, would the computing required decrease over time as the read lengths increase?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gary Stiehr</title>
		<link>http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html/comment-page-1#comment-283</link>
		<dc:creator>Gary Stiehr</dc:creator>
		<pubDate>Tue, 24 Nov 2009 20:58:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.massgenomics.org/?p=449#comment-283</guid>
		<description>Hi Dan, great analysis of the data.  You may be interested in my analysis of the computational numbers presented in that paper as well: http://hpcinfo.com/2009/11/22/benchmarking-the-cloud-for-genomics/</description>
		<content:encoded><![CDATA[<p>Hi Dan, great analysis of the data.  You may be interested in my analysis of the computational numbers presented in that paper as well: <a href="http://hpcinfo.com/2009/11/22/benchmarking-the-cloud-for-genomics/" rel="nofollow">http://hpcinfo.com/2009/11/22/benchmarking-the-cloud-for-genomics/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: PolITiGenomics &#187; Blog Archive &#187; Bioinformatics and cloud computing</title>
		<link>http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html/comment-page-1#comment-282</link>
		<dc:creator>PolITiGenomics &#187; Blog Archive &#187; Bioinformatics and cloud computing</dc:creator>
		<pubDate>Tue, 24 Nov 2009 19:54:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.massgenomics.org/?p=449#comment-282</guid>
		<description>[...] From the Using clouds for parallel computations in systems biology workshop at the recent SC09 conference (Informatics Iron writeup) to last month&#8217;s Genome Informatics meeting, everyone in bioinformatics is talking about cloud computing these days. Last week Steven Salzberg&#8217;s group published a paper on their Crossbow tool entitled Searching for SNPs with cloud computing (Cloudera blog post on Crossbow). In the paper the authors describe how they were able to analyze the human sequence data published last year by BGI using Amazon EC2. Specifically, they have developed an alignment (bowtie) and SNP detection (SoapSNP) pipeline that is executed in parallel across a cluster using the Hadoop framework (a free software implementation of Google&#8217;s MapReduce framework). Using a 40-node, 320-core EC2 cluster, they were able to analyze 38&#215; coverage sequence data in about three hours. The whole analysis, including data transfer and storage on Amazon S3, cost about $125. You can find a more detailed cost breakdown and comparison on Gary Stiehr&#8217;s HPCInfo post and more detail on the SNP detection on Dan Koboldt&#8217;s Mass Genomics post. [...]</description>
		<content:encoded><![CDATA[<p>[...] From the Using clouds for parallel computations in systems biology workshop at the recent SC09 conference (Informatics Iron writeup) to last month&#8217;s Genome Informatics meeting, everyone in bioinformatics is talking about cloud computing these days. Last week Steven Salzberg&#8217;s group published a paper on their Crossbow tool entitled Searching for SNPs with cloud computing (Cloudera blog post on Crossbow). In the paper the authors describe how they were able to analyze the human sequence data published last year by BGI using Amazon EC2. Specifically, they have developed an alignment (bowtie) and SNP detection (SoapSNP) pipeline that is executed in parallel across a cluster using the Hadoop framework (a free software implementation of Google&#8217;s MapReduce framework). Using a 40-node, 320-core EC2 cluster, they were able to analyze 38&times; coverage sequence data in about three hours. The whole analysis, including data transfer and storage on Amazon S3, cost about $125. You can find a more detailed cost breakdown and comparison on Gary Stiehr&#8217;s HPCInfo post and more detail on the SNP detection on Dan Koboldt&#8217;s Mass Genomics post. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ben L</title>
		<link>http://massgenomics.org/2009/11/crossbow-ngs-informatics-in-the-cloud.html/comment-page-1#comment-281</link>
		<dc:creator>Ben L</dc:creator>
		<pubDate>Mon, 23 Nov 2009 22:27:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.massgenomics.org/?p=449#comment-281</guid>
		<description>Hi Dan,

Thanks for this thorough post!

Some very quick responses:

- The 38x number is from the raw number of bases in all of the reads.  To calculate, we downloaded all the reads from the EBI UK mirror of the YanHuang site and totaled all bases in all reads, then divided by the number of bases (incl. Ns) in the hg18 reference.  That gives us 38.2x.  That&#039;s basically the same number as if you use the total for &quot;Total bases (Gb)&quot; from Table 1 of the Wang et al paper.  Frankly, I&#039;m not sure where the 36x number from the text of the Wang et al paper comes from; if you go by their total for &quot;Mapped bases (Gb)&quot; in Table 1, it gives you about 33.5x.

- As for # SNPs, filtering is the most likely reason because it&#039;s by far the biggest difference between the two experimental setups.  Note that the alignment policy we used for Bowtie (2-mismatch unique (in the &quot;stratified&quot; sense)) is the same as is used in the SOAPsnp study (see the &quot;Read alignment&quot; subsection of the &quot;Methods&quot; section in the SOAPsnp study).  We double-checked that they used this policy by looking at their alignments, which are available at the YanHuang site.  We agree that our too-simplistic filtering scheme is a target for criticism, but because it&#039;s easy to implement as a non-parallel post-pass over the final SNP data, we thought it was too peripheral to fret about in the paper.  That said, we&#039;re going to be working on it soon.

Thanks again - great blog,
Ben</description>
		<content:encoded><![CDATA[<p>Hi Dan,</p>
<p>Thanks for this thorough post!</p>
<p>Some very quick responses:</p>
<p>- The 38x number is from the raw number of bases in all of the reads.  To calculate, we downloaded all the reads from the EBI UK mirror of the YanHuang site and totaled all bases in all reads, then divided by the number of bases (incl. Ns) in the hg18 reference.  That gives us 38.2x.  That&#8217;s basically the same number as if you use the total for &#8220;Total bases (Gb)&#8221; from Table 1 of the Wang et al paper.  Frankly, I&#8217;m not sure where the 36x number from the text of the Wang et al paper comes from; if you go by their total for &#8220;Mapped bases (Gb)&#8221; in Table 1, it gives you about 33.5x.</p>
<p>- As for # SNPs, filtering is the most likely reason because it&#8217;s by far the biggest difference between the two experimental setups.  Note that the alignment policy we used for Bowtie (2-mismatch unique (in the &#8220;stratified&#8221; sense)) is the same as is used in the SOAPsnp study (see the &#8220;Read alignment&#8221; subsection of the &#8220;Methods&#8221; section in the SOAPsnp study).  We double-checked that they used this policy by looking at their alignments, which are available at the YanHuang site.  We agree that our too-simplistic filtering scheme is a target for criticism, but because it&#8217;s easy to implement as a non-parallel post-pass over the final SNP data, we thought it was too peripheral to fret about in the paper.  That said, we&#8217;re going to be working on it soon.</p>
<p>Thanks again &#8211; great blog,<br />
Ben</p>
]]></content:encoded>
	</item>
</channel>
</rss>

