Cargando…
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...
Autores principales: | Swenson, Krister M, To, Yokuki, Tang, Jijun, Moret, Bernard ME |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
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 |
Ejemplares similares
-
Inversion-based genomic signatures
por: Swenson, Krister M, et al.
Publicado: (2009) -
Heuristics for the inversion median problem
por: Rajan, Vaibhav, et al.
Publicado: (2010) -
Estimating true evolutionary distances under rearrangements, duplications, and losses
por: Lin, Yu, et al.
Publicado: (2010) -
Using synchronized oscillators to compute the maximum independent set
por: Mallick, Antik, et al.
Publicado: (2020) -
Gene rearrangement analysis and ancestral order inference from chloroplast genomes with inverted repeat
por: Yue, Feng, et al.
Publicado: (2008)