392 search results - page 11 / 79 » Reversal Complexity Revisited |
JCB
2007
13 years 7 months ago
2007
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 genome...
SMC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ICPP
2009
IEEE
14 years 2 months ago
2009
IEEE
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
CPM
2009
Springer
14 years 2 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...