论文信息 - The hardness of intervalizing four colored caterpillars

The hardness of intervalizing four colored caterpillars

Abstract The problem of intervalizing colored graphs (ICG) has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-complete for general graphs for k ⩾4 and has polynomial time algorithms for k =2 and 3. In this paper we show that the ICG problem is NP-complete when the graph is a caterpillar tree, colored with k ⩾4 colors, strengthen the cases for which the problem remains difficult.

Maria J. Serna | Carme Àlvarez | Josep Díaz

[1] Serge Abiteboul,et al. Proceedings of the 21st International Colloquium on Automata, Languages and Programming , 1994 .

[2] Ron Shamir,et al. Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

[3] M. Fellows,et al. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy , 1994, Symposium on the Theory of Computing.

[4] Michael J. Dinneen. VLSI layouts and DNA physical mappings , 1995 .

[5] M. Golumbic,et al. On the Complexity of DNA Physical Mapping , 1994 .

[6] João Meidanis,et al. Introduction to computational molecular biology , 1997 .

[7] Hans L. Bodlaender,et al. Intervalizing k-Colored Graphs , 1995, ICALP.

[8] Michael R. Fellows,et al. DNA Physical Mapping: Three Ways Difficult , 1993, ESA.

[9] M. del Carme Álvarez Faura,et al. Intervalizing colored graphs is NP-complete for caterpilars with hair length 2 , 1998 .

[10] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[11] Haim Kaplan,et al. Physical Maps and Interval Sandwich Problems: Bounded Degrees Help , 1996, ISTCS.