Cargando…
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...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2011
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3283313/ https://www.ncbi.nlm.nih.gov/pubmed/22151948 http://dx.doi.org/10.1186/1471-2105-12-S9-S17 |