Title: Length Bounded Molecular Computing

Authors: Bin Fu and Richard Beigel

Abstract: Length of DNA strands is an important resource in DNA computing. We show how to decrease strand lengths in known molecular algorithms for some NP-complete problems, such as like 3-SAT and Independent Set, without substantially increasing their running time or volume.

Download Full Paper