Batch optimization for balanced binary sequences and DNA sequences

Yiming Ma · 2025

Read Batch optimization for balanced binary sequences and DNA sequences by Yiming Ma (2025) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-12750718.txt.

Description

Yiming Ma studies batch design for DNA data storage in a 2025 paper. Storing data in DNA is dense and durable, but writing strands is slow and costly. Array synthesis cost rides on the shortest shared supersequence a batch of strands needs.

Ma asks how to split a pool of balanced sequences into batches to shrink the total cost. For the full set of balanced binary strings, combinatorial work gives exact and near-exact cost forms. The same holds for balanced DNA strings at large sizes. Past bounds came from chance arguments; the new forms sharpen them. Cheaper batching brings DNA archives a step closer.

Catalog record

CREATORYiming Ma
YEAR2025
COLLECTIONPAPERS
FORMATTXT
FILE SIZE399 KB
VERSION1.0
LICENSECC BY 4.0
RIGHTSCC BY
SOURCEEurope PMC

Source: https://europepmc.org/articles/PMC12750718

Browse the full library · About the Tower of Babel