138 search results - page 6 / 28 » Advances on sorting by reversals |
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
AMC
2007
13 years 8 months ago
2007
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
DM
2007
13 years 7 months ago
2007
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...