an:00981915
Zbl 0867.92008
Bodlaender, Hans L.; de Fluiter, Babette
On intervalizing \(k\)-colored graphs for DNA physical mapping
EN
Discrete Appl. Math. 71, No. 1-3, 55-77 (1996).
00037339
1996
j
92C40 92D20 05C90 05C15 05C38 68Q25
sequence reconstruction; molecular biology; colored interval graph; \(O(n^ 2)\) algorithm for biconnected graphs
Summary: The problem of determining whether a given \(k\)-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. We study the problem for the case that the number of colors \(k\) is fixed. For \(k=2\), we give a simple linear time algorithm, for \(k=3\), we give an \(O(n^2)\) algorithm for biconnected graphs with \(n\) vertices, and for \(k=4\), we show that the problem is NP-complete.