`
`From:
`on behalf of
`Sent:
`To:
`CC:
`Subject:
`
`srquake@gmail.com [srquake@gmail.com]
`Stephen Quake [quake@stanford.edu]
`1/29/2008 11:14:57 PM
`Joe DeRisi Uoe@derisilab.ucsf.edu]
`Christina Fan [chfan@stanford.edu]
`Re: 454 sequencing
`
`thanks, we are just getting organized. for the first few runs do you
`want to arrange some kind of reagent barter? (ie i will float you here
`for 454 runs if you do the same; if it doesn't balance out in a half
`year or so we find a way to move cash back and forth).
`
`steve
`
`thanks for dropping by the other day - it was a big help.
`
`on 1/9/08, Joe DeRisi <joe@derisilab.ucsf.edu> wrote:
`> Hi Steve,
`> Great. The solexa guy here is clement chu. His email is
`> clement.chu@ucsf.edu. I will let him know that you or someone from
`> your lab will contact him.
`>
`> our machine is currently configured for 8 lanes/flowcell, with 330
`> tiles per lane. For a good library, you should get 20-30k clusters per
`> tile, which, in an ideal world, would give you about 9 million reads
`>per lane, each 36nt. In reality, folks are getting 2-4 million, and
`>the 8th lane is usually reserved for a control. It is clear the read
`> length can be extended, if you are willing to tolerate some additional
`> errors.
`>Depending on your application, we can advise on library construction strategies.
`>
`>
`>
`> -joe
`>
`>on Jan 9, 2008 3:06 PM, Stephen Quake <quake@stanford.edu> wrote:
`> > joe,
`> >
`> > the person in my lab to contact about a 454 run is rick white. each
`> > full run is 400,000 reads of - 250 bp each.
`the configuration is two
`> > large chambers, which are independently loaded (ie can be different
`> > samples).
`there are other configurations (up to 16 independent
`> > samples) and it is possible to do runs of shorter reads (100bp), which
`> > are slightly cheaper.
`> >
`> > best
`> >
`> > steve
`> >
`> >
`> >
`> > stephen Quake
`> > Professor of Bioengineering
`> > Stanford University
`> >
`> > PLEASE REPLY TO: quake@stanford.edu
`> >
`>
`
`stephen Quake
`Professor of Bioengineering
`stanford University
`
`PLEASE REPLY TO: quake@stanford.edu
`
`STANFORD EXHIBIT 2119
`SEQUENOM v. STANFORD
`CASE IPR2013-00390
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
