# US 2005/0032095 A1 · Virtual representations of nucleotide sequences

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2005/0032095 A1
- Document ID: US20050032095A1
- Status: Published application
- Kind: A1
- Application number: 10/851,779
- Filed: 2004-05-21
- Published: 2005-02-10
- Earliest claimed: 2003-05-23
- Assignees: Cold Spring Harbor Laboratory
- Inventors: Michael Wigler; John Healy; Robert Lucito
- Web page: https://patentgrep.com/patent/US20050032095A1

## CPC

- C07H 21/04: with deoxyribosyl as saccharide radical
- C07H: SUGARS; DERIVATIVES THEREOF; NUCLEOSIDES; NUCLEOTIDES; NUCLEIC ACIDS (derivatives of aldonic or saccharic acids C07C, C07D; aldonic acids, saccharic acids C07C59/105, C07C59/285; cyanohydrins C07C255/16; glycals C07D; compounds of unknown constitution C07G; polysaccharides, derivatives thereof C08B; DNA or RNA concerning genetic engineering, vectors, e.g. plasmids, or their isolation, preparation or purification C12N15/00; sugar industry C13)

## Abstract

The invention provides oligonucleotide probes that can be used to hybridize to a representation of nucleic acid sequences. Compositions containing the probes such as microarrays are also provided. The invention also provides methods of using these probes and compositions in therapeutic, diagnostic, and research applications. Systems and methods for using a word counting algorithm that can quickly and accurately count the number of times a particular string of characters (i.e., nucleotides) appears in a nucleotide sequence (e.g., a genome) are provided. This algorithm can be used to identify the oligonucleotide probes of the invention. The algorithm uses a transform of a genome and an auxiliary data structure to count the number of times a particular word occurs in the genome.

## Claims

### Claim 1

A plurality of nucleic acid molecules,
wherein:
(a) said plurality consists of N nucleic acid molecules;
(b) each of said plurality of nucleic acid molecules has a nucleotide sequence that hybridizes specifically to a sequence in a genome of Z basepairs; and
(c) at least P % of said plurality of nucleic acid molecules have
(i) a length of K nucleotides;
(ii) hybridizes specifically to at least one nucleic acid molecule present in or predicted to be present in a representation derived from said genome, said representation having no more than R % of the complexity of said genome; and
(iii) no more than X exact matches of L1 nucleotides to said genome and no fewer than Y exact matches of L1 nucleotides to said genome; and
wherein:
(A N≧500;
(B) Z≧1×108;
(C) 300≧K≧30;
(D) 70≧R≧0.001;
(E) P=(N×R+(3×sigma))/N;
(F) sigma is the squareroot of (N×R×(1-R))
(G) the integer closest to (log4(Z)+2)≧L1≧the integer closest to log4(Z);
(H) X is the integer closest to D1×(K−L1+1);
(I) Y is the integer closest to D2×(K−L1+1);
(J) 1.5≧D1≧1; and
(K) 1≧D2≧0.5.

### Claim 2 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein N is selected from the group consisting of at least 500; at least 1,000; at least 2,500; at least 5,000; at least 10,000; at least 25,000; at least 50,000; at least 85,000; at least 190,000; at least 350,000; and at least 550,000 nucleic acid molecules.

### Claim 3 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein Z is selected from the group consisting of at least 3×108, at least 1×109, at least 1×1010 and at least 1×1011.

### Claim 4 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein the genome is a mammalian genome.

### Claim 5 (depends on 4)

The plurality of nucleic acid molecules of claim 4, wherein the genome is a human genome.

### Claim 6 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein R is selected from the group consisting of 0.001, 1, 2, 4, 10, 15, 20, 30, 40, 50 and 70.

### Claim 7 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein P is selected from the group consisting of at least 70, at least 80, at least 90, at least 95, at least 97 and at least 99.

### Claim 8 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein D1 is 1.

### Claim 9 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein D2 is 1.

### Claim 10 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein L1 is selected from the group consisting of 15, 16, 17, 18, 19, 20, 21, 22, 23 and 24.

### Claim 11 (depends on 1)

The plurality of nucleic acid molecules of claim 1,
wherein
each of said P % of said plurality of nucleic acid molecules further have no more than A exact matches of L2 nucleotides to said genome and no fewer than B exact matches of L2 nucleotides to said genome; and
wherein
(a) L1>L2≧the integer closest to log4(Z)−3;
(b) A is the integer closest to D3×((K−L2+1)×(Z/4L2));
(c) B is the integer closest to D4×((K−L2+1)×(Z/4L2));
(d) 4≧D3≧1; and
(e) 1>D4≧0.5.

### Claim 12 (depends on 11)

The plurality of nucleic acid molecules of claim 11, wherein D3≦3, 2, or 1.5.

### Claim 13 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein said P % of said plurality of nucleic acid molecules have at least 91, 92, 93, 94, 95, 96, 97, 98, 99 or 100% sequence identity to at least one nucleic acid molecule present or predicted to be present in said representation.

### Claim 14 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein K is selected from the group consisting of 40, 50, 60, 70, 80, 90, 100, 110, 120, 140, 160, 180, 200 and 250.

### Claim 15

A plurality of nucleic acid molecules,
wherein:
(a) said plurality consists of at least 100 nucleic acid molecules;
(b) each of said plurality of nucleic acid molecules has a nucleotide sequence that is at least 90% identical to a sequence in a genome of at least Z basepairs; and
(c) at least P % of said plurality of nucleic acid molecules have
(i) a length of K nucleotides;
(ii) at least 90% sequence identity to at least one nucleic acid molecule present in or predicted to be present in a representation derived from said genome, said representation having no more than R % of the complexity of said genome; and
(iii) no more than X exact matches of L1 nucleotides to said representation and no fewer than Y exact matches of L1 nucleotides to said representation; and
wherein:
(A) Z≧1×108;
(B) 300≧K≧30;
(C) 70≧R≧0.001;
(D) P≧90−R;
(E) the integer closest to (log4((Z×R)/100)+2)≧L1≧the integer closest to log4((Z×R)/100);
(F) X is the integer closest to D1×(K−L1+1);
(G) Y is the integer closest to D2×(K−L1+1);
(H) 1.5≧D1≧1; and
(I) 1>D2≧0.5.

### Claim 16 (depends on 15)

The plurality of nucleic acid molecules of claim 15, comprising at least 500; at least 1,000; at least 2,500; at least 5,000; at least 10,000; at least 25,000; at least 50,000; at least 85,000; at least 190,000; at least 350,000; or at least 550,000 nucleic acid molecules.

### Claim 17 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein Z is selected from the group consisting of at least 3×108, at least 1×109, at least 1×1010 and at least 1×1011.

### Claim 18 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein the genome is a mammalian genome.

### Claim 19 (depends on 18)

The plurality of nucleic acid molecules of claim 18, wherein the genome is a human genome.

### Claim 20 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein R is selected from the group consisting of 0.001, 1, 2, 4, 10, 15, 20, 30, 40, 50 and 70.

### Claim 21 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein P is selected from the group consisting of at least 70, at least 80, at least 90, at least 95, at least 97 and at least 99.

### Claim 22 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein D1 is 1.

### Claim 23 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein D2 is 1.

### Claim 24 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein L1 is selected from the group consisting of 15, 16, 17, 18, 19, 20, 21, 22, 23 and 24.

### Claim 25 (depends on 15)

The plurality of nucleic acid molecules of claim 15,
wherein
each of said P % of said plurality of nucleic acid molecules further have no more than A exact matches of L2 nucleotides to said genome and no fewer than B exact matches of L2 nucleotides to said genome; and
wherein
(a) L1≧L2≧the integer closest to log4(Z)−3;
(b) A is the integer closest to D3×((K−L2+1)×(Z/4L2));
(c) B is the integer closest to D4×((K−L2+1)×(Z/4L2));
(d) 4≧D3≧1; and
(e) 1>D4≧0.5.

### Claim 26 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein said P % of said plurality of nucleic acid molecules have at least 91, 92, 93, 94, 95, 96, 97, 98, 99 or 100% sequence identity to at least one nucleic acid molecule present or predicted to be present in said representation.

### Claim 27 (depends on 15)

The plurality of nucleic acid molecules of claim 15, wherein K is selected from the group consisting of 40, 50, 60, 70, 80, 90, 100, 110, 120, 140, 160, 180, 200 and 250.

### Claim 28 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein said representation is produced by sequence-specific cleavage of said genome.

### Claim 29 (depends on 28)

The plurality of nucleic acid molecules of claim 28, wherein sequence-specific cleavage is accomplished with a restriction endonuclease.

### Claim 30 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein said representation is a compound representation.

### Claim 31 (depends on 1)

The plurality of nucleic acid molecules of claim 1, wherein said plurality of nucleic acid molecules are immobilized on the surface of a solid phase.

### Claim 32 (depends on 31)

The plurality of nucleic acid molecules of claim 31, wherein said solid phase is selected from the group consisting of a nylon membrane, a nitrocellulose membrane, a glass slide, and a microsphere.

### Claim 33 (depends on 31)

The plurality of nucleic acid molecules of claim 31, wherein the positions of said plurality of nucleic acid molecules on said solid phase are known.

### Claim 34 (depends on 33)

The plurality of nucleic acid molecules of claim 33, wherein said plurality of nucleic acid molecules is on a microarray.

### Claim 35 (depends on 33)

The plurality of nucleic acid molecules of claim 33, wherein said plurality of nucleic acid molecules is immobilized on microspheres.

### Claim 36 (depends on 1)

A method of analyzing a nucleic acid sample, said method comprising:
(a) hybridizing the sample to the plurality of nucleic acid molecules of claim 1; and
(b) determining to which of said plurality of nucleic acid molecules said sample hybridizes.

### Claim 37 (depends on 36)

The method of claim 36, wherein said sample is a representation.

### Claim 38 (depends on 36)

The method of claim 36, wherein said plurality of nucleic acid molecules is immobilized on the surface of a solid phase.

### Claim 39 (depends on 38)

The method of claim 38, wherein said solid phase is selected from the group consisting of a nylon membrane, a nitrocellulose membrane, a glass slide, and a microsphere.

### Claim 40 (depends on 38)

The method of claim 38, wherein the positions of said plurality of nucleic acid molecules on said solid phase are known.

### Claim 41 (depends on 40)

The method of claim 40, wherein said plurality of nucleic acid molecules is on a microarray.

### Claim 42 (depends on 38)

The method of claim 38, wherein said plurality of nucleic acid molecules is immobilized on microspheres.

### Claim 43 (depends on 1, 31)

A method of analyzing copy number variation of a genomic sequence between two genomes, said method comprising:
(a) providing a first genome and a second genome;
(b) preparing detectably labeled representations of each genome using at least one identical restriction enzyme;
(c) contacting said representations with the plurality of nucleic acid molecules of claim 1 or 31 to allow hybridization between the representations and said plurality of nucleic acid molecules; and
(d) comparing levels of the hybridization of said representations, wherein a difference in said levels indicates a copy number variation between the two genomes with regard to a genomic sequence targeted by said member.

### Claim 44 (depends on 43)

The method of claim 43, wherein the two representations are distinguishably labeled.

### Claim 45 (depends on 44)

The method of claim 44, wherein said representations are simultaneously contacted with said plurality of nucleic acid molecules.

### Claim 46 (depends on 1, 31)

A method of comparing methylation status of a genomic sequence between two genomes, said method comprising:
(a) providing a first genome and a second genome;
(b) preparing detectably labeled representations of each genome using at least one identical enzyme, wherein said representations are prepared by a methylation-sensitive method;
(c) contacting said representations with the plurality of nucleic acid molecules of claim 1 or 31 to allow hybridization between the representations and said plurality of nucleic acid molecules; and
(d) comparing levels of the hybridization of said representations, wherein a difference in said levels indicates a difference in methylation status between the two genomes with regard to a genomic sequence targeted by said member.

### Claim 47 (depends on 46)

The method of claim 46, wherein said methylation sensitive method involves preparing a first representation using a first restriction enzyme and a second representation using a second restriction enzyme, wherein said first and second restriction enzymes recognize the same restriction site but one is methylation-sensitive and the other is not.

### Claim 48 (depends on 46)

The method of claim 46, wherein said methylation sensitive method involves chemical cleavage of methyl-C sequences after making a representation with a non-methylation sensitive restriction enzyme, such that a representation derived from a methylated genome is distinguishable from a representation derived from a non-methylated genome.

### Claim 49

A method of identifying an oligonucleotide that has:
(a) a length of K nucleotides;
(b) at least 90% sequence identity to at least one nucleic acid molecule present in or predicted to be present in a representation derived from a genome of at least Z basepairs, and (c) no more than X exact matches of L1 nucleotides to said genome and no fewer than Y exact matches of L1 nucleotides to said genome; wherein:
(i) Z≧1×108;
(ii) 300≧K≧30;
(iii) the integer closest to (log4(Z)+2)≧L1≧the integer closest to log4(Z);
(iv) X is the integer closest to D1×(K−L1+1);
(v) Y is the integer closest to D2×(K−L1+1);
(vi) 1.5≧D1≧1; and
(vii) 1≧D2 ≧0.5;
the method comprising:
(A) cleaving said genome in silico with a restriction enzyme to generate a plurality of predicted nucleic acid molecules,
(B) generating a virtual representation of said genome by identifying predicted nucleic acid molecules each having a length of 200-1,200 basepairs, inclusive;
(C) selecting an oligonucleotide having a length of 30-300 nucleotides, inclusive, and at least 90% sequence identity to a predicted nucleic acid molecule in (B);
(D) identifying all of the stretches of L1 nucleotides occurring in said oligonucleotide; and
(E) confirming that the number of times each of said stretches occurs in said genome satisfies the requirements of (c).

### Claim 50 (depends on 49)

The method of claim 49, wherein (E) comprises:
providing a compressed transform of said genome;
providing an auxiliary data structure that includes information related to said genome; and
determining a word count for the L1 nucleotides using the compressed transform and the auxiliary data structure.

### Claim 51 (depends on 49)

The method of claim 49, wherein (E) comprises:
providing a compressed transform of said genome;
iterating through each nucleotide of said stretch of L1 nucleotides, starting with the last nucleotide and advancing to the first nucleotide one character per iteration, wherein the nucleotide corresponding to a particular iteration is stored as an index nucleotide, said iterating further comprising:
defining a search region that delineates a contiguous range of nucleotides within said transform;
counting the number of times the nucleotide preceding said index nucleotide occurs in said search range; and
wherein said iterating ceases if no occurrences of the nucleotide preceding said index nucleotide occurs in said search range; and
outputting the number of times the first nucleotide of said stretch of L1 nucleotides is counted, this number being equivalent to the number times said stretch of L1 nucleotides appears in said genome.

### Claim 52 (depends on 51)

The method of claim 51, further comprising:
providing an auxiliary data structure, said auxiliary data structure comprising:
a K-intervals data structure that maintains a running total of each nucleotide that has appeared in said transform up to and including a particular predetermined location in said compressed transform; and
a dictionary-counts data structure that provides fast look-up access to the compressed transform; and
wherein said counting and said defining are performed using said auxiliary data structure and said compressed transform.

### Claim 53 (depends on 52)

The method of claim 52, wherein said transform remains compressed while said counting is being performed.

### Claim 54 (depends on 52)

The method of claim 52, wherein said compressed transform is compressed such that every three characters in the uncompressed transform are compressed to form a byte, and wherein said counting uncompresses at most one such byte during one of said iterations.

### Claim 55 (depends on 51)

The method according to claim 51, wherein said genome comprises at least three billion characters.

### Claim 56 (depends on 51)

The method according to claim 51, wherein said compressed transform is a Burrows-Wheeler transform of the genome.

### Claim 57 (depends on 51)

The method according to claim 51, further comprising providing data which is based on said transform, wherein said defining comprises using said data and said index nucleotide to define said search region.

### Claim 58 (depends on 51)

The method according to claim 51, further comprising:
providing data which is based on said transform; and
determining a prior nucleotide count, said prior nucleotide count being the number of times the nucleotide preceding the index nucleotide occurs in said transform before the beginning of said search region;
wherein said defining comprises using said data, said index nucleotide, and said prior nucleotide count to define said search region.

### Claim 59 (depends on 58)

The method according to claim 58, wherein said prior nucleotide count is obtained using K-intervals, said K-intervals being stored at predetermined locations along said transform and maintain a running total of each nucleotide that has appeared in said transform up to and including a particular predetermined location.

### Claim 60 (depends on 49)

A plurality of oligonucleotides each of which produced by the method of claim 49, said plurality comprising at least 500 oligonucleotides.

### Claim 61 (depends on 49)

A plurality of oligonucleotides each of which produced by the method of claim 49, said plurality comprising at least 1,000; at least 2,500; at least 5,000; at least 10,000; at least 25,000; at least 50,000; at least 85,000; at least 190,000; at least 350,000; or at least 550,000 oligonucleotides.
