## Abstract

The problems of Interval Sandwich (IS) and Intervalizing Colored Graphs (ICG) have received a lot of attention recently, due to their applicability to DNA physical mapping problems with ambiguous data. Most of the results obtained so far on the problems were hardness results. Here we study the problems under assumptions of sparseness, which hold in the biological context. We prove that both problems are polynomial when either (1) the input graph degree and the solution graph clique size are bounded, or (2) the solution graph degree is bounded. In particular, this implies that ICG is polynomial on bounded degree graphs for every fixed number of colors, in contrast with the recent result of Bodlaender and de Fluiter.

Original language | English |
---|---|

Pages (from-to) | 96-104 |

Number of pages | 9 |

Journal | Algorithmica |

Volume | 24 |

Issue number | 2 |

DOIs | |

State | Published - Jun 1999 |

## Keywords

- Computational biology
- Design and analysis of algorithms
- Interval graphs
- Parametrized complexity