Programs for phylogenetic networks:
- Solving the cluster containment problem for arbitrary phylogenetic networks
- Computing the soft Robinson--Foulds distance between arbitrary phylogenetic networks
New version: More efficient way to deal with invisible components