Maximum independent sets of commuting and noninterfering inversions

BACKGROUND: Given three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard to approximate. Yet median-based approaches to phylogenetic reconstruction have...

Descripción completa

Detalles Bibliográficos
Autores principales: Swenson, Krister M, To, Yokuki, Tang, Jijun, Moret, Bernard ME
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2009
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648783/
https://www.ncbi.nlm.nih.gov/pubmed/19208163
http://dx.doi.org/10.1186/1471-2105-10-S1-S6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648783/
https://www.ncbi.nlm.nih.gov/pubmed/19208163
http://dx.doi.org/10.1186/1471-2105-10-S1-S6

Ejemplares similares