We show that an important problem ($k$-ICG) in computational biology is
equivalent to a colored version of a well-known graph layout problem ($k$-CVS).Comment: 7 page

Dinneen, Michael J.

English

arXiv

In this short note, we show that an important problem in computational biology is equivalent to a colored version of a well-known graph layout problem. In order to map the human genome, biologists use graph theory, particularly interval graphs, to model the overlaps of DNA clones (cut up segments of a genome) [Mir94]. Fo

VLSI layouts and DNA physical mappings

Abstract

Similar works

Full text

Available Versions

CiteSeerX