US5733729A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer-aided probability base calling for arrays of nucleic acid probes on chips
Assignee: Affymetrix Inc
•
Filing: 1995-09-14
•
Granted: 1998-03-31
•
Expires: 2015-09-14
Abstract
Abstract A computer system for analyzing nucleic acid sequences is provided. The computer system is used to calculate probabilities for determining unknown bases by analyzing the fluorescence intensities of hybridized nucleic acid probes on biological chips. Additionally, information from multiple experiments is utilized to improve the accuracy of calling unknown bases.
Inventors
- 👤 Robert J. Lipshutz
- 👤 Michael G. Walker
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 11:31
CPC Classifications
C; C12; C12Q; C12Q1/00; C12Q1/68; C12Q1/6813; C12Q1/6834; C12Q1/6837; G; G16; G16B; G16B25/00; Y; Y10; Y10S; Y10S435/00; Y10S435/973
Claims Analysis
Total Claims: 43
Claim 1
Independent Claim
132 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: defining a set of potential base calls, said base calls including at least one of A, C, G, T(U), deletion, insertion, and a plurality of ambiguous calls; inputting a plurality of measurements for hybridization between a plurality of probes and said sample nucleic acid sequence or nucleic acid derived from said sample nucleic acid sequence; determining a plurality of probabilities, each of said probabilities reflecting the likelihood that one of the potential base calls is correct, said probabilities being calculated according to a distribution model, said hybridization measurements and sequences of said plurality of probes; and calling the unknown base according to the probabilities of said potential base calls.
Claim 2
Dependent Claim
132 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: defining a set of potential base calls, said base calls including at least one of A, C, G, T(U), deletion, insertion, and a plurality of ambiguous calls; inputting a plurality of measurements for hybridization between a plurality of probes and said sample nucleic acid sequence or nucleic acid derived from said sample nucleic acid sequence; determining a plurality of probabilities, each of said probabilities reflecting the likelihood that one of the potential base calls is correct, said probabilities being calculated according to a distribution model, said hybridization measurements and sequences of said plurality of probes; and calling the unknown base according to the probabilities of said potential base calls.
Claim 3
Dependent Claim
29 words
The method of claim 1, wherein the unknown base is called according to the highest probability, said highest probability indicates a confidence that the unknown base is called correctly.
Claim 4
Dependent Claim
18 words
The method of claim 1, wherein each nucleic acid probe has a different base at an interrogation position.
Claim 5
Dependent Claim
30 words
The method of claim 3, wherein each probability indicates the likelihood that the unknown base is complementary to a base at the interrogation position in the corresponding nucleic acid probe.
Claim 6
Dependent Claim
15 words
The method of claim 1, wherein a plurality of measurements for each hybridization are inputted.
Claim 7
Dependent Claim
18 words
The method of claim 5, wherein a mean of said plurality of measurements for each hybridization is determined.
Claim 8
Dependent Claim
22 words
The method of claim 5, further comprising the step of calculating a standard deviation of said plurality of measurements for each hybridization.
Claim 9
Dependent Claim
18 words
The method of claim 1, further comprising the step of comparing the highest probability to a probability threshold.
Claim 10
Dependent Claim
30 words
The method of claim 8, wherein the unknown base is called according to the nucleic acid probe associated with the highest probability if the highest probability exceeds the probability threshold.
Claim 11
Dependent Claim
55 words
The method of claim 8, further comprising the steps of: producing a sum of the highest probability and a next highest probability; comparing the sum to the probability threshold; and calling the unknown base according to the nucleic acid probes associated with the highest and next highest probabilities if the sum exceeds the probability threshold.
Claim 12
Dependent Claim
25 words
The method of claim 10, wherein the sum indicates a confidence that the unknown base is called correctly if the sum exceeds the probability threshold.
Claim 13
Dependent Claim
51 words
The method of claim 1, wherein each probability is determined by a first equation: Prob(X)=Prob(I.sub.x >max(I.sub.y)).sub.yx where X and Y are A, C, G, T(U) or deletion, insertion, or a plurality of ambiguous calls; I is a measurement associated with a subscripted base; and max represents a maximum of said measurements.
Claim 14
Dependent Claim
42 words
The method of claim 12, wherein the first equation is solved by a second equation: Prob(I.sub.x >max(I.sub.y))=ΠProb(I.sub.x >I.sub.y).sub.y≠x where X and Y are A, C, G, T(U), deletion, insertion, or a plurality of ambiguous calls and II represents a product of probabilities.
Claim 15
Dependent Claim
58 words
The method of claim 13, wherein the term Prob(I x >I y ) is solved with a third equation: ##EQU4## where X and Y are A, C, G, T(U), deletion, insertion, or a plurality of ambiguous calls and represents a standard deviation ( 2 being a variance) of measurements for a subscripted base and represents a density equation.
Claim 16
Dependent Claim
27 words
The method of claim 14, wherein the of said third equation is: ##EQU5## and the of said third equation represents a density equation of standard normal distribution.
Claim 17
Dependent Claim
18 words
The method of claim 1, wherein the unknown base is called as being A, C, G, or T(U).
Claim 18
Dependent Claim
91 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of hybridization probe intensities, each of the probe intensities corresponding to a nucleic acid probe; code that determines for each of the plurality of probe intensities a probability that the corresponding nucleic acid probe best hybridizes with the sample nucleic acid sequence; and code that calls the unknown base according to the nucleic acid probe with the highest associated probability; wherein the codes are stored on a tangible medium.
Claim 19
Dependent Claim
91 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of hybridization probe intensities, each of the probe intensities corresponding to a nucleic acid probe; code that determines for each of the plurality of probe intensities a probability that the corresponding nucleic acid probe best hybridizes with the sample nucleic acid sequence; and code that calls the unknown base according to the nucleic acid probe with the highest associated probability; wherein the codes are stored on a tangible medium.
Claim 20
Dependent Claim
72 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a plurality of base calls for the unknown base, each of the base calls having probability which represents a confidence that the known base is called correctly; selecting a base call that has a highest associated probability; and calling the unknown base according to the selected base call.
Claim 21
Dependent Claim
72 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a plurality of base calls for the unknown base, each of the base calls having probability which represents a confidence that the known base is called correctly; selecting a base call that has a highest associated probability; and calling the unknown base according to the selected base call.
Claim 22
Dependent Claim
31 words
The method of claim 18, further comprising the step of performing a base call of the unknown base according to hybridization of nucleic acid probes with the sample nucleic acid sequence.
Claim 23
Dependent Claim
16 words
The method of claim 18, wherein the base calls are determined from a plurality of experiments.
Claim 24
Dependent Claim
79 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of base calls for the unknown base, each of the base calls having an associated probability which represents a confidence that the unknown base is called correctly; selecting a base call that has a highest associated probability; and calling the unknown base according to the selected base call; wherein the codes are stored on a tangible medium.
Claim 25
Dependent Claim
79 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of base calls for the unknown base, each of the base calls having an associated probability which represents a confidence that the unknown base is called correctly; selecting a base call that has a highest associated probability; and calling the unknown base according to the selected base call; wherein the codes are stored on a tangible medium.
Claim 26
Dependent Claim
82 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a plurality of probabilities for each possible base for the unknown base, each of the probabilities representing a probability that the unknown base is an associated base; producing a product of probabilities for each possible base, each product being associated with a possible base; and calling the unknown base according to a base associated with a highest product.
Claim 27
Dependent Claim
82 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a plurality of probabilities for each possible base for the unknown base, each of the probabilities representing a probability that the unknown base is an associated base; producing a product of probabilities for each possible base, each product being associated with a possible base; and calling the unknown base according to a base associated with a highest product.
Claim 28
Dependent Claim
26 words
The method of claim 22, further comprising the step of calculating the probabilities according to hybridization of nucleic acid probes with the sample nucleic acid sequence.
Claim 29
Dependent Claim
15 words
The method of claim 22, wherein the probabilities are determined from a plurality of experiments.
Claim 30
Dependent Claim
91 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of probabilities for each possible base for the unknown base, each of the probabilities representing a probability that the unknown base is an associated base; code that produces a product of probabilities for each possible base, each product being associated with a possible base; and code that calls the unknown base according to a base associated with a highest product; wherein the codes are stored on a tangible medium.
Claim 31
Dependent Claim
91 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input a plurality of probabilities for each possible base for the unknown base, each of the probabilities representing a probability that the unknown base is an associated base; code that produces a product of probabilities for each possible base, each product being associated with a possible base; and code that calls the unknown base according to a base associated with a highest product; wherein the codes are stored on a tangible medium.
Claim 32
Dependent Claim
141 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a first base call for the unknown base, the first base call determined from a first nucleic acid probe that is equivalent to a portion of the sample nucleic acid sequence including the unknown base; inputting a second base call for the unknown base, the second base call determined from a second nucleic acid probe that is complementary to a portion of the sample nucleic acid sequence including the unknown base; selecting one of the first or second nucleic acid probes that has a base at an interrogation position which has a high probability of producing correct base calls; and calling the unknown base according to the selected one of the first or second nucleic acid probes.
Claim 33
Dependent Claim
141 words
In a computer system, a method of calling an unknown base in a sample nucleic acid sequence, the method comprising the steps of: inputting a first base call for the unknown base, the first base call determined from a first nucleic acid probe that is equivalent to a portion of the sample nucleic acid sequence including the unknown base; inputting a second base call for the unknown base, the second base call determined from a second nucleic acid probe that is complementary to a portion of the sample nucleic acid sequence including the unknown base; selecting one of the first or second nucleic acid probes that has a base at an interrogation position which has a high probability of producing correct base calls; and calling the unknown base according to the selected one of the first or second nucleic acid probes.
Claim 34
Dependent Claim
30 words
The method of claim 26, further comprising the step of calculating the first and second base calls according to hybridization of nucleic acid probes with the sample nucleic acid sequence.
Claim 35
Dependent Claim
22 words
The method of claim 26, wherein the base that has a high probability of producing correct base calls is A or G.
Claim 36
Dependent Claim
143 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input first and second base calls for the unknown base, the first base call determined from a first nucleic acid probe that is equivalent to a portion of the sample nucleic acid sequence including the unknown base and the second base call determined from a second nucleic acid probe that is complementary to a portion of the sample nucleic acid sequence including the unknown base; code that selects one of the first or second nucleic acid probes that has a base at an interrogation position which has a high probability of producing correct base calls; and code that calls the unknown base according to the selected one of the first or second nucleic acid probes; wherein the codes are stored on a tangible medium.
Claim 37
Dependent Claim
143 words
A computer program that calls an unknown base in a sample nucleic acid sequence, comprising: code that receives as input first and second base calls for the unknown base, the first base call determined from a first nucleic acid probe that is equivalent to a portion of the sample nucleic acid sequence including the unknown base and the second base call determined from a second nucleic acid probe that is complementary to a portion of the sample nucleic acid sequence including the unknown base; code that selects one of the first or second nucleic acid probes that has a base at an interrogation position which has a high probability of producing correct base calls; and code that calls the unknown base according to the selected one of the first or second nucleic acid probes; wherein the codes are stored on a tangible medium.
Claim 38
Dependent Claim
82 words
In a computer system, a method for determining whether a target nucleic acid hybridizes better to one of two probes comprising the steps of: obtaining a plurality of first signals from a first hybridization between said target nucleic acid and a first probe; obtaining a plurality of second signals from a second hybridization between said target nucleic acid and a second probe; and calculating a probability that said first signals are stronger than said second signals according to a signal distribution model.
Claim 39
Dependent Claim
82 words
In a computer system, a method for determining whether a target nucleic acid hybridizes better to one of two probes comprising the steps of: obtaining a plurality of first signals from a first hybridization between said target nucleic acid and a first probe; obtaining a plurality of second signals from a second hybridization between said target nucleic acid and a second probe; and calculating a probability that said first signals are stronger than said second signals according to a signal distribution model.
Claim 40
Dependent Claim
22 words
The method of claim 30, wherein said first and second signals are obtained by scanning different areas of their corresponding hybridization cells.
Claim 41
Dependent Claim
15 words
The method of claim 30, wherein said signal distribution model is the normal distribution function.
Claim 42
Dependent Claim
15 words
The method of claim 30, wherein said signal distribution model is the Student's t distribution.
Claim 43
Dependent Claim
59 words
The method of claim 30, wherein said probability is determined by: ##EQU6## where Φ represents a density equation of standard normal distribution; I x represents mean intensity of said first signals; I y represents mean intensity of said second signals; σ x represents standard deviation of said first signals; and σ y represents standard deviation of said second signals.
References Cited (Backward Citations)
US5202231A
Cited
US5002867A
Cited
WO1989010977A1
Cited
US5445934A
Cited
US5143854A
Cited
WO1992010092A1
Cited
WO1992010588A1
Cited
US5502773A
Cited
US5365455A
Cited
US5235626A
Cited
US5384261A
Cited
US5288514A
Cited
US5503980A
Cited
US5470710A
Cited
WO1995011995A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-03-30 | 2001-09-29 | 2002-03-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-30 | 2005-09-29 | 2006-03-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-30 | 2009-09-29 | 2010-03-31 | $7700.00 | Window Closed / Lapsed |