	US 12,380,337 B2
	Coded trace reconstruction
Olgica Milenkovic, Urbana, IL (US); Ryan Gabrys, San Diego, CA (US); João Ribeiro, London (GB); and Mahdi Cheraghchi Bashi Astaneh, London (GB)
Assigned to the Board of Trustees of the University of Illinois, Urbana, IL (US); and Imperial College Innovations Limited, London (GB)
Filed by The Board of Trustees of the University of Illinois, Urbana, IL (US)
Filed on Oct. 13, 2020, as Appl. No. 17/069,247.
Claims priority of provisional application 62/925,332, filed on Oct. 24, 2019.
Prior Publication US 2021/0125079 A1, Apr. 29, 2021
Int. Cl. G01N 33/48 (2006.01); C12N 15/10 (2006.01); C12Q 1/6869 (2018.01); G01N 33/50 (2006.01); G06N 3/123 (2023.01); G06N 3/126 (2023.01)

CPC G06N 3/123 (2013.01) [C12N 15/1065 (2013.01); C12Q 1/6869 (2013.01); G06N 3/126 (2013.01)]

12 Claims

1. A method, comprising:

partitioning a message having a message length n bits into a plurality of blocks with a maximum block length of O(log²n);

encoding each block to provide a plurality of encoded blocks;

inserting unique markers between the encoded blocks so as to form an encoded message, wherein the markers each have a minimum marker length O(log n); and

synthesizing a DNA having a nucleotide sequence based on the encoded message.