Talk abstract:

On Encoding in DNA Words

Natasha Jonoska
Department of Mathematics
University of South Florida

We discuss the problem of designing DNA codes, sets of words over alphabet {A, G, C, T} that satisfy certain constraints. The motivation for this problem comes from the need to reliably store and retrieve information in synthetic DNA strands. This is in particular needed in the models of DNA based computations and the design of molecular bar codes in chemical libraries.

Back to Codes, Systems and Graphical Models