Bandelt encoding / decoding algorithm implementation


I implemented the Bandelt encoding/decoding algorithm from the paper "Reconstructing the shape of a tree from observed dissimilarity data" which was published by Hans-Jürgen Bandelt in 1985. I did a thorough survey and realized that this algorithm has not been implemented online.

What this algorithm does is to compress a rooted tree with n nodes into an array with n-1 elements without losing its structure information. This algorithm can be used to reduce the storing size of trees because it does not store the brackets information.

  Presentation slides

  Related Links