739 search results - page 40 / 148 » Sorting Algorithms |
CIDR
2003
13 years 9 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
IACR
2011
12 years 7 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
CPM
2004
Springer
13 years 11 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
COMBINATORICS
2002
13 years 7 months ago
2002
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a singl...