Add to ORKGExtending 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
International audienceThe Sorting by Prefix Reversals problem consists insorting the elements of a g...
Various global rearrangements of permutations, such as reversals and transpositions, have recently b...
In computational biology, genome rearrangements is a field in which we study mutational events affec...
Extending results of Christie and Irving, we examine the action of reversals and transpositions on f...
International audienceWe study the String Reversal Distance problem, an extension of the well-known ...
International audienceWe study the String Reversal Distance problem, an extension of the well-known ...
AbstractA transposition is an operation that exchanges two adjacent substrings. Transpositions over ...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
For a string A = a1... an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a stri...
AbstractFor a string A=a1…an, a reversal ρ(i,j), 1⩽i⩽j⩽n, transforms the string A into a string A′=a...
The contemporary computational biology gives motivation to study dependencies between finite sequenc...
AbstractThe problem of sorting signed permutations by reversals is inspired by genome rearrangement ...
AbstractAn important problem in computational biology is the genome rearrangement using reversals an...
International audienceIn comparative genomics, a transposition is an operation that exchanges two co...
International audienceThe Sorting by Prefix Reversals problem consists insorting the elements of a g...
Various global rearrangements of permutations, such as reversals and transpositions, have recently b...
In computational biology, genome rearrangements is a field in which we study mutational events affec...
Extending results of Christie and Irving, we examine the action of reversals and transpositions on f...
International audienceWe study the String Reversal Distance problem, an extension of the well-known ...
International audienceWe study the String Reversal Distance problem, an extension of the well-known ...
AbstractA transposition is an operation that exchanges two adjacent substrings. Transpositions over ...
Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order ...
For a string A = a1... an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a stri...
AbstractFor a string A=a1…an, a reversal ρ(i,j), 1⩽i⩽j⩽n, transforms the string A into a string A′=a...
The contemporary computational biology gives motivation to study dependencies between finite sequenc...
AbstractThe problem of sorting signed permutations by reversals is inspired by genome rearrangement ...
AbstractAn important problem in computational biology is the genome rearrangement using reversals an...
International audienceIn comparative genomics, a transposition is an operation that exchanges two co...
International audienceThe Sorting by Prefix Reversals problem consists insorting the elements of a g...
Various global rearrangements of permutations, such as reversals and transpositions, have recently b...
In computational biology, genome rearrangements is a field in which we study mutational events affec...