10 search results - page 1 / 2 » Approximating Reversal Distance for Strings with Bounded Num... |
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
COMBINATORICS
2007
13 years 4 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
DAM
2008
13 years 4 months ago
2008
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
AB
2007
Springer
13 years 8 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...