We study the information theoretic limits of DNA
assembly from paired reads. Each paired read consists of two
subsequences of the DNA separated by a certain genomic
distance. We show that this problem can be naturally cast as
assembly of 2-D jigsaw puzzles. Using this representation, we derive a necessary condition for assembly and show that it is
nearly achieved on several probabilistic genome models.