Cargando...
On the Complexity of Rearrangement Problems under the Breakpoint Distance
We study the complexity of rearrangement problems in the generalized breakpoint model of Tannier et al. and settle several open questions. We improve the algorithm for the median problem and show that it is equivalent to the problem of finding maximum cardinality nonbipartite matching (under linear...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Mary Ann Liebert, Inc.
2014
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3887456/ https://ncbi.nlm.nih.gov/pubmed/24200391 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1089/cmb.2013.0004 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|