4315 search results - page 23 / 863 » Sorting in linear time |
145
Voted
RECOMB
2010
Springer
15 years 1 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...
122
Voted
SPAA
1995
ACM
15 years 6 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
156
click to vote
CPM
2009
Springer
15 years 9 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...
96
Voted
ASIACRYPT
2004
Springer
15 years 8 months ago
2004
Springer
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous num...
126
click to vote
DAM
2007
15 years 2 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...