Coded Trace Reconstruction in a Constant Number of Traces

Explore a 21-minute IEEE conference talk on coded trace reconstruction, focusing on its application in DNA storage. Delve into the concept of coding, the challenges of trace reconstruction, and the breakthrough of achieving reconstruction with a constant number of traces. Examine the average-case scenario, related topics such as BDC capacity, and upper bounds for large alphabets and binary cases. Gain insights from Stanford University researchers Joshua Brakensiek, Ray Li, and Bruce Spang as they present their findings and discuss open questions in this cutting-edge field of information theory and computational biology.

Intro
The whole talk on one slide
Coding for DNA Storage Trace reconstruction
What is a code?
Trace reconstruction is haru
Constant # traces
Average - codeu
Related: BDC capacity
Large alphabet UB
Binary UB
Open questions