A carregar...
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...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BioMed Central
2011
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3283313/ https://ncbi.nlm.nih.gov/pubmed/22151948 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-12-S9-S17 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|