VLSI layouts and DNA physical mappings
classification
🧮 math.CO
q-bio
keywords
problembiologycoloredcomputationalequivalentgraphimportantlayout
read the original abstract
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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.