Sciweavers

19 search results - page 1 / 4
» Sorting by Block-Interchanges and Signed Reversals
Sort
View
ITNG
2007
IEEE
13 years 11 months ago
Sorting by Block-Interchanges and Signed Reversals
A block-interchange is a rearrangement event that exchanges two, not necessarily consecutive, contiguous regions in a genome, maintaining the original orientation. Signed reversal...
Cleber V. G. Mira, Joao Meidanis
CORR
2004
Springer
168views Education» more  CORR 2004»
13 years 4 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 8 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
RECOMB
2010
Springer
13 years 3 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
MFCS
2005
Springer
13 years 10 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
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...
Petr Kolman