202 search results - page 23 / 41 » Counting Distance Permutations |
CMOT
2004
13 years 8 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
DAM
2007
13 years 9 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
WABI
2001
Springer
14 years 1 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
IPL
2006
13 years 9 months ago
2006
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
JAL
2002
13 years 8 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...