amnh / PCG

𝙋𝙝𝙮𝙡𝙤𝙜𝙚𝙣𝙚𝙩𝙞𝙘 𝘾𝙤𝙢𝙥𝙤𝙣𝙚𝙣𝙩 𝙂𝙧𝙖𝙥𝙝 ⸺ Haskell program and libraries for general phylogenetic graph search
28 stars 1 forks source link

Add "clustering" wagner build option #129

Closed recursion-ninja closed 5 years ago

recursion-ninja commented 5 years ago

Consider using a K-means clustering pass over the leaf set to determine how to build Wagner trees in parallel. @Boarders has a solid vision of how to move forward on implementing this.

The K-mean pass should converge in linear time with a K constant factor. The hypothesis is that this will provide a better/faster tree construction, by using clustering to determine the leaf set permutation instead of a random permutation.

Boarders commented 5 years ago

This feature is now (finally!) merged in this commit: https://github.com/amnh/PCG/commit/b4bb7e877d2701bc56689290060cfa2a559f25cf