JP-2022531790-A5 -

Dates

Publication Date

20230516

Application Date

20200511

Description

Examples of changes, substitutions, and modifications will be evident to those skilled in the art and may be added without departing from the scope of the information disclosed herein. All references cited herein are incorporated together by reference and constitute part of this application. The present invention provides, for example, the following: (Item 1) A method for obtaining the rank of a particular bit in a bit string from digital information stored in a pool of nucleic acid molecules, wherein each bit has a bit value and a bit position, and the method (a) Obtaining a first pool of identifier nucleic acid molecules representing the bit string, wherein the pool is in the form of a powder, liquid, or solid, and each identifier nucleic acid molecule in the first pool contains a component nucleic acid molecule, and at least a portion of the component nucleic acid molecule is configured to bind to one or more probes; (b) Obtaining a second pool of identifier nucleic acid molecules representing counter symbol strings derived from the bit string, wherein each counter symbol is represented by a string of b counter bits indicating a running count of the number of bits for all w bits in the bit string having a unique bit value, (c) Obtaining a first count by accessing the second pool of (b) having a second set of probes to target at least the identifier nucleic acid molecule in the second pool that represents a corresponding counter symbol indicating the running count of the number of bits of a given value for (1) all blocks of w bits preceding the specific bit, or (2) all blocks of w bits preceding the specific bit, including the block of w bits containing the specific bit; (d) Obtaining a second count by accessing the first pool of (a) having a first set of probes to target one or more distinct identifier nucleic acid molecules in the first pool that (1) represent a bit that is not counted in (c) and precedes or includes the specific bit, or (2) represent a bit that is counted in (c) but does not precede or does not include the specific bit; (e) Obtaining the rank of the specific bit in the bit string from the first count and the second count. A method that includes this. (Item 2) The method according to item 1, wherein the identifier nucleic acid molecule in the first pool represents the bit string such that the presence of the identifier represents the bit value "1" at the bit position. (Item 3) The method of either item 1 or 2, wherein when the first count in (c) represents all blocks of w bits preceding the particular bit, the first series of probes in (d) targets one or more distinct identifier nucleic acid molecules in the first pool representing bits not counted in (c) that precede or include the particular bit, and the rank of the particular bit in the bit string is obtained by summing the first and second counts in (e). (Item 4) The method according to either item 1 or 2, wherein when the first count in (c) represents all blocks of w bits, including the block of w bits that precedes the particular bit and contains the particular bit, the first series of probes targets one or more distinct identifier nucleic acid molecules in the first pool that represent bits counted in (c) but that do not precede the particular bit or do not contain the particular bit, and the rank of the particular bit in the bit string is obtained by subtracting the second count in (e) from the first count. (Item 5) The method according to any one of items 1 to 4, wherein the first count is obtained by reading the counter symbol value corresponding to the targeted identifier nucleic acid molecule in (c). (Item 6) The method according to any one of items 1 to 5, wherein the second count is obtained by reading the targeted identifier nucleic acid molecule from (d). (Item 7) The method according to any one of items 1 to 6, wherein the first pool in (a) is the second pool in (b). (Item 8) The method according to any one of items 1 to 6, wherein the first pool in (a) is separate from the second pool in (b). (Item 9) The method according to any one of items 1 to 8, wherein the presence of a corresponding identifier nucleic acid molecule in the first pool indicates the bit value 1, and the absence of a corresponding identifier nucleic acid molecule in the first pool indicates the bit value 0. (Item 10) The method according to any one of items 1 to 9, wherein the bit string has a length n and b is the upper limit of log 2 (n+1). (Item 11) The method according to item 10, wherein the counter symbol string is represented by a counter bit string having a length corresponding to the value obtained by multiplying b by the upper limit obtained by dividing n by w, and the counter symbol string contains an upper limit of counter symbols obtained by dividing n by w. (Item 12) The method according to any one of items 1 to 11, wherein if the specific bit is within the range of the first block of w bits, the running count preceding the first block