Back to results
US 6,187,544 B1Granted
Methods for rapid cloning for full length cDNAs using a pooling strategy
AssigneeSmithKline Beecham Corporation
InventorsDerk Jon Bergsma, Jeffrey L Mooney
Life of this patent
Estimating the term…
Abstract
The present invention provides a method for high throughput cloning of full length cDNA sequences using a pooling strategy. This method uses a plurality of clone arrays prepared from cDNA libraries which have been preferably enriched for 5 ′ mRNA sequences and size fractionated into several discrete ranges (sub-libraries). These arrays are used to rapidly identify the full length cDNA sequence for a DNA segment of interest.
Claims13
A method for high throughput full length cDNA cloning comprising:
- (a) preparing cDNAs from mRNAs;
- (b) size selecting the cDNAs into discrete n ranges;
- (c) transforming host cells with cDNAs from the each discrete n size ranges to make n separate sub-libraries;
- (d) placing up to m number of clones from each n sub-libraries into individual wells of k numbers of microtiter plates, each microtiter plates containing x numbers of rows and y numbers of columns, in a fashion that clones from each n sub-library will go into n separate sets of microtiter plates within the total k number of microtiter plates;
- (e) pooling all the clones from individual microtiter plates, and placing each pool of clones into wells of a second separate microtiter plate containing i rows and j columns, the second microtiter plate containing a total of k number of wells in such a fashion that placement of pools of clones will be placed in separate n regions within the microtiter plate in order to facilitate the identification of cDNA insert sizes;
- (f) identifying the well location of cDNA of interest in the second microtiter plate which has the longest insert;
- and correlating the well located to one of the earlier k number of microtiter plates;
- and
- (g) identifying the well location in the microtiter correlated in step (f) for the cDNA of interest;
- and in which m is a positive integer equal or greater than one;
- n, k, x, y, i, and j are positive integers greater than one;
- with the proviso i times j equals k.
9 more elements
Dependencies are inferred from the claim text.