Approximating the double-cut-and-join distance between unsigned genomes
In this paper we study the problem of sorting unsigned genomes by double-cut-and-join operations, where genomes allow a mix of linear and circular chromosomes to be present. First, we formulate an equivalent optimization problem, called maximum cycle/path decomposition, which is aimed at finding a l...
| Main Authors: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Journal Article |
| Idioma: | English |
| Publicado em: |
2013
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/10356/100350 http://hdl.handle.net/10220/17879 |