The distance and median problems in the single-cut-or-join model with single-gene duplications
Abstract Background. In the field of genome rearrangement algorithms, models accounting for gene duplication lead often to hard problems. For example, while computing the pairwise distance is tractable in most duplication-free models, the problem is NP-complete for most extensions of these models ac...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
BMC
2020-05-01
|
| Colección: | Algorithms for Molecular Biology |
| Materias: | |
| Acceso en línea: | http://link.springer.com/article/10.1186/s13015-020-00169-y |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|