Skip to main content

Table 1 Summary of the best (∙), medium () and worst (×) reordering algorithms for the first experiment (Block)

From: PQR sort: using PQR trees for binary matrix reorganization

Experiment: block Matrix sizes and noise ratios
100 × 100 1,000 × 1,000
Evaluator Coefficient Algorithm 0.01 0.02 0.05 0.1 0.01 0.02 0.05 0.1
Anti-Robinson Jaccard 2D sort × × × × × × × ×
Sugiyama
PQR sort ×
  Simple matching 2D sort
  Sugiyama ×
  PQR sort × × × × × × ×
Minimal span Jaccard 2D sort
Sugiyama × × × × × × × ×
PQR sort
  Simple matching 2D sort
  Sugiyama × × × × × × × ×
  PQR sort
Execution time   2D sort
  Sugiyama × × × × ×
  PQR sort × × ×