genesis
genesis copied to clipboard
Bipartition Utils
Bipartitions are very important representations to analyse tree topologies. Maybe we can create a Bipartition Utils containing
- extraction algorithms
- efficient bipartition representations (Sparse BitVector Format or a Compressed BitVector Format)
- distance functions
There is a very small Bipartition class in ./lib/tree/, which can extract Bipartitions so far. In the future, we should build in your ideas, I agree.
As for the different ways of representing bit-information (naive, sparse, compressed, ...), a software engineer way would be to write an interface class and derive the implementations from that. This way, you can plug in whatever you need.