The length of DNA strands is an important resource in DNA computing. We sho
w how to decrease strand lengths in known molecular algorithms for some NP-
complete problems, such as like 3-SAT and Independent Set, without substant
ially increasing their running time or volume. (C) 1999 Elsevier Science Ir
eland Ltd. All rights reserved.