We design volume-efficient molecular algorithms for all problems in #P, using only reasonable biological operations. In particular, we give a polynomial-time 0(2(n)n2log2n)-volume algorithm to compute the number of Hamiltonian paths in an n-node graph. This improves Adleman's celebrated n!-volume algorithm for finding a single Hamiltonian path.
Human telomerase reverse transcriptase (hTERT) is a critical factor in unlimited cell proliferation and immortalization, with numerous studies demonstrating that high expression of hTERT is a poor prognostic factor in various types of cancer. Ubiquitin-conjugating enzyme E2D 3 (UBE2D3) is a member of the E2 family, and participates in the ubiquitin… (More)