Granted Patent B2

US 12,437,841 · App. 16/532,077 · Granted Oct 7, 2025

Inventors: Devin Leake (Boston, MA); Swapnil P. Bhatia (Boston, MA); Hyunjun Park (Boston, MA); Nathaniel Roquet (Boston, MA); Graeme Doran (Boston, MA)

Assignee: CATALOG TECHNOLOGIES, INC.

G16B30/00B82Y10/00C12Q1/6869G01N33/48721G06N3/002G11C13/02G16B35/20

Abstract

Claims (32)

1. A method for storing digital information into nucleic acid molecules, the method comprising:

obtaining a plurality of blocks, wherein each block comprises a string of symbols and is associated with a block ID;

assigning a block of the plurality of blocks to a container;

mapping the block to a plurality of identifier nucleic acid sequences to be associated with the container, wherein an individual identifier nucleic acid sequence of the plurality of identifier nucleic acid sequences corresponds to an individual symbol in the string of symbols and comprises a corresponding plurality of component nucleic acid sequences, wherein each component nucleic acid sequence in the plurality of component nucleic acid sequences comprises a distinct nucleic acid sequence;

constructing individual identifier nucleic acid molecules of the plurality of identifier nucleic acid sequences; and

storing the individual identifier nucleic acid molecules in the assigned container, wherein a physical address, comprising the identities of the container and the plurality of identifier nucleic acid sequences associated therewith, is configured to be determined using the associated block ID.

2. The method of claim 1 , wherein the block ID is an integer, a string, a triple, a list of attributes, or a semantic annotation.

3. The method of claim 1 , wherein said physical address is stored in a data structure designed to facilitate access of the physical address using the associated block ID.

4. The method of claim 3 , wherein the data structure is one of a B-tree, a trie, or an array.

5. The method of claim 3 , wherein at least a portion of the data structure is stored along with the digital information in an index.

6. The method of claim 5 , wherein the index is stored in a magnetic storage device, an optical storage device, a flash memory device, or cloud storage.

7. The method of claim 5 , wherein the index comprises a second plurality of identifier nucleic acid sequences associated with a second container.

8. The method of claim 7 , wherein the index comprises a B-tree data structure and each node of the B-tree comprises a distinct plurality of identifier nucleic acid molecules of the second plurality of identifier nucleic acid sequences.

9. The method of claim 8 , wherein searching for the block ID in the B-tree comprises:

(i) selecting the distinct plurality of identifier nucleic acid molecules that comprise a first node;

(ii) reading a value of the first node, and

(iii) repeating the process of steps (i) and (ii) with a subsequent node, wherein the identity of the distinct plurality of identifier nucleic acid molecules that comprise the subsequent node is determined by the block ID in relation to the value of the first node.

10. The method of claim 9 , wherein the first node is the root node of the B-tree and the process of steps (i) and (ii) continues until the value of a leaf node of the B-tree is read, wherein the value of the leaf node is configured to communicate whether the block for the block ID exists, and if the block ID exists, communicate the physical address of said block.

11. The method of claim 7 , wherein said index comprises a trie data structure and each node of the trie comprises a distinct plurality of identifier nucleic acid molecules of the second plurality of identifier nucleic acid sequences.

12. The method of claim 11 , wherein the block ID is a string of symbols and each node in the trie corresponds to a possible prefix of the string of symbols.

13. The method of claim 11 , wherein a leaf node of the trie is configured to store the physical address associated with the block ID that matches the string of symbols specified by the trie in said lead node.

14. The method of claim 7 , wherein the data structure is an array and each element of the array comprises a distinct plurality of identifier nucleic acid molecules of the second plurality of identifier nucleic acid sequences.

15. The method of 14 , wherein each element in the array corresponds to a block ID.

16. The method of claim 15 , wherein each element of the array stores the physical address of the associated block ID.

17. The method of claim 7 , wherein said physical address is natively configured to the block ID.

18. The method of claim 17 , wherein the block ID maps directly to the physical address.

19. The method of claim 18 , wherein the plurality of identifier nucleic acid molecules that stores the associated block are comprised of individual identifier nucleic acid molecules that each comprise said plurality of components.

20. The method of claim 18 , wherein the block ID is a triple of entities that annotate the associated block, and an entity of the triple maps to a plurality of nucleic acid components.

21. The method of claim 20 , wherein the plurality of identifier nucleic acid molecules in the container that comprise individual identifier nucleic acid molecules that comprise said plurality of nucleic acid components store all blocks annotated with said entity.

22. The method of claim 1 , wherein a plurality of identifier nucleic acid molecules is fully comprised of contiguously ordered identifier nucleic acid sequences, such that said plurality of identifier nucleic acid molecules is configured to be specified by an identifier range comprising the identities of the first and last identifiers in said identifier range.

23. The method of claim 22 , wherein the first and last identifiers in said identifier range are represented by integers.

24. The method of claim 1 , further comprising storing bootup and ontology information along with said digital information.

Assignments (3)

Continuity (2)

References Cited (400)