The present disclosure relates generally to a parallel addressing method.
Multi-channel dispensers have been used for a variety of applications, including printing micro-arrays or dispensing one or more substances into a receiving medium to perform titrations, assays, or other chemical and/or biological analyses. Multi-channel dispensers include multiple dispensing channels that dispense fluids separately. The dispensing channels may be used to add volumes of different research drugs as doses, for example, to be tested in a bioassay. The dispensing channels may also be used to dispense the same fluid from all channels in parallel, which expedites dispensing. The channels are often arranged in a straight line, and the multi-channel dispenser may be operated so that the channels translate linearly in an orthogonal straight line direction along the dispensable area of the receiving medium. When translated linearly, the multi-channel dispenser may dispense to a receiver (e.g., substrate, well plate, sample repository grid, etc.) relatively quickly, at least in part because the channels may be repositioned simultaneously and activated simultaneously to dispense to discrete positions of an entire row of the receiver. Multi-channel dispensers and their controlling computer programs offer dispensing schemes which include dispensing in simple straight-line layouts along rows or columns and repetitiously dispensing a volume equivalently at each position.
Features and advantages of examples of the present disclosure will become apparent by reference to the following detailed description and drawings, in which like reference numerals correspond to similar, though perhaps not identical, components. For the sake of brevity, reference numerals or features having a previously described function may or may not be described in connection with other drawings in which they appear.
Examples of the multi-channel dispenser system disclosed herein include multiple dispensers having coordinated motion and coordinated dispense actuation, while also being fluidly separated from one another to achieve separate fluid dispensing. The multiple dispensers are able to achieve simultaneous or near simultaneous dispensing of multiple substances or of the same substance onto/into aligned positions of a receiver.
The dispensers disclosed herein may be selectively addressed, by a computer-controlled system, as sub-sets (i.e., less than all of the dispensers), even when one or more of the dispensers are aligned outside of a receiver boundary or are in between a receiver's discrete locations/positions. This may be particularly advantageous when it is desirable to create random-like layouts in a multi-dispenser mode while preserving dispensing speed. Examples of the computer program product (operable by the computer-controlled system or control interface) disclosed herein enable the creation of addressing layouts where all of the dispensers are addressed during a single addressing scheme and/or where the sub-sets of the dispensers are individually addressed during a wrap-around addressing scheme.
As used herein, a “wrap-around addressing scheme” refers to an at least two-step process that selectively electrically addresses pre-defined sub-sets of the plurality of parallel dispensers for sequential parallel addressing of the respective sub-sets adjacent to respective, desirable areas of a row. As will be described further hereinbelow, the row may be a part of a receiver, which may be a well plate, a non-media (i.e., non-paper) substrate having cavities, a media substrate (e.g., paper having discrete positions), a sample repository grid, etc. An example of the wrap-around addressing scheme may be a wrap-around dispensing scheme which includes selectively electrically addressing one sub-set of the dispensers to parallel dispense corresponding substances onto/into respective areas of a row of a receiver that are adjacent to the one sub-set, and then selectively electrically addressing a different sub-set of the dispensers to parallel dispense corresponding substances onto/into other respective areas of the row of the receiver that are adjacent to the different sub-set. An example of a useful wrap-around scheme is where a left-most sub-set of dispensers addresses receiver locations up to the right edge of the receiver, and the complementary right-most sub-set of dispensers is then used to address receiver locations up to the opposite, left-most edge of the receiver.
“Parallel dispensing” may involve the activation of each of the parallel dispensers, activation of a sub-set of adjacent parallel dispensers, or activation of some, but not all, of a sub-set of adjacent parallel dispensers. In the latter example, the non-actuated dispenser(s) will not dispense any substance, leaving non-filled position(s) on the receiver. As such, parallel dispensing may involve dispensing a substance from one dispenser while simultaneously not dispensing anything from another dispenser. Parallel dispensing may also include addressing some or all of the dispensers that are included in an array including rows and columns.
The examples disclosed herein refer to row(s), for example, of a layout and of a receiver. It is to be understood that the example schemes may be applied to columns of the layout and the receiver, depending, at least in part, on how the receiver is positioned with respect to the dispensers of the multi-channel dispenser system. In some example, as will be described further hereinbelow, the dispensers are arranged in a two-dimensional array, and thus the schemes may be applied to both rows and columns simultaneously.
The terms “first”, “second”, “third”, etc. may be used herein to distinguish one component (e.g., one row) from another component (e.g., another row). It is to be understood that these terms may be utilized to facilitate understanding, but are not meant to impose any particular order on the components being described. The examples disclosed herein may also refer to particular discrete positions in a layout or on a receiver using a modified matrix notation (i, j), where “i” is the numerical index of the row and “j” is the numerical index of the column.
Referring now to
The multi-channel dispenser system 10 may include any number of dispensers 12 (or 12′). In an example, the number of dispensers 12 (or 12′) is 8. In some examples, the number of dispensers 12 (or 12′) may correspond to a standard number of discrete positions 32 in a row, column, or area of a standard receiver 34. Standard numbers of discrete positions 32 may include, for example, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 384, and 1536.
The various dispensers 12 of the multi-channel dispenser system 10 are conjoined. As used herein, the term “conjoined” means that the dispensers 12 are coupled together in some manner so that they can be moved as a single entity. In an example, the dispensers 12 may be conjoined by assembling the dispenser components together (e.g., a multi-channel autopipettor). As an example, the dispensers 12 themselves are discrete, separate entities (e.g., as shown in
In the example shown in
It is to be understood that when tips, pipettes, or the like are utilized as the dispenser 12, a die 14 may not be utilized. Rather, in these examples, a housing may define the fluid channel 16.
Another example of the die 14 is shown in
As shown in
As will be discussed further hereinbelow, the monolithically integrated dispensers 12′ of
In the examples shown in
Referring back to
The data storage device 28 may store data, such as a layout (including, for example, dosage data) generated using the computer program product disclosed herein. In an example, the data storage device 28 saves the layouts in the form of a database for easy retrieval when the computer program product is accessed by a user. The data storage device 28 may include various types of memory modules, including volatile and nonvolatile memory. As an example, the data storage device 20 may include Random Access Memory (RAM), Read Only Memory (ROM), and Hard Disk Drive (HDD) memory. It is believed that other types of memory may also be used. In some instances, different types of memory in the data storage device 28 may be used for different data storage needs. For example, the processor 26 may boot from Read Only Memory (ROM), maintain nonvolatile storage in the Hard Disk Drive (HDD) memory, and execute program code stored in Random Access Memory (RAM). Generally, the data storage device 28 may be a non-transitory, tangible computer readable storage medium. For example, the data storage device 28 may be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination thereof. More specific examples of the computer readable storage medium may include, for example, the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.
The processor 26, in conjunction with addressing circuitry 31, operatively and individually controls each dispenser 12, 12′ such that a predetermined volume of a fluid/substance may be dispensed into or onto one or more positions 32 on the receiver 34. If a reservoir is fluidly connected to deliver fluid to a fluid channel 16 associated with the dispenser 12, 12′, it is to be understood that the processor 26, in conjunction with the addressing circuitry 31, also controls the amount of fluid/substance that is delivered from the reservoir to the fluid channel 16. In many examples however, the fluid channels 16 will be manually fillable via a user of the system 10.
The addressing circuitry 31 may include electrical interconnect members, conductive traces, bond pads, electrical pins, and/or the like. The addressing circuitry 31 operatively connects, for example, the actuators 22 to the processor 26 such that the processor 26 controls the electronics throughout the multi-channel dispenser system 10. The addressing circuitry 31 may, in some instances, be housed in an electrical housing 33 (
It is to be understood that in any of the examples disclosed herein, the dispensers 12, 12′ may be arranged in a two-dimensional array including any number of dispensers 12, 12′ in any number of rows and any number of dispensers 12, 12′ in any number of columns. As an example, an array of dispensers 12, 12′ may be a 9×12 array. A two-dimensional array of dispensers 12, 12′ may be used to dispense substance(s) in discrete positions of rows and/or columns of a receiver 34 simultaneously or near-simultaneously. A wrap-around scheme using a two-dimensional array of dispensers 12, 12′ may involve two sub-sets of dispensers 12, 12′ delineated as sections along a row and may also involve two additional sub-sets of dispensers 12, 12′ delineated as sections along a column. As such, some examples of this wrap-around scheme involve an at least four-step process. This type of wrap-around scheme may be used to wrap around a corner of a receiver 34, as opposed to an edge of the receiver 34.
As mentioned above, the conjoined dispensers 12, 12′ may be selectively addressed according to a wrap-around addressing scheme. An example of the wrap-around addressing scheme as a two-step process is shown in
It is to be understood that prior to implementing a wrap-around addressing scheme using the multi-channel dispenser system 10, the scheme may be created using the control interface 24 or by using another computing device (not shown) that is operatively connected to the processor 26, which executes the computer readable instructions of the computer program product disclosed herein. The computing device may be any device that is capable of being wired or wirelessly connected to the processor 26, including, for example, desktop computers, laptop computers, cell/smart phones, personal digital assistants (PDAs), or the like. The computing device provides an interface for a user to interact with and utilize the computer program product to create, for example, a layout corresponding to a desired wrap-around addressing scheme. Examples of layouts that may be generated using the computer program product will be further described in reference to
In the example of
At the first step of this example of the wrap-around addressing scheme, the dispensers 12, 12′ are moved into a position that enables a particular sub-set 36 of the dispensers 12, 12′, A-E to align with a particular sub-set 40 of the discrete positions 32d-32h of the receiver 34. Alignment in this example means that the sub-set 36 of dispensers 12, 12′, A-E is positioned so that a fluid/substance associated with each of the dispensers 12, 12′, A-E is capable of being dispensed from each of the dispensers 12, 12′, A-E into a desired one of the discrete position 32d-32h. Once in alignment, the dispensers 12, 12′, A-E are actuated by the processor 26 and addressing circuitry 31. In the example shown in
During the first step of this example wrap-around addressing scheme, the dispensers 12, 12′, F-H are not in registry/alignment with the discrete positions 32a-32h of the receiver 34. As such, at the first step of this example wrap-around addressing scheme, the dispensers 12, F-H are not actuated via the processor 26.
Once the desirable amount is dispensed from each of the dispensers 12, 12′, A-E in the sub-set 36, actuation is terminated. After the first step is complete, the discrete positions 32d-32h of the receiver 34 are filled with a desirable amount of a desirable fluid/substance, and the processor 26 then commands the dispensers 12, 12′ to perform the second step according to the wrap-around addressing scheme.
At the second step of this example of the wrap-around addressing scheme, the dispensers 12, 12′ are again selectively actuated. At the second step, the dispensers 12, A-H are moved into another position that enables a different sub-set 38 of the dispensers 12, 12′, F-H to align with a different sub-set 42 of the discrete positions 32a-32c of the receiver 34. Alignment in this example means that the sub-set 38 of dispensers 12, 12′, F-H is positioned so that a fluid/substance associated with each of the dispensers 12, 12′, F-H is capable of being dispensed from each of the dispensers 12, 12′, F-H into a desired one of the discrete position 32a-32c. Once in alignment, the dispensers 12, 12′, F-H are actuated by the processor 26 and addressing circuitry 31. In the example shown in
During the second step of this example wrap-around addressing scheme, the dispensers 12, 12′, A-E are not in registry/alignment with the discrete positions 32a-32h of the receiver 34. As such, at the second step of this example wrap-around addressing scheme, the dispensers 12, A-E are not actuated via the processor 26.
As shown in
In the example shown in
The volume that may be dispensed may be very small/minute. As defined herein, the terms “very small volume” and “minute volume” both refer to a volume ranging from about 10 femtoliters (fL) or a fraction thereof to about 10 microliters /(μL) of fluid, and in some examples, up to about 50 μL of fluid. In an example, pipette tips are used to dispense a volume ranging from 0.05 μL to about 50 μL. In another example, the individual dispensed volumes range from 1 picoliter (μL) to 5 μL, and these relatively large volumes are made up of numerous picoliter droplets. In still another example, the individual volume of dispensed drops ranges from about 1 μL to about 300 μL.
While the wrap-around addressing scheme shown in
In
Referring now to
To discuss the creation of a layout 44,
Upon initiating the generation of a layout 44, the user may be prompted by the computer program product to input general information, such as the number of rows and columns in his/her receiver 34, and the type of scheme he/she wishes to use for each row or column (depending upon the orientation of the dispensers 12, 12′ with respect to the receiver 34). From this information, the computer program product determines the number of discrete positions in the user's receiver 34 and the number of steps that will be needed to fulfill the requested addressing scheme. For example, the user may input that his/her receiver has 3 rows RA, RB, RC and 4 columns C1, C2, C3, C4, and may request that row RA be filled via a first wrap-around addressing scheme, that row RB be bypassed, and that row RC be filled according to a second wrap-around addressing scheme that is different than the wrap-around addressing scheme for filling row RA. The computer program product receives the input information and, via the processor executing the computer readable instructions, generates an input table 46 similar to the one shown in
The input table 46 shown in
When a user requests to bypass a row (i.e., does not want any of the discrete positions to be filled), the computer program product may simply acknowledge this request by filling in the bypass information in the next step of the input table 46. This is shown in
Since the user also requests that row RC be filled via a wrap-around addressing scheme, the computer program product generates two additional steps (e.g., Step 3 and Step 4) where the user can input information that will reflect how he/she would like the second wrap-around address scheme to be performed. These steps illustrate the bypass request in any fields that correspond with row RB. Similarly, in steps 3 and 4, the dispenser and amount fields for discrete positions in row RA are non-fillable because this row is not involved in the addressing scheme during these steps.
Upon receiving the input table 46 shown in
The computer program product may either deny this attempted data entry or may provide a warning to the user that the input information requires additional steps in both the programming and the dispensing execution. In an example, the warning may ask if the user wishes to change his/her original addressing scheme or modify the input data entry. In another example, warnings may inform the user that a dispense volume(s) is non-compliant with allowances, such as a volume limitation of the receiver 34 or the dispenser 12, 12′. For example, if an entered amount exceeds some set maximum for the dispenser 12, 12′ or the receiver 34, the computer program product may either deny this attempted data entry or may provide a warning to the user that the input information is outside of an allowed amount. The warning in this example may insist that the user modify the input data entry. Alternatively, in this example, the warning and the processor 26 may indicate that the non-compliant volumes are being adjusted to within allowances of the system 10. Other alarms/warnings are within the purview of this disclosure.
An example of the input table 46 after the user has input the desirable information is shown in
As mentioned above, the user also requested that row RB contain no fluids/substances after the addressing scheme is complete. In other words, the user requests that row RB be bypassed. As shown in
In the example of
It is to be understood that the computer program product may be programmed to insert data, such as “complete” or the previously assigned dispensing amounts, when fields of the input table 46 have been filled in earlier steps of the addressing scheme. For example, steps 1 and 2 involve dispensing into row RA and therefore at steps 3 and 4, the fields associated with the dispenser at discrete positions (RA, C1), (RA, C2), (RA, C3) and (RA, C4) may state complete, at least in part because the dispensing to this row RA is (or will be) completed by steps 3 and 4. Similarly, the fields associated with the amount at discrete positions (RA, C1), (RA, C2), (RA, C3) and (RA, C4) in steps 3 and 4 may state complete or may alternatively recite the amount that is scheduled to be dispensed into that particular discrete position RA, C1), (RA, C2), (RA, C3) and (RA, C4).
After the user inputs the desired data/information, the computer program product may generate a layout 44 based upon the completed input table 46. As mentioned above, an example of the layout 44 corresponding to the input table 46 shown in
The layout 44 may also include a key to facilitate understanding of the layout 44, and to pictorially represent what will happen at each step of the overall addressing scheme. For example, after a discrete position has been set for filling or partial filling, the representation of that particular discrete position may be colored, contain a pattern, etc. (see, for example, steps 2, 3 and 4). It is believed that this may assist the user in checking that the addressing scheme as presented in the layout 44 actually reflects his/her intentions for dispensing.
Referring now to
As briefly mentioned above, when creating the layout 44, a user may desire that fluids/substances be dispensed according to a dosing sequence. The sequence may be set while the user creates the layout 44. The sequence may, for example include a different dose for each row, where the amount dispensed into each discrete position within a single row is the same, but each row corresponds with a different dosage. This type of sequence is illustrated in
It is to be understood that other, more randomized sequences may be created.
At the second step of this example addressing scheme (
At the third step of this example addressing scheme (
Referring now to
For row RA, a single addressing scheme is set in which all of the dispensers 12, 12′, A-H are set to be simultaneously addressed so that each dispenser 12, 12′, A-H dispenses into an aligned discrete position (RA, CO, (RA, C2), (RA, C3), (RA, C4), (RA, C5), (RA, C6), (RA, C7), (RA, C1).
For row RB, a wrap-around addressing scheme is set in which the first dispenser sub-set 36 includes dispensers 12, 12′, A-D and the corresponding first discrete position sub-set 40 includes discrete positions (RB, C5), (RB, C6), (RB, C7), (RB, C8). To finish the wrap-around addressing scheme for row RB, the second dispenser sub-set 38 is set to include dispensers 12, 12′, E-H and the corresponding second discrete position sub-set 42 includes discrete positions (RB, C1), (RB, C2), (RB, C3), (RB, C4). Dosing sequence number 6 is dispensed along row RB.
For row RD, another wrap-around addressing scheme is set. In this wrap-around addressing scheme, the first dispenser sub-set 36 is set to include dispensers 12, 12′, A-F and the corresponding first discrete position sub-set 40 is set to include discrete positions (RC, C3), (RC, C4), (RC, C5), (RC, C6), (RC, C7), (RC, C8). To finish the wrap-around addressing scheme for row RD, the second dispenser sub-set 38 is set to include dispensers 12, 12′, G-H, and the corresponding second discrete position sub-set 42 includes discrete positions (RC, C1), (RC, C2). Dosing sequence numbers 2 and 7 are dispensed along row RC.
For row RD, yet another wrap-around addressing scheme is set. In this wrap-around addressing scheme, the first dispenser sub-set 36 is set to include dispensers 12, 12′, A-B and the corresponding first discrete position sub-set 40 is set to include discrete positions (RD, C7), (RD, C8). To finish the wrap-around addressing scheme for row RD, the second dispenser sub-set 38 is set to include dispensers 12, 12′, C-H, and the corresponding second discrete position sub-set 42 includes discrete positions (RD, C1), (RD, C2), (RD, C3), (RD, C4), (RD, C5), (RD, C6). Dosing sequence numbers 2, 3 and 7 are dispensed along row RD.
For row RE, still another wrap-around addressing scheme is set. In this wrap-around addressing scheme, the first dispenser sub-set 36 is set to include dispenser 12, 12′, A and the corresponding first discrete position sub-set 40 is set to include discrete position (RE, C8). To finish the wrap-around addressing scheme for row RE, the second dispenser sub-set 38 is set to include dispensers 12, 12′, B-H, and the corresponding second discrete position sub-set 42 includes discrete positions (RE, C1), (RE, C2), (RE, C3), (RE, C4), (RE, C5), (RE, C6 (RE, C7). Dosing sequence numbers 3, 5 and 7 are dispensed along row RE.
Another wrap-around addressing scheme is set for row RF. In this wrap-around addressing scheme, the first dispenser sub-set 36 is set to include dispensers 12, 12′, A-G and the corresponding first discrete position sub-set 40 is set to include discrete positions (RF, C2), (RF, C3), (RF, C4), (RF, C5), (RF, C6), (RF, C7), (RF, C8). To finish the wrap-around addressing scheme for row RF, the second dispenser sub-set 38 is set to include dispenser 12, 12′, H, and the corresponding second discrete position sub-set 42 includes discrete position (RF, CO. Dosing sequence numbers 3 and 5 are dispensed along row RF.
Still another wrap-around addressing scheme is set for row RG. In this wrap-around addressing scheme, the first dispenser sub-set 36 is set to include dispensers 12, 12′, A-E and the corresponding first discrete position sub-set 40 is set to include discrete positions (RG, C4), (RG, C5), (RG, C6), (RG, C7), (RG, C8). To finish the wrap-around addressing scheme for row RG, the second dispenser sub-set 38 is set to include dispenser 12, 12′, F-H, and the corresponding second discrete position sub-set 42 includes discrete positions (RG, C1), (RG, C2), (RG, C3). Dosing sequence number 4 is dispensed along row RF.
For row RH, a wrap-around addressing scheme is set and also includes a bypass scheme. The bypass scheme in this example involves bypassing a single discrete position (RH, C6) while the first sub-set 36 of dispensers is actuated. In this example, the first dispenser sub-set 36 is set to include dispensers 12, 12′, A-C and the corresponding first discrete position sub-set 40 is set to include discrete positions (RH, C6), (RH, C7), (RH, C8). Since dispenser 12, 12′, A is set to be bypassed, when the first sub-set 36 is actuated, dispenser 12, 12′, A will not be actuated while dispensers 12, 12′, B-C will be actuated. As such, when the first step of the wrap-around scheme for row RH is complete, discrete position (RH, C6) will remain unfilled while discrete positions (RH, C7), (RH, C8) will be filled/partially filled according to the dosing sequence number 8. To finish the wrap-around addressing scheme for row RG, the second dispenser sub-set 38 is set to include dispensers 12, 12′, D-H, and the corresponding second discrete position sub-set 42 includes discrete position (RH, C1), (RH, C2), (RH, C3), (RH, C4), (RH, C5). Dosing sequence number 8 is dispensed along row RF, except that the fluid/substance associated with dispenser 12, 12′, A is not dispensed in this example due to the bypass scheme that is set by the user.
Rows Ri and Rj in this example are positive and negative control discrete positions. The introduction of the positive signs (+) and negative signs (−) into the layout 44 indicate to the processor 26 that these positions are to be bypassed during the addressing scheme. Individual discrete positions or entire rows and/or columns may also be bypassed for other reasons too, such as, for example, to avoid dispensing a fluid above a known limit of its toxicity or solubility, for example.
While not shown in
In another similar example, the dispensers 12, 12′ may be jet dispensers whose associated nozzles are positioned 2.25 mm apart, and the receiver 34 may be a well plate including discrete positions 32a-32h or (Rx, Cy) every 4.5 mm. In this example, during one step of the wrap-around addressing scheme, every other dispenser 12, 12′ within the respective sub-sets 36, 38 may be actuated such that each discrete position 32a-32h or (Rx, Cy) within the respective sub-set 40, 42 receives a fluid/substance from one of the aligned dispensers within the respective sub-set 36, 38. Alternatively, all of the dispensers 12, 12′ within the respective sub-sets 36, 38 may be actuated such that each discrete position 32a-32h or (Rx, Cy) within the respective sub-set 40, 42 receives two fluids/substances from the two dispensers 12 that are aligned therewith. In another example, where registry between dispensers 12, 12′ and receivers 34 is not 1:1, it may be appropriate to shift position slightly in between dispensing from members of a subset 36 or 38. This set of dispensing actuations may still be considered parallel and suitably simultaneous or near-simultaneous. Any of these and other variations intended for present purposes to be legitimate steps in possible wrap-around schemes.
Also while not shown in the figures, it is to be understood that the layout 44 can include row (and/or column) hopping, where the rows (and/or columns) are not fulfilled sequentially from row RA (column 1) to row RB (column 2) to row RC (column 3), etc. to the end of the rows (and/or columns). Rather, the computer program product may be used to create a layout 44 where row RB is dispensed first, row RA is dispensed third, etc.
The examples of the computer program product disclosed herein enable the generation and execution of multiple addressing and dispensing schemes. More particularly, the wrap-around addressing schemes allow for flexible experimental designs and dispensing schemes. For example, a layout 44 may be generated that is randomized (e.g., with regard to where certain fluids/substances are dispensed and/or how much volume of fluid is dispensed) across a receiver 34 without loss of parallel dispensing and/or throughput. The layouts 44 may also be customized, including single addressing scheme(s), wrap-around addressing scheme(s), and/or by-pass addressing schemes.
The programming of wrap-around schemes may be automated, such as involving random or systematic allocation of volumes and also random or systematic wrap-around layouts. As such, the wrap-around schemes disclosed herein may be standardized to suit the needs of a given experiment or organization. As examples, standard control wells may be declared for wrap-around in bypass mode; standard layouts may be declared where the first dispenser 12, 12′, A is aligned to a discrete position that is incrementally indexed +3 column locations with each incremental row; a corresponding wrap-around dispensing scheme in two-steps is employed; volumes delivered by each dispenser 12, 12′ at each of its locations are allocated randomly from a list of required volumes; or the like. Advantages of such automation and standardization of layouts 44 with sets of wrap-around schemes include facilitating programming, dispensing speed, and standardized data treatment. Additionally, more sophisticated layouts and experiments can be designed to facilitate cost savings and more valuable discoveries.
Additionally, the wrap-around schemes provide rapid dispensing. Some dispensed components and/or bioassay constituents are sensitive to temperature, and thus prolonged dispensing time may produce undesirable reactions and/or artifacts. Moreover, other inevitable, undesirable artifacts (e.g., temperature bias from edge to center of receiver 34, also known as “edge effects” in well plates) may be accommodated better by using the wrap-around schemes disclosed herein to decouple such artifacts from other variations of interest (bioassay response to different drugs and doses), which ultimately improves research quality. The examples disclosed herein enable rapid dispensing and high throughput that decouples these undesirable reactions and/or artifacts from the dispensing process and its intended and/or unintended consequences. Without the wrap-around schemes, all these artifacts and dispensing consequences could be coupled together, thus degrading the quality of results. Compared with conventional dispensing layouts, the wrap-around schemes disclosed herein retain high throughput and conserve cost while improving the quality of dispensing-based results.
It is to be understood that the ranges provided herein include the stated range and any value or sub-range within the stated range. For example, an amount ranging from about 1 μL to about 5 μL should be interpreted to include not only the explicitly recited amount limits of 1 μL to about 5 μL, but also to include individual amounts, such as 100 μL, 5,000 μL, 0.25 μL, etc., and sub-ranges, such as 50 μL to 1 μL, etc. Furthermore, when “about” is utilized to describe a value, this is meant to encompass minor variations (up to +/−5%) from the stated value.
It is to be understood use of the words “a” and “an” and other singular referents include plural as well, both in the specification and claims.
While several examples have been described in detail, it will be apparent to those skilled in the art that the disclosed examples may be modified. Therefore, the foregoing description is to be considered non-limiting.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US2011/058334 | 10/28/2011 | WO | 00 | 4/23/2014 |