19 search results - page 2 / 4 » Sorting by Block-Interchanges and Signed Reversals |
BIOCOMP
2006
13 years 6 months ago
2006
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
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...
WABI
2005
Springer
13 years 10 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...
TCBB
2010
12 years 11 months ago
2010
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...