85 search results - page 11 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
63
Voted
CORR
2000
Springer
14 years 9 months ago
2000
Springer
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
112
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: The identification of transcription factors (TFs) associated with a biological process is fundamental to understanding its regulatory mechanisms. From microarray data,...
RECOMB
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
181
click to vote
Book
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...