17 search results - page 1 / 4 » Sorting Signed Permutations by Inversions in O(nlogn) Time |
RECOMB
2009
Springer
14 years 4 months ago
2009
Springer
STOC
1995
ACM
13 years 7 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
WABI
2005
Springer
13 years 9 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
RECOMB
2006
Springer
14 years 4 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...