Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
Prefix reversals on binary and ternary strings
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Minimum common string partition revisited
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimum common string partition problem: hardness and approximations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
String rearrangement metrics: a survey
Algorithms and Applications
Reversal distance for strings with duplicates: linear time approximation using hitting set
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Minimum common string partition revisited
Journal of Combinatorial Optimization
The complexity of string partitioning
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The problems of sorting by reversals and sorting by transpositions have been studied because of their applications to genome comparison. Prior studies of both problems have assumed that the sequences to be compared (or sorted) contain no duplicates, but there is a natural generalization in which the sequences are allowed to contain repeated characters. In this paper we study primarily the versions of these problems in which the strings to be compared are drawn from a binary alphabet. We obtain upper and lower bounds for reversal and transposition distance and show that the problem of finding reversal distance between binary strings, and therefore between strings over an arbitrary fixed-size alphabet, is NP-hard.