152 search results - page 4 / 31 » Sorting by reversals is difficult |
ITNG
2007
IEEE
14 years 1 months ago
2007
IEEE
A block-interchange is a rearrangement event that exchanges two, not necessarily consecutive, contiguous regions in a genome, maintaining the original orientation. Signed reversal...
IPL
2008
13 years 7 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
DAM
2007
13 years 7 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
MFCS
2005
Springer
14 years 29 days 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...
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...