95 search results - page 2 / 19 » A more efficient algorithm for perfect sorting by 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...
RECOMB
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
ACSC
2003
IEEE
13 years 9 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
RECOMB
2010
Springer
13 years 3 months ago
2010
Springer
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...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...