A probabilistic parameterized algorithm for vertex cover in sticker model

Summary form only given. We present a probabilistic parameterized algorithm for the problem of vertex cover with time complexity O(p2^k), where k is a parameter of the given instance, and p is a polynomial function on the input size. Furthermore, we implement this algorithm within sticker model by DNA computing, with space complexity O(2^k) and polynomial time complexity O(n²), where n is the number of vertexes.