Faster subflats and squangles functions

This version of SplitP was used for simulations detailed in the paper Evaluation of the relative performance of the subflattenings method for phylogenetic inference

Bug Fixes

v0.1.7

Create python-publish.yml

Bug fixes and new README

v0.1.5

Update VERSION

Sparse matrices and Squangles

Trees with more than 9 taxa will be feasible now, thanks to sparse matrices and signed sums.
Use sparse_flattening and sparse_subflattening functions for more than 9 taxa.

Splits are now written as two strings in base (m+n) separated by |.
For example, 01234567|89ABCDEF

Squangles are also implemented for the purpose of inferring quartet trees.

New tree implementation

v0.1.1

Update VERSION

Final release before new tree implementation

The final release before the tree implementation in SplitP is changed to use networkx.

This release should be used to run the code used for the results in my thesis (in the 'examples' folder)

First Public Release

v0.0.3

bump version number