Abstract
In this paper, the translocation sorting problem for unsigned genomes is proved to be NP-hard. The proof is based on the relation between maximum alternating cycle decomposition of break point graphs with respect to unsigned chromosomes and translocation sorting for unsigned genomes.
| Original language | English |
|---|---|
| Pages (from-to) | 471-475 |
| Journal | Journal of Information and Computational Science |
| Volume | 1 |
| Issue number | 3 |
| Publication status | Published - Dec 2004 |
| Externally published | Yes |
Research Keywords
- Algorithm
- Break point graph
- NP-hard
- Translocation