Minimum path length (TSP) (What is seriation ?)
This seriation method reorganizes data so that the sum of all
pairwise distances of adjacent elements in the ordering is minimized:
Without a clusturing tree, the algorithmical problem is similar to the so
called Traveling Salesman Problem (TSP). The task is to find the shortest
round trip for the salesman through all city.
PermutMatrix use the leaf ordering algorithm proposed by Bar-Joseph
et al. (2001). This algorithm runs in time
and,
for that reason, processing time could be long for large dataset (n>1000).