IP Library Granted Patent US 12,236,354
Granted Patent B2
US 12,236,354 · App. 18/647,003 · Granted Feb 25, 2025

Systems for nucleic acid-based data storage

Inventors: Nathaniel Roquet (Boston, MA); Hyunjun Park (Boston, MA); Swapnil P. Bhatia (Boston, MA); Darren R. Link (Boston, MA)
Assignee: CATALOG TECHNOLOGIES, INC.
G06N3/123C12N9/22C12N15/1031C12N15/1089C40B50/06G06F16/2272G06F16/245G11C13/0019G16B30/00G16B30/20G16B50/00G16B99/00C12N2310/20
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,236,354
App. No.
18/647,003
Granted
Feb 25, 2025
Kind
B2
Abstract

Methods and systems for encoding digital information in nucleic acid (e.g., deoxyribonucleic acid) molecules without base-by-base synthesis, by encoding bit-value information in the presence or absence of unique nucleic acid sequences within a pool, comprising specifying each bit location in a bit-stream with a unique nucleic sequence and specifying the bit value at that location by the presence or absence of the corresponding unique nucleic acid sequence in the pool. But, more generally, specifying unique bytes in a bytestream by unique subsets of nucleic acid sequences. Also disclosed are methods for generating unique nucleic acid sequences without base-by-base synthesis using combinatorial genomic strategies (e.g., assembly of multiple nucleic acid sequences or enzymatic-based editing of nucleic acid sequences).

Claims (29)

1. A system for coding digital information into nucleic acid sequence(s), comprising:

an assembly unit configured to generate a nucleic acid library encoding a sequence of symbols using electrowetting, wherein said nucleic acid library comprises at least a subset of a plurality of nucleic acid molecules, the assembly unit comprising a plurality of electrode patches configured to make, combine, mix, and/or split droplets by selectively applying voltage to the electrode patches; and

one or more computer processors operatively coupled to said assembly unit, wherein said one or more computer processors are individually or collectively programmed to (i) code said digital information into a sequence of symbols and convert said sequence of symbols into codewords using one or more codebooks, (ii) parse said codewords into a coded sequence of symbols, (iii) map said coded sequence of symbols to said plurality of nucleic acid molecules, wherein an individual nucleic acid molecule of said plurality of nucleic acid molecules comprises one or more nucleic acid sequences, and (iv) direct said assembly unit to generate an nucleic acid library, wherein each symbol of said coded sequence of symbols is encoded by one or more nucleic acid molecules.

2. The system of claim 1 , wherein said one or more nucleic acid molecules are assembled in one or more assembly reactions.

3. The system of claim 2 , wherein one or more products of said one or more assembly reactions are combined to generate said nucleic acid library.

4. The system of claim 1 , wherein said assembly unit comprises one or more vessels.

5. The system of claim 4 , wherein said one or more vessels are partitions.

6. The system of claim 1 , wherein said assembly unit comprises reagents, one or more layers of components, one or more templates, or any combination thereof.

7. The system of claim 1 , wherein said assembly unit is configured to receive reagents, one or more layer of components, one or more templates, or any combination thereof.

8. The system of claim 1 , wherein said assembly unit is configured to output said nucleic acid library.

9. The system of claim 1 , wherein said assembly unit comprises a reaction module.

10. The system of claim 9 , wherein said reaction module is configured to collect reagents, one or more layers, one or more templates, or any combination thereof.

11. The system of claim 10 , wherein said reagents comprise enzymes, one or more nucleic acid sequences, buffers, co-factors, or any combination thereof.

12. The system of claim 11 , wherein said reagents are combined into a master mix prior to entering said reaction module.

13. The system of claim 9 , wherein said reaction module is configured to incubate or agitate an assembly reaction and wherein said assembly reaction generates said one or more nucleic acid molecules.

14. The system of claim 9 , wherein said reaction module comprises a detector unit and wherein said detector unit monitors assembly of said one or more nucleic acid molecules.

15. The system of claim 1 , further comprising a storage unit and wherein said assembly unit transfers said generated nucleic acid library to said storage unit.

16. The system of claim 15 , wherein said storage unit comprises one or more pools, vessels, or partitions.

17. The system of claim 16 , wherein said storage unit combines one or more nucleic acid libraries into said one or more pools, said one or more vessels, or said one or more partitions.

18. The system of claim 1 , further comprising a selection unit configured to select said one or more nucleic acid molecules.

19. The system of claim 18 , wherein said selection unit comprises a size selection module, an affinity capture module, a nuclease cleavage module, or any combination thereof.

20. The system of claim 1 , wherein said assembly unit generates a plurality of reactions for assembling said one or more nucleic acid molecules.

21. The system of claim 20 , wherein said assembly unit selectively removes individual reactions from said plurality of reactions that do not generate said at least said subset of said plurality of nucleic acid molecules in said nucleic acid library.

22. The system of claim 1 , wherein said one or more computer processors are individually or collectively programmed to use heuristic techniques to minimize a number of reactions to generate said nucleic acid library or to minimize the time it takes to set up a number of reaction to generate said nucleic acid library.

23. The system of claim 22 , wherein said heuristic techniques comprise on-set covering heuristics or heuristics that minimize the traveling path of an apparatus.

24. The system of claim 1 , wherein said one or more computer processors are individually or collectively programmed to direct said assembly unit to generate a plurality of droplets using electrowetting and combine two or more of the plurality of droplets to bring together selected inputs for assembling the nucleic acid molecules.

25. The system of claim 1 , wherein the patches are configured so as to be separated from the droplets by an insulating coating with a low electrical conductivity.

26. The system of claim 1 , wherein said one or more computer processors are individually or collectively programmed to (v) direct said assembly unit to append a description of said one or more codebooks and said plurality of nucleic acid molecules to said nucleic acid library.

27. The system of claim 1 , wherein said nucleic acid library is an identifier library comprising at least a subset of a plurality of identifiers.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 25, 2026
From: CATALOG TECHNOLOGIES, INC.
To: BIOMEMORY AMERICA, LLC
Reel/Frame 075235/0936 →
SECURITY INTEREST Recorded Oct 3, 2025
From: CATALOG TECHNOLOGIES, INC.
To: HANWHA IMPACT NEW TECH LLC
Reel/Frame 072998/0067 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2024
From: ROQUET, NATHANIEL; PARK, HYUNJUN; BHATIA, SWAPNIL P.; LINK, DARREN R.
To: CATALOG TECHNOLOGIES, INC.
Reel/Frame 067433/0042 →
Continuity (6)
Continuation 18230273 · Aug 4, 2023
Continuation 16461774
Provisional Application 62466304 · Mar 2, 2017
Provisional Application 62457074 · Feb 9, 2017
Provisional Application 62423058 · Nov 16, 2016
Related Publication 20250028974A1 · Jan 23, 2025
References Cited (400)
US 5821886A · Son · 1998 [cited by applicant]
US 6187537B1 · Zinn et al. · 2001 [cited by applicant]
US 6221653B1 · Caren et al. · 2001 [cited by applicant]
US 6309828B1 · Schleifer et al. · 2001 [cited by applicant]
US 6384210B1 · Blanchard · 2002 [cited by applicant]
US 6419883B1 · Blanchard · 2002 [cited by applicant]
US 6446642B1 · Caren et al. · 2002 [cited by applicant]
US 6458583B1 · Bruhn et al. · 2002 [cited by applicant]
US 6537747B1 · Mills et al. · 2003 [cited by applicant]
US 6796634B2 · Caren et al. · 2004 [cited by applicant]
US 7176297B2 · Li et al. · 2007 [cited by applicant]
US 7306316B2 · Doak · 2007 [cited by applicant]
US 7491422B2 · Zhang et al. · 2009 [cited by applicant]
US 7600840B2 · Kim et al. · 2009 [cited by applicant]
US 7802517B2 · Wessels et al. · 2010 [cited by applicant]
US 7833701B2 · Oshima · 2010 [cited by applicant]
US 7909427B2 · Kim et al. · 2011 [cited by applicant]
US 7951334B2 · Mirkin et al. · 2011 [cited by applicant]
US 8071168B2 · Cruchon-Dupeyrat · 2011 [cited by applicant]
US 8114207B2 · Sylvain et al. · 2012 [cited by applicant]
US 8136936B2 · Josten · 2012 [cited by applicant]
US 8496326B2 · Hook et al. · 2013 [cited by applicant]
US 8735327B2 · Macula · 2014 [cited by applicant]
US 8769689B2 · Hoglund · 2014 [cited by applicant]
US 8806127B2 · Brownell et al. · 2014 [cited by applicant]
US 8835358B2 · Fodor et al. · 2014 [cited by applicant]
US 8856940B2 · Kencl et al. · 2014 [cited by applicant]
US 8937564B2 · Aloni et al. · 2015 [cited by applicant]
US 9061494B2 · Rogers et al. · 2015 [cited by applicant]
US 9062218B2 · Oshima et al. · 2015 [cited by applicant]
US 9187777B2 · Jacobson et al. · 2015 [cited by applicant]
US 9266370B2 · Jung et al. · 2016 [cited by applicant]
US 9317664B2 · Ahuja et al. · 2016 [cited by applicant]
US 9384320B2 · Church · 2016 [cited by applicant]
US 9403180B2 · Ha et al. · 2016 [cited by applicant]
US 9487002B2 · Rogers et al. · 2016 [cited by applicant]
US 9616661B2 · Pierik et al. · 2017 [cited by applicant]
US 9679030B2 · Hatami-Hanza · 2017 [cited by applicant]
US 9684678B2 · Hatami-Hanza · 2017 [cited by applicant]
US 9774351B2 · Huetter et al. · 2017 [cited by applicant]
US 9830553B2 · Chen et al. · 2017 [cited by applicant]
US 9904734B2 · Murrah et al. · 2018 [cited by applicant]
US 9928869B2 · Church · 2018 [cited by applicant]
US 9996778B2 · Church · 2018 [cited by applicant]
US 10020826B2 · Gladwin et al. · 2018 [cited by applicant]
US 10027347B2 · Le et al. · 2018 [cited by applicant]
US 10047235B2 · Wilsher et al. · 2018 [cited by applicant]
US 10050959B2 · Soon-Shong et al. · 2018 [cited by applicant]
US 10287573B2 · Macula · 2019 [cited by applicant]
US 10289801B2 · Church · 2019 [cited by applicant]
US 10370246B1 · Milenkovic et al. · 2019 [cited by applicant]
US 10387301B2 · Goldman et al. · 2019 [cited by applicant]
US 10417457B2 · Peck · 2019 [cited by applicant]
US 10423341B1 · Kermani · 2019 [cited by applicant]
US 10438662B2 · Predki · 2019 [cited by applicant]
US 10460220B2 · Church · 2019 [cited by applicant]
US 10566077B1 · Milenkovic et al. · 2020 [cited by applicant]
US 10640822B2 · Predki et al. · 2020 [cited by applicant]
US 10650312B2 · Roquet et al. · 2020 [cited by applicant]
US 10669558B2 · Ganjam · 2020 [cited by applicant]
US 10742233B2 · Erlich · 2020 [cited by applicant]
US 10754994B2 · Peck · 2020 [cited by applicant]
US 10774379B2 · Chen et al. · 2020 [cited by applicant]
US 10787699B2 · Chen et al. · 2020 [cited by applicant]
US 10793897B2 · Chen et al. · 2020 [cited by applicant]
US 10818378B2 · Hutchison, III et al. · 2020 [cited by applicant]
US 10838939B2 · Walder et al. · 2020 [cited by applicant]
US 10839295B2 · Shen et al. · 2020 [cited by applicant]
US 10853244B2 · Petti et al. · 2020 [cited by applicant]
US 10860562B1 · Gupta et al. · 2020 [cited by applicant]
US 10883140B2 · Church et al. · 2021 [cited by applicant]
US 10902939B2 · Merriman et al. · 2021 [cited by applicant]
US 10917109B1 · Dimopoulou et al. · 2021 [cited by applicant]
US 10929039B2 · Kwon et al. · 2021 [cited by applicant]
US 10936953B2 · Peck et al. · 2021 [cited by applicant]
US 10956806B2 · Masuda et al. · 2021 [cited by applicant]
US 10982276B2 · Efcavitch et al. · 2021 [cited by applicant]
US 11066661B2 · Rausch et al. · 2021 [cited by applicant]
US 11093547B2 · Su et al. · 2021 [cited by applicant]
US 11093865B2 · Rubenstein et al. · 2021 [cited by applicant]
US 11100404B2 · Merriman et al. · 2021 [cited by applicant]
US 11162950B2 · Pfeiffer et al. · 2021 [cited by applicant]
US 11164190B2 · Pfeiffer et al. · 2021 [cited by applicant]
US 11174512B2 · Efcavitch et al. · 2021 [cited by applicant]
US 11263354B2 · Peck · 2022 [cited by applicant]
US 11308055B2 · Walder et al. · 2022 [cited by applicant]
US 11326161B2 · Church et al. · 2022 [cited by applicant]
US 11339423B2 · Bishop et al. · 2022 [cited by applicant]
US 11365411B2 · Chen et al. · 2022 [cited by applicant]
US 11435905B1 · Bahram · 2022 [cited by applicant]
US 11485965B2 · Strauss et al. · 2022 [cited by applicant]
US 11495324B2 · Yekhanin et al. · 2022 [cited by applicant]
US 11507135B2 · Cheung et al. · 2022 [cited by applicant]
US 11538554B1 · Milenkovic · 2022 [cited by applicant]
US 11643647B2 · Rausch et al. · 2023 [cited by applicant]
US 11651836B2 · Strauss et al. · 2023 [cited by applicant]
US 11702689B2 · Chen et al. · 2023 [cited by applicant]
US 11704575B2 · Strauss et al. · 2023 [cited by applicant]
US 11720801B2 · Nakamura et al. · 2023 [cited by applicant]
US 11755922B2 · Milenkovic et al. · 2023 [cited by applicant]
US 11783918B2 · Strauss et al. · 2023 [cited by applicant]
US 11837302B1 · Predki · 2023 [cited by applicant]
US 11854668B2 · Hayes et al. · 2023 [cited by applicant]
US 11854669B1 · Bachand · 2023 [cited by applicant]
US 11873484B2 · Chen et al. · 2024 [cited by applicant]
US 11892945B2 · Goldman et al. · 2024 [cited by applicant]
US 11900191B2 · Church · 2024 [cited by applicant]
US 11923004B2 · Predki et al. · 2024 [cited by applicant]
US 11931713B2 · Horton et al. · 2024 [cited by applicant]
US 11943940B2 · Hihath et al. · 2024 [cited by applicant]
US 11961008B2 · Bathe et al. · 2024 [cited by applicant]
US 11970696B1 · Haupt et al. · 2024 [cited by applicant]
US 11928603B2 · Ceze et al. · 2024 [cited by applicant]
US 11989216B2 · Ceze et al. · 2024 [cited by applicant]
US 11990184B2 · Mendonsa et al. · 2024 [cited by applicant]
US 12009062B2 · Ceze et al. · 2024 [cited by applicant]
US 12040055B2 · Vishwakarma et al. · 2024 [cited by applicant]
US 12046329B2 · Makarychev · 2024 [cited by applicant]
US 12056264B2 · Peck · 2024 [cited by applicant]
US 20030116630A1 · Carey et al. · 2003 [cited by applicant]
US 20040043390A1 · Stadler · 2004 [cited by examiner]
US 20040244623A1 · Hayashizaki · 2004 [cited by applicant]
US 20050019760A1 · Southern · 2005 [cited by applicant]
US 20050166782A2 · Hayashizaki · 2005 [cited by applicant]
US 20050243618A1 · Boland · 2005 [cited by applicant]
US 20060263534A1 · Laurent et al. · 2006 [cited by applicant]
US 20080252679A1 · Pierik et al. · 2008 [cited by applicant]
US 20080269152A1 · Verdine et al. · 2008 [cited by applicant]
US 20080303870A1 · Verbeek et al. · 2008 [cited by applicant]
US 20080309701A1 · Pierik et al. · 2008 [cited by applicant]
US 20090023607A1 · Rozhok et al. · 2009 [cited by applicant]
US 20090033690A1 · Pierik et al. · 2009 [cited by applicant]
US 20090062129A1 · McKernan · 2009 [cited by applicant]
US 20090253141A1 · Quake · 2009 [cited by applicant]
US 20100029490A1 · Pierik et al. · 2010 [cited by applicant]
US 20100056381A1 · Kurt et al. · 2010 [cited by applicant]
US 20110195850A1 · Rozhok et al. · 2011 [cited by applicant]
US 20110312779A1 · Silverbrook et al. · 2011 [cited by applicant]
US 20110312782A1 · Azimi et al. · 2011 [cited by applicant]
US 20110312847A1 · Silverbrook et al. · 2011 [cited by applicant]
US 20110312851A1 · Silverbrook et al. · 2011 [cited by applicant]
US 20110312853A1 · Azimi et al. · 2011 [cited by applicant]
US 20110312855A1 · Silverbrook et al. · 2011 [cited by applicant]
US 20110312856A1 · Silverbrook et al. · 2011 [cited by applicant]
US 20120164396A1 · Mirkin et al. · 2012 [cited by applicant]
US 20120329561A1 · Evans et al. · 2012 [cited by applicant]
US 20130231254A1 · Kawashima et al. · 2013 [cited by applicant]
US 20130233709A1 · Dunbar · 2013 [cited by applicant]
US 20130253839A1 · Friedlander · 2013 [cited by applicant]
US 20140065609A1 · Hicks et al. · 2014 [cited by applicant]
US 20140296087A1 · Verdine et al. · 2014 [cited by applicant]
US 20140371100A1 · Kawashima et al. · 2014 [cited by applicant]
US 20150083797A1 · Tran et al. · 2015 [cited by applicant]
US 20150261664A1 · Goldman et al. · 2015 [cited by applicant]
US 20150269313A1 · College · 2015 [cited by applicant]
US 20150312212A1 · Holmes et al. · 2015 [cited by applicant]
US 20150363550A1 · Green et al. · 2015 [cited by applicant]
US 20160007893A1 · Roberts · 2016 [cited by applicant]
US 20160051985A1 · Knight et al. · 2016 [cited by applicant]
US 20160168579A1 · Hutchinson et al. · 2016 [cited by applicant]
US 20160258939A1 · Morin · 2016 [cited by applicant]
US 20160304948A1 · Lee · 2016 [cited by applicant]
US 20160371434A1 · Strauss · 2016 [cited by applicant]
US 20170017436A1 · Church · 2017 [cited by applicant]
US 20170021611A1 · Jung et al. · 2017 [cited by applicant]
US 20170060924A1 · Fitzhardinge · 2017 [cited by applicant]
US 20170081716A1 · Peck · 2017 [cited by applicant]
US 20170093851A1 · Allen · 2017 [cited by applicant]
US 20170109229A1 · Huetter · 2017 [cited by applicant]
US 20170136452A1 · Niles et al. · 2017 [cited by applicant]
US 20170140095A1 · Kim · 2017 [cited by applicant]
US 20170151545A1 · Horton et al. · 2017 [cited by applicant]
US 20170175170A1 · Chen · 2017 [cited by applicant]
US 20170218228A1 · Jose et al. · 2017 [cited by applicant]
US 20170355982A1 · Derda et al. · 2017 [cited by applicant]
US 20170363953A1 · Steinhart et al. · 2017 [cited by applicant]
US 20180068060A1 · Ceze et al. · 2018 [cited by applicant]
US 20180086781A1 · Liss · 2018 [cited by applicant]
US 20180101487A1 · Peck · 2018 [cited by applicant]
US 20180121478A1 · Walder et al. · 2018 [cited by applicant]
US 20180137418A1 · Roquet et al. · 2018 [cited by applicant]
US 20180173710A1 · Maftuleac et al. · 2018 [cited by applicant]
US 20180173738A1 · Lopez-Ortiz et al. · 2018 [cited by applicant]
US 20180253563A1 · Peck et al. · 2018 [cited by applicant]
US 20190020651A1 · Soon-Shiong et al. · 2019 [cited by applicant]
US 20190040458A1 · Su et al. · 2019 [cited by applicant]
US 20190136307A1 · Predki · 2019 [cited by applicant]
US 20190138909A1 · Shen et al. · 2019 [cited by applicant]
US 20190142882A1 · Shepherd · 2019 [cited by applicant]
US 20190271032A1 · Owen · 2019 [cited by applicant]
US 20190325040A1 · Sagi · 2019 [cited by applicant]
US 20190344239A1 · Efcavitch et al. · 2019 [cited by applicant]
US 20190351673A1 · Roquet et al. · 2019 [cited by applicant]
US 20190355442A1 · Merriman · 2019 [cited by applicant]
US 20190383788A1 · Predki · 2019 [cited by applicant]
US 20200076798A1 · Lidsky · 2020 [cited by applicant]
US 20200185057A1 · Leake et al. · 2020 [cited by applicant]
US 20200193301A1 · Roquet et al. · 2020 [cited by applicant]
US 20200242482A1 · Merriman et al. · 2020 [cited by applicant]
US 20200357483A1 · Roquet et al. · 2020 [cited by applicant]
US 20210010065A1 · Salk · 2021 [cited by applicant]
US 20210050073A1 · Chen et al. · 2021 [cited by applicant]
US 20210074380A1 · Yekhanin · 2021 [cited by applicant]
US 20210108194A1 · Roquet et al. · 2021 [cited by applicant]
US 20210210171A1 · Stirparo et al. · 2021 [cited by applicant]
US 20210332426A1 · Puddu et al. · 2021 [cited by applicant]
US 20210348214A1 · Roquet et al. · 2021 [cited by applicant]
US 20210363570A1 · Mok et al. · 2021 [cited by applicant]
US 20220005870A1 · Hihath et al. · 2022 [cited by applicant]
US 20220012646A1 · Rubenstein et al. · 2022 [cited by applicant]
US 20220028497A1 · Keung et al. · 2022 [cited by applicant]
US 20220090157A1 · Mendonsa et al. · 2022 [cited by applicant]
US 20220179891A1 · Ceze et al. · 2022 [cited by applicant]
US 20220282243A1 · Chen et al. · 2022 [cited by applicant]
US 20220364991A1 · Wanunu et al. · 2022 [cited by applicant]
US 20220389483A1 · Chen et al. · 2022 [cited by applicant]
US 20230027270A1 · Rubenstein et al. · 2023 [cited by applicant]
US 20230073209A1 · Bathe et al. · 2023 [cited by applicant]
US 20230089824A1 · Diamanti et al. · 2023 [cited by applicant]
US 20230153452A1 · Peck et al. · 2023 [cited by applicant]
US 20230161995A1 · Masuda et al. · 2023 [cited by applicant]
US 20230185971A1 · Peck · 2023 [cited by applicant]
US 20230193383A1 · Peck · 2023 [cited by applicant]
US 20230207001A1 · Predki et al. · 2023 [cited by applicant]
US 20230215516A1 · Arsian et al. · 2023 [cited by applicant]
US 20230230636A1 · Gu et al. · 2023 [cited by applicant]
US 20230245720A1 · Strauss et al. · 2023 [cited by applicant]
US 20230257788A1 · Chen et al. · 2023 [cited by applicant]
US 20230257789A1 · Chen et al. · 2023 [cited by applicant]
US 20230274793A1 · Chen et al. · 2023 [cited by applicant]
US 20230279485A1 · Predki et al. · 2023 [cited by applicant]
US 20230281112A9 · Goldman et al. · 2023 [cited by applicant]
US 20230324822A1 · Keung et al. · 2023 [cited by applicant]
US 20230395198A1 · Strauss et al. · 2023 [cited by applicant]
US 20230419331A1 · Owen et al. · 2023 [cited by applicant]
US 20240011076A1 · Grass et al. · 2024 [cited by applicant]
US 20240035018A1 · Roselle et al. · 2024 [cited by applicant]
US 20240071574A1 · Bradl et al. · 2024 [cited by applicant]
US 20240095543A1 · Bar-Lev et al. · 2024 [cited by applicant]
US 20240132947A1 · Chiozzi · 2024 [cited by applicant]
US 20240152629A1 · Deshpande et al. · 2024 [cited by applicant]
US 20240168676A1 · Avraham et al. · 2024 [cited by applicant]
US 20240176733A1 · Avraham et al. · 2024 [cited by applicant]
US 20240182871A1 · Shepherd · 2024 [cited by applicant]
US 20240184666A1 · Oboukhov et al. · 2024 [cited by applicant]
US 20240185021A1 · Zamir et al. · 2024 [cited by applicant]
US 20240185959A1 · Oboukhov et al. · 2024 [cited by applicant]
US 20240193037A1 · Avraham · 2024 [cited by applicant]
US 20240201198A1 · Marcotte et al. · 2024 [cited by applicant]
US 20240229017A1 · Haupt et al. · 2024 [cited by applicant]
US 20240254548A1 · Strauss et al. · 2024 [cited by applicant]
US 20240266000A1 · Lee et al. · 2024 [cited by applicant]
EP 1512749 · 2005 [cited by applicant]
EP 2329425 · 2013 [cited by applicant]
EP 2983297 · 2016 [cited by applicant]
EP 3067809 · 2016 [cited by applicant]
EP 2856375 · 2018 [cited by applicant]
EP 3346404 · 2018 [cited by applicant]
EP 3810773 · 2024 [cited by applicant]
JP 2009244996 · 2009 [cited by applicant]
WO WO03025123 · 2003 [cited by applicant]
WO WO2004009844 · 2004 [cited by applicant]
WO WO2006055943 · 2006 [cited by applicant]
WO WO2007135354 · 2007 [cited by applicant]
WO WO2012058638 · 2012 [cited by applicant]
WO WO2014014991 · 2014 [cited by applicant]
WO WO2015144858 · 2015 [cited by applicant]
WO WO2016015701 · 2016 [cited by applicant]
WO WO2016059610 · 2016 [cited by applicant]
WO WO2016081834 · 2016 [cited by applicant]
WO WO2016164779 · 2016 [cited by applicant]
WO WO2016182814 · 2016 [cited by applicant]
WO WO2017151195 · 2017 [cited by applicant]
WO WO2017189914 · 2017 [cited by applicant]
WO WO2017190297 · 2017 [cited by applicant]
WO WO2017192633 · 2017 [cited by applicant]
WO WO2018017131 · 2018 [cited by applicant]
WO WO2018049272 · 2018 [cited by applicant]
WO WO2018094108 · 2018 [cited by applicant]
WO WO2018094115 · 2018 [cited by applicant]
WO WO2018132457 · 2018 [cited by applicant]
WO WO2018148260 · 2018 [cited by applicant]
WO WO2018148458 · 2018 [cited by applicant]
WO WO2018213856 · 2018 [cited by applicant]
WO WO2019046768 · 2019 [cited by applicant]
WO WO2019053443 · 2019 [cited by applicant]
WO WO2019081145 · 2019 [cited by applicant]
WO WO2019178551 · 2019 [cited by applicant]
WO WO2019195479 · 2019 [cited by applicant]
WO WO2019222561 · 2019 [cited by applicant]
WO WO2019224544 · 2019 [cited by applicant]
WO WO2019246434 · 2019 [cited by applicant]
WO WO2020014478 · 2020 [cited by applicant]
WO WO2020028912 · 2020 [cited by applicant]
WO WO2020128517 · 2020 [cited by applicant]
WO WO2020132935 · 2020 [cited by applicant]
WO WO2020239806 · 2020 [cited by applicant]
WO WO2021108117 · 2021 [cited by applicant]
WO WO2022055885 · 2022 [cited by applicant]
WO WO2023026039 · 2023 [cited by applicant]
WO WO2024020395 · 2024 [cited by applicant]
WO WO2024163733 · 2024 [cited by applicant]
WO WO2024173908 · 2024 [cited by applicant]
US 11,667,940 B2, 06/2023, Nguyen et al. (withdrawn) [cited by applicant]
Scott E. Osborne et al., “Nucleic Acid Selection and the Challenge of Combinatorial Chemistry,” 1997, American Chemical Society, pp. 349-370. (Year: 1997). [cited by examiner]
U.S. Appl. No. 15/850,112, filed Dec. 21, 2017. [cited by applicant]
U.S. Appl. No. 16/847,064, filed Apr. 13, 2020. [cited by applicant]
U.S. Appl. No. 17/007,946, filed Aug. 31, 2020. [cited by applicant]
U.S. Appl. No. 18/230,382, filed Aug. 4, 2023. [cited by applicant]
U.S. Appl. No. 18/230,383, filed Aug. 4, 2023. [cited by applicant]
U.S. Appl. No. 18/230,385, filed Aug. 4, 2023. [cited by applicant]
U.S. Appl. No. 16/461,774, filed May 16, 2019. [cited by applicant]
U.S. Appl. No. 18/230,273, filed Aug. 4, 2023. [cited by applicant]
U.S. Appl. No. 17/012,909, filed Sep. 4, 2020. [cited by applicant]
U.S. Appl. No. 17/674,170, filed Feb. 17, 2022. [cited by applicant]
U.S. Appl. No. 18/230,296, filed Aug. 4, 2023. [cited by applicant]
U.S. Appl. No. 16/414,758, filed May 16, 2019. [cited by applicant]
U.S. Appl. No. 17/206,803, filed Mar. 19, 2021. [cited by applicant]
U.S. Appl. No. 16/532,077, filed Aug. 5, 2019. [cited by applicant]
U.S. Appl. No. 17/206,886, filed Mar. 19, 2021. [cited by applicant]
U.S. Appl. No. 16/872,129, filed May 11, 2020. [cited by applicant]
U.S. Appl. No. 18/107,851, filed Feb. 9, 2023. [cited by applicant]
U.S. Appl. No. 18/646,997, filed Apr. 26, 2024. [cited by applicant]
U.S. Appl. No. 17/069,420, filed Oct. 13, 2020. [cited by applicant]
U.S. Appl. No. 17/989,925, filed Nov. 18, 2022. [cited by applicant]
U.S. Appl. No. 17/317,547, filed May 11, 2021. [cited by applicant]
U.S. Appl. No. 17/693,705, filed Mar. 14, 2022. [cited by applicant]
U.S. Appl. No. 18/024,909, filed Mar. 6, 2023. [cited by applicant]
U.S. Appl. No. 18/027,524, filed Mar. 21, 2023. [cited by applicant]
U.S. Appl. No. 18/282,825, filed Sep. 19, 2023. [cited by applicant]
U.S. Appl. No. 17/990,255, filed Nov. 18, 2022. [cited by applicant]
U.S. Appl. No. 16/461,774, filed Sep. 18, 2024. [cited by applicant]
Al'Khafaji, A., et al., “High-throughput RNA isoform sequencing using programmable cDNA concatenation”, bioRxiv, https://doi.org/10.1101/2021.10.01.462818; Oct. 1, 2021, 18 pgs. [cited by applicant]
Al'Khafaji, A., et al., “High-throughput RNA isoform sequencing using programmed cDNA concatenation”, Nature Biotechnology, Jun. 8, 2023, 16 pgs. [cited by applicant]
Boneh, D., et al., “Breaking DES Using a Molecular Computer,” in DIMACS Workshop on DNA Computing, 1995. [cited by applicant]
Bonnet et al., “Rewritable digital data storage in live cells via engineered control of recombination directionality,” Proceeding of the National Academy of Sciences, vol. 109(23): 8884-8889 (2012). [cited by applicant]
Bornholt et al., “A DNA-Based Archival Storage System,” International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Apr. 2-6, 2016, Atlanta, GA, 637-649. [cited by applicant]
Braich RS, et al., “Solution of a 20-variable 3-SAT problem on a DNA computer”. Science. Apr. 19, 2002;296(5567):499-502. doi: 10.1126/science.1069528. Epub Mar. 14, 2002. PMID: 11896237. [cited by applicant]
Burks et al., “The GenBank Nucleic Acid Sequence Database,” Cabios Review, vol. 1(4): 225-233 (1985). [cited by applicant]
Buschmann, et al., “Levenshtein Error-Correcting Barcodes for Multiplexed DNA Sequencing”, BMC Bioinformatics, vol. 14, No. 1., pp. 1-10 (2013). [cited by applicant]
Bystrykh, et al., “Generalized DNA Barcode Design Based on Hamming Codes”, Plos One, vol. 7, No. 5, pp. 1-8, (May 2012). [cited by applicant]
Casini, A. “Advanced DNA assembly strategies and standards for synthetic biology,” Thesis, Department of Life Sciences, Imperial College London: 1-178 (2014). [cited by applicant]
Clarke, et al., “Continuous base identification for single-molecule nanopore DNA sequencing” Nature Nanotechnology, vol. 4, pp. 265-270, (2009). [cited by applicant]
Click chemistry—Wikipedia, Wikipedia, Apr. 11, 2017, pp. 1-11; XP093142494, Retrieved from the Internet: URL:https://web.archive.org/web/20171104103152/https://en.wikipedia.org/wiki/Click_chemistry#Potential_application… [cited by applicant]
Craig, et al., “Ordering of Cosmid Clones covering the Herpes Simplex Virus Type 1 (HSV-1) genome: a test case for fingerprinting by hybridisation”, Nucleic Acids Research, vol. 18, pp. 2653-2660 (1990). [cited by applicant]
Cui, M., et al., “Nonlinear manipulation and analysis of large DNA datasets”, Nucleic Acids Research, vol. 50, No. 15 , Aug. 10, 2022, pp. 8974-8985. [cited by applicant]
De Silva, et al., “New Trends of Digital Data Storage in DNA”, BioMed Research International, vol. 2016, Article ID 8072463, 14 pages (Sep. 5, 2016) ps. 14. [cited by applicant]
Deorowicz et al., “Data compression for sequencing data,” Algorithms for Molecular Biology, vol. 8(25): 1-13 (2013). [cited by applicant]
Design & Analysis of Algorithms, Lecture #25: Burrows-Wheeler Transform, pp. 1-8 (Year: 2018). [cited by applicant]
El-Sagheer, A., et al., “Click Nucleic Acid Ligation: Applications in Biology and Nanotechnology”, Accounts of Chemical Research, vol. 45, No. 8, pp. 1258-1267. Dec. 12, 2011. [cited by applicant]
Engler et al., “A One Pot, One Step, Precision Cloning Method with High Throughput Capability,” PLoS ONE, vol. 3(11): E3647 (2008) printed as pp. 1-7. [cited by applicant]
Engler et al., “Chapter 12: Combinatorial DNA Assembly Using Golden Gate Cloning,” Karen M. Polizzi and Cleo Kontoravadi (eds.), Synthetic Biology, Methods in Molecular Biology, vol. 1073 , Springer Science+Business Med… [cited by applicant]
Erciyes, K., Distributed and Sequential Algorithms for Bioinformatics, Computational Biology, 2015, 23, Springer, Ed. A. Dress, 1-133. (Year: 2015). [cited by applicant]
Extended European Search Report for EP Application No. 17872172.6 dated Oct. 27, 2020 (10 pgs). [cited by applicant]
Supplementary European Search Report for EP Application No. 17872574.3 dated Sep. 14, 2020 (2 pgs). [cited by applicant]
Fogg et al., “New Applications for Phage Integrases,” Journal of Molecular Biology, vol. 426(15): 2703-2716 (2014). [cited by applicant]
Gardner, et al., “Acyclic and dideoxy terminator preferences denote divergent sugar recognition by archaeon and Taq DNA polymerases”, Nucleic Acids Res. Jan. 15, 2002;30(2):605-13. [cited by applicant]
Goldman et al., “Towards practical, high-capacity, low-maintenance information storage in synthesized DNA,” Nature, vol. 494: 77-80 (2013). [cited by applicant]
Kivioja et al., “Counting absolute Nos. of molecules using unique molecular identifiers,” Nature Methods, vol. 9(1): 72-74 (2011), including pp. 1-2 of Online Methods, and pp. 1-14 of Supplementary Information. [cited by applicant]
Lahr, et al., “Reducing the impact of PCR-mediated recombination in molecular evolution and environmental studies using a new-generation high-fidelity DNA polymerase”, Biotechniques. Oct. 2009;47(4):857-66. [cited by applicant]
Langmead, Ben, Introduction to the Burrows-Wheeler Transform and FM Index, Department of Computer Science, JHU, pp. 1-12; Nov. 24, 2013. [cited by applicant]
Lee, et al, “Enzymatic DNA synthesis for digital information storage”, bioRxiv, XP055603868, DOI: 10.1101/348987 Retrieved from the Internet: URL:https://www.biorxiv.org/content/biorxiv/early/2018/06/16/348987.full.pdf … [cited by applicant]
Lee et al, “DNA detection using commercial mobile phones”, Biosensors and Bioelectronics, 2011, 26, 4349-4354 (Year: 2011). [cited by applicant]
Lee, et al., “Terminator-free template-independent enzymatic DNA synthesis for digital information storage”, Nat Commun. Jun. 3, 2019;10(1): 12 pages. [cited by applicant]
Leier et al., “Cryptography with DNA binary strands,” Biosystems, vol. 57: 13-22 (2000). [cited by applicant]
Li, H., et al., “Fast and accurate short read alignment with Burrows-Wheeler transform”, Bioinformatics, vol. 25, Issue 14, pp. 1754-1760, Jul. 2009, https://doi.org/10.1093/bioinformatics/btp324 (Year: 2009). [cited by applicant]
Ligation (molecular biology) Wikipedia, Wikipedia, Oct. 10. 2016, pp. 1-5; XP093142492, Retrieved from the Internet: URL:https://web.archive.org/web/20161010083548/https://en.wikipedia.org/wiki/Ligation_(molecular_biolo… [cited by applicant]
Lipton RJ., “DNA solution of hard computational problems”, Science. Apr. 28, 1995;268(5210):542-5. doi: 10.1126/science.7725098. PMID: 7725098. [cited by applicant]
Navarro, et al., “Compressed Full-Text Indexes”, ACM Computing Surveys, ACM, New York, NY, vol. 39, No. Apr. 1, 12, 2007. [cited by applicant]
Nour-Eldin, H., et al., “Advancing uracil-excision based cloning towards an ideal technique for cloning PCR fragments”, Nucleic Acids Research, 2006, vol. 34, No. 18, Sep. 26, 2006, 8 pgs. [cited by applicant]
Organick, et al., “Random access in large-scale DNA data storage”, Nature Biotechnology, 36(3): 242-248, (2018). [cited by applicant]
Patrick, et al., DNA Assembly in 3D Printed Fluidics, PLOS One, 10(12): e014636 18 pages (2015). [cited by applicant]
PCT/US2017/062098 International Search Report and Written Opinion dated, Mar. 14, 2018 (20 pgs). [cited by applicant]
PCT/US2017/062106 International Search Report and Written Opinion dated, Feb. 22, 2018 (8 pgs). [cited by applicant]
PCT/US2019/022596 International Search Report and Written Opinion dated, Jun. 28, 2019 (14 pgs). [cited by applicant]
PCT/US2019/032756 International Search Report and Written Opinion dated, Sep. 4, 2019 (23 pgs). [cited by applicant]
PCT/US2019/045160 International Search Report and Written Opinion dated, Jan. 30, 2020 (19 pgs). [cited by applicant]
PCT/US2020/032384 International Search Report and Written Opinion dated, Jul. 30, 2020 (20 pgs). [cited by applicant]
PCT/US2020/055351 International Search Report and Written Opinion dated, Mar. 31, 2021 (20 pgs). [cited by applicant]
PCT/US2021/031865 International Search Report and Written Opinion dated, Aug. 13, 2021 (21 pgs). [cited by applicant]
PCT/US2021/049289 International Search Report and Written Opinion dated, Nov. 18, 2021 (13 pgs). [cited by applicant]
PCT/US2022/020949 International Search Report and Written Opinion dated, Jun. 23, 2022 (10 pgs). [cited by applicant]
PCT/US2022/050435 International Search Report and Written Opinion dated, May 11, 2023 (18 pgs). [cited by applicant]
PCT/US2023/15495 International Search Report and Written Opinion dated, May 23, 2023 (13 pgs). [cited by applicant]
Quetier et al., “The CRISPR-Cas9 technology: Closer to the ultimate toolkit for targeted genome editing,” Plant Science, vol. 242: 65-76 (2015). [cited by applicant]
Roquet, et al, “DNA-based data storage via combinatorial assembly”, bioRxiv 2021.04.20.440194; doi: https://doi.org/10.1101/2021.04.20.440194, Apr. 20, 2021, (15 pgs). [cited by applicant]
Roquet et al., “Synthetic recombinase-based state machines in living cells,” Science, vol. 353(6297): 363, aad8559-1-aad8559-13 (2016). [cited by applicant]
Sands, et al, “Overview of Post Cohen-Boyer Methods for Single Segment Cloning and for Multisegment DNA Assembly,” Current Protocols in Molecular Biology, vol. 113: 3.26.1-3.26-20 (2016). [cited by applicant]
Schlecht, U., et al., “ConcatSeq: A method for increasing throughput of single molecule sequencing by concatenating short DNA fragments”, Scientific Reports, Jul. 12, 2017, 10 pgs. [cited by applicant]
Sorek et al., “CRISPR-Mediated Adaptive Immune Systems in Bacteria and Archaea,” Annual Review of Biochemistry, vol. 82: 237-266 (2013). [cited by applicant]
Staden, R., “Nucleic Acids Research—Sequence Data Handling by Computer,” vol. 4(11): 4037-4052 (1977). [cited by applicant]
Staden, R., “Computer Methods to Locate Signals in Nucleic Acid Sequences”, Nucleic Acids Research, vol. 12, No., 1, Part 2, Jan. 11, 1984 (505-519). [cited by applicant]
Staden, R., “An Interactive Graphics Program for Comparing and Aligning Nucleic Acid and Amino Acid Sequences,” Nucleic Acids Research, vol. 10, Issue 9, May 11, 1982 (2951-2061). [cited by applicant]
Sun et al., “Recent advances in targeted genome engineering in mammalian systems,” Biotechnology Journal, vol. 7: 1074-1087 (2012). [cited by applicant]
Tulpan, et al., “HyDEn: A Hybrid Steganocryptographic Approach for Data Encryption Using Randomized Error Correcting DNA Codes,”, Biomed Research International, vol. 32, No. 4839, pp. 1-11, (2013). [cited by applicant]
Verardo, D., et al., “Multiplex enzymatic synthesis of DNA with single-base resolution”, Science Advances, Jul. 7, 2023 (13 pgs). [cited by applicant]
Yang et al., “Permanent genetic memory with >1-byte capacity,” Nature Methods, vol. 11(12): 1261-1266 (2014) including pp. 1-3 of Online Methods, and pp. 1-30 of Supplementary Figures and Text. [cited by applicant]
Yazdi et al., “A Rewritable, Random-Access DNA-Based Storage System,” Scientific Reports, vol. 5(14138): 1-10 (2015), including pp. 1-19 of Supplementary Information. [cited by applicant]
Yazdi et al., “DNA-based storage: Trends and Methods,” IEEE Transactions on Molecular, Biological, and Multi-Scale Communications, vol. 1(3): 230-248 (Sep. 1, 2015). [cited by applicant]
Yazdi, et al., “Portable and Error-Free DNA-Based Data Storage”, bioRxiv preprint doi: https://doi.org/10.1101/079442 (2016). [cited by applicant]