DNA sequencing, Eulerian graphs, and the exact perfect matching problem

J. Blazewicz, P. Formanowicz, M. Kasprzak, P. Schuurman, G.J. Woeginger

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    9 Citaten (Scopus)


    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.
    Originele taal-2Engels
    TitelProceedings of the 28th Workshop on Graph-Theoretic Concepts in Computer Science (WG'02, Cseky Krumlov, Czech Republic, June 13-15, 2002)
    Plaats van productieBerlin
    StatusGepubliceerd - 2002

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743


    Duik in de onderzoeksthema's van 'DNA sequencing, Eulerian graphs, and the exact perfect matching problem'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit