DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

Authors:
Jacek Blazewicz;Piotr Formanowicz;Marta Kasprzak;Petra Schuurman;Gerhard J. Woeginger
Affiliations:
-;-;-;-;-
Venue:
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2002

Citing 8
Cited 0

Matching is as easy as matrix inversion

Combinatorica
Exact arborescences, matchings and cycles

Discrete Applied Mathematics
Optimizing over a slice of the bipartite matching polytope

Discrete Mathematics - Proceedings of the Oberwolfach Meeting "Kombinatorik," January 19-25, 1986
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
The complexity of restricted spanning tree problems

Journal of the ACM (JACM)
On some properties of DNA graphs

Discrete Applied Mathematics
Complexity of DNA sequencing by hybridization

Theoretical Computer Science
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer l 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 l 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.