Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-break rearrangements and chromosomal evolution
Theoretical Computer Science
Sorting Cancer Karyotypes by Elementary Operations
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Prefix reversals on binary and ternary strings
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
SIAM Journal on Discrete Mathematics
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Transposition Rearrangement: Linear Algorithm for Length-Cost Model
Annales UMCS, Informatica
Transposition Rearrangement: Linear Algorithm for Length-Cost Model
Annales UMCS, Informatica
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
Prefix transpositions on binary and ternary strings
Information Processing Letters
| Hi-index | 0.00 |
Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NP-hard, while for "dense" instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as well as investigating the distance between random strings and the problem of sorting a string over a finite alphabet.