Sciweavers

85 search results - page 4 / 17
» On Sorting Permutations by Double-Cut-and-Joins
Sort
View
COCOON
2010
Springer
15 years 5 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
CCS
2010
ACM
16 years 1 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...
RECOMB
2009
Springer
16 years 7 months ago
Sorting Signed Permutations by Inversions in O(nlogn) Time
Krister M. Swenson, Vaibhav Rajan, Yu Lin, Bernard...
BIOINFORMATICS
2005
68views more  BIOINFORMATICS 2005»
15 years 6 months ago
Efficient sorting of genomic permutations by translocation, inversion and block interchange
Sophia Yancopoulos, Oliver Attie, Richard Friedber...
IPL
2010
117views more  IPL 2010»
15 years 1 months ago
An improved algorithm for sorting by block-interchanges based on permutation groups
Yen-Lin Huang, Cheng-Chen Huang, Chuan Yi Tang, Ch...