Maximum independent sets of commuting and noninterfering inversions
<p>Abstract</p> <p>Background</p> <p>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 medi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2009-01-01
|
| Series: | BMC Bioinformatics |