A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

0.00 Avg rating0 Votes
Article ID: iaor2008413
Country: Netherlands
Volume: 4
Issue: 2
Start Page Number: 154
End Page Number: 162
Publication Date: Jun 2007
Journal: Discrete Optimization
Authors: , , , ,
Keywords: biology
Abstract:

We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer 𝓁 together with a set S of words of length k. over the four symbols A, C, G, T. The problem is to decide whether there exists a word of length 𝓁 that contains every word in S at least once as a subword, and does not contain any other subword of length k. The computational complexity of this problem has been open for some time, and it remains open. What we prove is that this problem is polynomial time equivalent to the exact perfect matching problem in bipartite graphs, which is another infamous combinatorial optimization problem of unknown computational complexity.

Reviews

Required fields are marked *. Your email address will not be published.