The complexity of finding minimum-length generator sequences
Theoretical Computer Science
The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science
An integrated complexity analysis of problems from computational biology
An integrated complexity analysis of problems from computational biology
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Sorting Strings by Reversals and by Transpositions
SIAM Journal on Discrete Mathematics
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
The longest common subsequence problem.
The longest common subsequence problem.
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Average parameterization and partial kernelization for computing medians
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the closest string via rank distance
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 5.23 |
We consider the swap distance and the element duplication distance. We show that the swap centre permutation problem is NP-complete. We show that the element duplication centre problem is NP-complete.