Sciweavers

138 search results - page 13 / 28
» Advances on sorting by reversals
Sort
View
MST
1998
91views more  MST 1998»
13 years 7 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
CEC
2007
IEEE
13 years 12 months ago
Ranking-Dominance and Many-Objective Optimization
An alternative relation to Pareto-dominance is studied. The relation is based on ranking a set of solutions according to each separate objective and an aggregation function to calc...
Saku Kukkonen, Jouni Lampinen
DRM
2003
Springer
14 years 1 months ago
Obfuscation of design intent in object-oriented applications
Protection of digital data from unauthorized access is of paramount importance. In the past several years, much research has concentrated on protecting data from the standpoint of...
Mikhail Sosonkin, Gleb Naumovich, Nasir D. Memon
RECOMB
2008
Springer
14 years 8 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader